33
Department of Information Technology COURSE STRUCTURE & SYLLABUS B.Tech. 5 th Semester Code Name of the Subject Lectures Tutorials Practical Credits ECE3428 Microprocessors and Interfacing 3 1 - 4 IT3409 Automata Compiler Design 3 1 - 4 CSE3412 Computer Graphics 3 1 - 4 IT3410 Computer Networks 3 1 - 4 CSE3409 Software Engineering 3 1 - 4 ECE3230 Microprocessors and Interfacing Lab - - 3 2 IT3211 Computer Networks Lab - - 3 2 IT3212 OS and CD Lab - - 3 2 Total 15 5 09 26 B.Tech. 6 th Semester Code Name of the Subject Lectures Tutorials Practical Credits IT3413 Data Warehousing and Mining 3 1 - 4 IT3414 Object Oriented Analysis and Design 3 1 - 4 IT3415 Web technologies 3 1 - 4 Elective – I ECE3421 IT3416 IT3417 i) Digital Signal Processing ii) Distributed Databases iii) System Simulation and Modeling 3 1 - 4 Elective - II (Open Elective)

Department of Information Technology COURSE STRUCTURE

  • Upload
    others

  • View
    1

  • Download
    0

Embed Size (px)

Citation preview

Page 1: Department of Information Technology COURSE STRUCTURE

Department of Information Technology

COURSE STRUCTURE & SYLLABUS

B.Tech. 5th

Semester

Code Name of the Subject Lectures Tutorials Practical Credits

ECE3428 Microprocessors and Interfacing 3 1 - 4

IT3409 Automata Compiler Design 3 1 - 4

CSE3412 Computer Graphics 3 1 - 4

IT3410 Computer Networks 3 1 - 4

CSE3409 Software Engineering 3 1 - 4

ECE3230 Microprocessors and Interfacing

Lab -

- 3 2

IT3211 Computer Networks Lab - - 3 2

IT3212 OS and CD Lab - - 3 2

Total 15 5 09 26

B.Tech. 6th

Semester

Code Name of the Subject Lectures Tutorials Practical Credits

IT3413 Data Warehousing and Mining 3 1 - 4

IT3414 Object Oriented Analysis and

Design 3 1 - 4

IT3415 Web technologies 3 1 - 4

Elective – I

ECE3421

IT3416

IT3417

i) Digital Signal Processing

ii) Distributed Databases

iii) System Simulation and

Modeling

3 1

- 4

Elective - II (Open Elective)

Page 2: Department of Information Technology COURSE STRUCTURE

IT3418

ECE3425

CHEM3425

ME3431

EEE3427

CSE3416

i) Cloud Computing ( IT)

ii) Disaster Management (Civil)

iii) Fundamentals of Global

Positioning System (ECE)

iv) Industrial Safety and Hazards

Management (Chem.)

v) Operation Research (Mech.)

vi) Renewable Energy Resources

(EEE)

vii) Soft Computing (CSE)

3 1 - 4

GMR30001 Audit Course

Laboratories

IT3219 Object Oriented Analysis and

Design Lab - 3 2

IT3220 Web Technologies Lab - 3 2

GMR30206 Term Paper - 3 2

Total 15 05 9 26

Page 3: Department of Information Technology COURSE STRUCTURE

B.Tech- 5th

Semester

SYLLABUS (Applicable for 2012-13 admitted batch)

Course Title: MICROPROCESSORS AND INTERFACING Course Code: ECE 3429

L T P C

3 1 0 4

Course objectives:

Students undergoing this course are expected to:

1. Familiarize with the architecture of 8086 processor, assembling language programming and

interfacing with various modules.

2. Learn to Interface various I/O peripherals like ADC, DAC, Keyboard, stepper motor etc., with

microprocessors using 8255 PPI.

3. Do any type of industrial and real time applications by knowing the concepts of

Microprocessors

4. Understand 8251-USARTand serial communication concepts.

Course Outcomes:

After undergoing the course, students will be able to

1. Understand the full internal workings of a typical simple CPU including the utilization of the

various hardware resources during the execution of instructions.

2. Introduce the design of basic I/O hardware and microprocessor interfacing: memory chip

selection, memory expansion, I/O interfacing.

3. Interface input and output devices like LCD, LED, Keyboards ADC, DAC and stepper motor

to microprocessors.

4. Design the home appliances and toys using Microprocessor chips.

UNIT- I

8086 Architecture: (12 hours)

8086-Functional Diagram, Register Organization, Signal description, Physical Memory Organization,

Minimum and Maximum mode operations of 8086, Timing Diagrams.

UNIT- II

Instruction Set of 8086: ( 16 hour )

Addressing modes, Data Transfer Instructions, Arithmetic Instructions, Bit Manipulation Instructions,

Branch Instructions, Processor Control Instructions and String Instructions.Assembler Directives,

Procedures and macros, Assembly Language Programming Examples.

UNIT- III

Programmable devices and Interfacing of I/O with 8086: ( 16 hours)

Semiconductor Memory Interfacing, 8255 PPI-Various modes of operations, Stepper Motor

interfacing, D/A and A/D Conversions, DMA Controller 8257.

Page 4: Department of Information Technology COURSE STRUCTURE

UNIT-IV

8086 Interrupts and Serial Communication (16 hours)

8086 interrupts and Interrupt Vector Table (IVT), Programmable Interrupt Controller 8259A, Serial

data transfer schemes. Asynchronous and Synchronous data transfer schemes, Programmable

Communication Interface 8251 USART, TTL to RS 232C and RS232C to TTL conversion, Sample

program of serial data transfer.

Text Books:

1. Ray and Bhurchandi, “ Advanced Microprocessors”, Tata McGraw-Hill 2nd

edition 2007

2. D.V.Hall, “Microprocessor and Interfacing “, Tata McGraw-Hill.

Reference Books:

1. Microcomputer system 8086/8088 family architecture, programming and design Liu and GA

Gibson, PHI second edition

Page 5: Department of Information Technology COURSE STRUCTURE

B.Tech- 5th

Semester

SYLLABUS

(Applicable for 2012-13 admitted batch)

Course Title: AUTOMATA AND COMPILER DESIGN Course Code: IT3409

L T P C

3 1 0 4

Course Objectives:

The course content enables students to:

1. Understand the phases of compilation process, purpose and implementation approach of each

phase.

2. Apply aspects of theoretical computer science including Languages, Grammars and Machines

in developing a compiler.

3. Evaluate how the compiler does the code optimization effectively.

4. Create a project such as compiler construction by using prior programming language.

Course Outcome:

At the end of the course the students are able to: 1. Understand the requirement of compiler design.

2. Apply working skills in theory and application of finite state machines, recursive descent,

production rules, parsing, and language semantics.

3. Understand about powerful compiler generation tools.

4. Apply the ideas, the techniques, and the knowledge acquired for the purpose of other software

design.

UNIT – I (11+4) Hrs Finite automata: Definition and description of finite automata - NDFA –Conversion between DFA &

NDFA- Minimization of Finite automata-Regular expressions - Overview of compilers- various phases

of Compilers- Design of lexical analyser, Introduction to lex tool.

UNIT – II (11+4) Hrs

Syntax analyzer: Design of syntax analyser - Design of Parsers - Shift Reduce parsers - LR parser -

SLR parser - LALR parser, Introduction to YACC tool.

UNIT-III (11+3) Hrs Syntax directed translation: Syntax directed translation and implementation - Intermediate code -

Postfix notation - Parsing tree - Three addresses Code – Quadruples, Triples ,Indirect Triples.

UNIT-IV (12+4) Hrs

Intermediate code optimization: The principle sources of optimization - Loop Optimization - DAG -

Global data flow analysis.

Code generation: Problems - Machine model - A simple code generator - Register allocation and

assignment - Code generation from DAG - Peep hole optimization.

Text Books: 1. Principles of Compiler Design, by Alfred Aho and Jeffrey D. Ullman

2. Compiler Design by A.A.Puntambekar

Page 6: Department of Information Technology COURSE STRUCTURE

Reference Books: 1. Introduction to Automata Theory, Languages, and Computation by Hopcroft, John E., and Jeffrey

D. Ullman

Page 7: Department of Information Technology COURSE STRUCTURE

B.Tech- 5th

Semester

SYLLABUS

(Applicable for 2012-13 admitted batch)

Course Title: COMPUTER GRAPHICS Course Code: CSE3412

L T P C

3 1 0 4

Course Objectives:

The course content enables students to:

1. Learn basic principles and problems of computer graphics.

2. Know application areas of computer graphics, different display devices and their

characteristics to display an object.

3. Understand background of the geometrical and mathematical foundations with

algorithms for generating points, lines, circles, ellipses and different polygon curves

and surfaces, Learn coordinate systems and different transformations of the object in

2D and 3D coordinate systems like rotation, translation, scaling and reflection.

4. Understand 3D viewing, rendering, visible surface detection algorithms with animation

fundamentals.

Course Outcomes:

At the end of the course students are able to :

1. Be familiarized with contemporary graphics hardware, the actual methodology and

techniques to draw computer graphics, animations etc. for the real world presentation

and how it is implemented in Computer graphics software

2. Develop new kinds of graphics and animations.

3. Design and develop graphics applications with the implementation of advanced

methods such as ray tracing, texture mapping, illumination and shading and be able to

build interactive user interface to manipulate objects in a 3D scene and also in the

development of Web pages.

4. Demonstrate the ability to develop an animation movie.

UNIT – I (11+4) Introduction: Application of Computer Graphics, overview of graphics systems, raster scan systems,

random scan systems, raster scan display processors.

Output primitives : Points and lines, line drawing algorithms( Bresenham’s and DDA Line

derivations and algorithms), mid-point circle and ellipse algorithms. Filled area primitives: Inside

and outside tests,

Scan line polygon fill algorithm, boundary-fill and flood-fill algorithms.

UNIT – II (11+4) 2-D geometrical transforms: Translation, scaling, rotation, reflection and shear transformations,

matrix representations and homogeneous coordinates, composite transforms, transformations between

coordinate systems.

Page 8: Department of Information Technology COURSE STRUCTURE

2-D viewing: The viewing pipeline, viewing coordinate reference frame, window to view-port

coordinate transformation, viewing functions, Cohen-Sutherland and Cyrus beck line clipping

algorithms, Sutherland –Hodgeman polygon clipping algorithm.

UNIT-III (11+4) 3-D object representation: Polygon surfaces, quadric surfaces, spline representation, Hermite curve,

Bezier curve and B-Spline curves, Bezier and B-Spline surfaces.

3-D Geometric transformations: Translation, rotation, scaling, reflection and shear transformations,

composite transformations. 3D Viewing pipeline, clipping, projections (Parallel and Perspective).

UNIT-IV (12+3) Visible surface detection methods: Classification, back-face detection, depth-buffer, scan-line, depth

sorting, BSPtree methods, area sub-division and octree methods.

Computer animation: Design of animation sequence, general computer animation functions, raster

animation, computer animation languages, key frame systems, motion specifications.

Text Books:

1. 1. Computer Graphics C version, Donald Hearn, M.Pauline Baker, Pearson

2. Computer Graphics with Virtual Reality Systems, Rajesh K Maurya, Wiley

Reference Books: 1. Computer Graphics Principles & practice, 2/e, Foley, VanDam, Feiner, Hughes, Pearson

2. Computer Graphics, Peter, Shirley, CENGAGE

Page 9: Department of Information Technology COURSE STRUCTURE

B.Tech- 5th

Semester

SYLLABUS

(Applicable for 2012-13 admitted batch)

Course Title: COMPUTER NETWORKS Course Code: IT3410

L T P C

3 1 0 4

Course Objectives:

The course content enables students to :

1. Understand basic network models and Different transmission used for data

communication.

2. Recognize the data link design issues and various data link protocols used for data

transmission.

3. Understand different routing algorithms used for data transmission from source to

destination in a network layer.

4. Know how internet address are installed and how internet protocols are used in connecting

internet.

Course Outcomes:

At the end of the course students are able to:

1. Suggest appropriate network model for data communication.

2. Know how reliable data communication is achieved through data link layer.

3. Propose appropriate routing algorithm for data routing.

4. Connect internet to the system and knowledge of trouble shooting.

UNIT I: INTRODUCTION (11+4) Hours

Network Hardware, Network Software, and Reference Models: OSI, TCP/IP, The ARPANET,

Network Topologies , Physical Layer: Transmission media: Magnetic Media, Twisted pair, Base band

Coaxial Cable, Fiber optics, Wireless Transmission: Electromagnetic Spectrum, Radio Transmission,

Microwave Transmission.

UNIT II (12+4) Hours Data link layer: Design issues: framing, error detection and correction, CRC, Elementary Data link

Protocols: Stop and wait, Sliding Window protocols: Go-back-n, Selective Repeat, Medium Access

sub layer: Channel allocation methods, Multiple Access protocols: ALOHA, CSMA, IEEE Standard

802.3 and Ethernet, IEEE Standard 802.4: Token bus.

UNIT – III: (10+3) Hours

Network Layer: Network Layer design issues, Virtual circuit and Datagram subnets, Routing

algorithms: Shortest path routing, Flooding, Hierarchical routing, Distance vector routing. Broad cast

and Multi cast routing, Congestion Control: Congestion prevention policies.

Page 10: Department of Information Technology COURSE STRUCTURE

UNIT –IV: (12+4) Hours The Network layer in the internet: The IP Protocol, IP Addresses, and Internet Control Protocols.

Transport Layer: Transport Services, Connection management, Elements of Transport Protocols,

Internet Transport Protocols: UDP and TCP.

Application Layer - Domain name system, Electronic Mail, WWW

TEXT BOOK:

1. Computer Networks — Andrew S Tanenbaum, 4th Edition. Pearson Education /PHI

REFERENCES: 1. Data Communications and Networking - Behrouz A. Forouzan. Third Edition TMH

2. Understanding communications and Networks, 3rd Edition, W.A. Shay, Thomson

Page 11: Department of Information Technology COURSE STRUCTURE

B.Tech- 5th

Semester

SYLLABUS

(Applicable for 2012-13 admitted batch)

Course Title: SOFTWARE ENGINEERING Course Code: CSE3409

L T P C

3 1 0 4

COURSE OBJECTIVE(S):

The course content enables students to :

1. Learn about software myths ,generic view of the process and Understand about process

models

2. Learn how to perform feasibility study of the projects under the requirement engineering

process and system models.

3. Understand about Function oriented design and Architectural styles

4. Get the knowledge of software testing and testing strategies, learn about risk management

plan and quality concepts.

COURSE OUTCOME(S):

At the end of the course students are able to :

1. Design and develop real-time software projects with effective cost estimation and plan

2. Make feasibility study of a project

3. Specify the design and architectural style of the software products

4. Propose testing strategy for a given software

UNIT I: (12+4)

Introduction: software engineering is discipline, software development projects, emergence of

software engineering, Notable Changes in software development process. The evolving role of

software, Changing Nature of Software, Software myths.

Software life cycle Models: need of life cycle model, classical and iterative waterfall model,

Prototype, Evolutionary, spiral model, comparison of all the models.

UNIT II: (11+4)

Software Requirements: Functional and non-functional requirements, User requirements, System

requirements, Interface specification, the software requirements document.

Requirements engineering process: Feasibility studies, Requirements elicitation and analysis,

Requirements validation, Requirements management.

System models: Context Models, Behavioral model1, Data models, Object models, structured

methods.

Page 12: Department of Information Technology COURSE STRUCTURE

UNIT III: (11+4)

Function Oriented Design: Structured analysis, DFD and its Extension, structured design detailed

design.

Design Engineering: Design process and Design quality, Design concepts, the design model.

Creating an architectural design: Software architecture, Data design, Architectural styles and

patterns, Architectural Design

Unit IV: (12+4)

Performing User interface design: Golden rules, User interface analysis and design and steps

Coding and Testing: coding and review, testing, Unit testing, integration testing black box and white

box testing, debugging, system testing, object oriented programs testing,

Risk management: Reactive vs. Proactive Risk strategies, software risks, Risk identification, Risk

projection, Risk refinement, RMMM, RMMM Plan.

Software Quality: Reliability, quality and management system, Quality concepts, ISO, SEI

CMMI,PSP, Six sigma. Quality assurance techniques.

TEXT BOOKS :

1.”Fundamentals of software Engineering” Rajib Mal 3

rd edition, Eastern Economy Edition, ISBN-

978-81-203-3819-7

2. Software Engineering, A practitioner’s Approach- Roger S. Pressman, 6th edition.

McGraw-Hill International Edition.

REFERENCE BOOK:

1. Software Engineering- Sommerville, 7th edition, Pearson education.

Page 13: Department of Information Technology COURSE STRUCTURE

B.Tech- 5th

Semester

SYLLABUS (Applicable for 2012-13 admitted batch)

Course Title: MICROPROCESSORS AND INTERFACING LABCourse Code:ECE3230

L T P C

0 0 3 2

Part-A

Course objectives : The students are intended to:

1. Demonstrate basic knowledge of Microprocessor & Interfacing by understanding the

architecture of 8086 processor

2. Learn Assemblers like MASM/TASM.

3. Learn Assembly language programming and Machine level opcode generation.

4. Interface 8086 with various modules like 8255 – PPI, 8251 – USART.

5. Design any type of industrial oriented and real time applications by knowing the concepts

of Microprocessor.

Course outcomes : After completing the course the students will able to:

1. Control Traffic lights signals using Microprocessors chips.

2. Design computers like desktops , laptops using various processors .

3. Design the high speed communication circuits using serial bus connection for computers.

4. Understand the full internal workings of a typical simple CPU including the utilization of

the various hardware resources during the execution of instructions.

5. Introduce the design of basic I/O hardware and microprocessor interfacing: memory chip

selection, memory expansion, I/O interfacing.

List of Experiments

Part-A

Microprocessor 8086: Any 7 Experiments Introduction to MASM/TASM.

1.Arithmetic operation – Multi byte addition and subtraction, Multiplication and Division – Signed

and unsigned Arithmetic operations, ASCII – arithmetic operations. (Any 2 Experiments)

2.Logic operations – Shift and rotate – Converting packed BCD to unpacked BCD, BCD to ASCII

conversion. ( Any 1 Experiment)

3.String operations-- Move Block, Reverse string, Sorting, Inserting, Deleting, Length of the string,

String

comparison. ( Any 3 Experiments)

4.Modular Program: Procedures and macros -Near and Far implementation. (Any 1 Experiment)

Page 14: Department of Information Technology COURSE STRUCTURE

Part-B

Interfacing 8086 – Any 3 Experiments

1. 8251 – USART.

2. Traffic lights

3. Message Displays

4. Keyboard

5. Stepper Motor

6. DAC

Page 15: Department of Information Technology COURSE STRUCTURE

B.Tech- 5th

Semester

SYLLABUS

(Applicable for 2012-13 admitted batch)

Course Title: COMPUTER NETWORKS LAB Course Code:IT3211

L T P C

0 0 3 2

COURSE OBJECTIVE(S):

The course content enables students to:

1. Understand basic network models and Different transmission media used for data

communication.

2. Understand the data link design issues and various data link protocols used for data

transmission.

3. Comprehend different routing algorithms used for data transmission from source to

destination in a network layer.

4. Know how internet addresses are configured and how internet protocols are used in

connecting internet.

COURSE OUTCOME(S):

At the end of the course students are able to:

1. By learning models students suggest appropriate network model for data communication.

2. Know how reliable data communication is achieved through data link layer.

3. Suggest appropriate routing algorithm for the network.

4. Provide internet connection to the system and its installation.

Course Contents

1. a. Familiarization with Networking Components and devices: LAN Adapters,

Hubs, Switches, Routers etc.

b. Familiarization with Transmission media and Tools: Co-axial cable, UTP

Cable, Crimping Tool, Connectors etc.

2. Preparing the UTP cable for cross and direct connections using crimping tool.

3. Implement the data link layer framing methods :

a) character stuffing b) bit Stuffing

4. Implement on a data set of characters the two CRC polynomials: CRC 12, CRC 16

5. Implement on a data set of characters the CRC polynomials: CRC CCIP .

6. Implementation of sliding window protocol: go back n sliding window protocol

7. Implement Dijkstra ‘s algorithm to compute the Shortest path thru a graph.

Page 16: Department of Information Technology COURSE STRUCTURE

8. Take an example subnet graph with weights indicating delay between nodes. Now

Obtain Routing table art each node using distance vector routing algorithm.

9. Take an example subnet of hosts. Obtain broadcast tree for it

10. To configure the IP address for a computer connected to LAN and to configure

network parameters of a web browser for the same computer.

11. Configuration of TCP/IP Protocols in Windows .

12. a. Installing of internal modem and connecting to Internet.

b. To configure WiFi for your PC.

Page 17: Department of Information Technology COURSE STRUCTURE

B.Tech- 5th

Semester

SYLLABUS

(Applicable for 2012-13 admitted batch)

Course Title: OPERATING SYSTEMS & COMPILER DESIGN LABCourse Code: IT3212

L T P C

0 0 3 2

Course Objectives: The course aims to

1. Understand concepts such as Scheduling, Memory Management, Multi-threading, required in

the design of Operating Systems.

2. Analyze the various scheduling algorithms, fitting strategies, deadlock detection.

3. Apply the knowledge of design various phases of compiler such as Lexical analyzer, syntax

analyzer, semantic analyzer, intermediate code generator, code optimizer and code generator.

4. Design compiler construction tools such as Lexical Analyzer and parser generator.

Course Outcomes: After completion of this course, the students would be able to

1. Determining the reasons of deadlocks, and their remedial measures in an operating system

2. Comparing and analyzing different file systems being used in different operating systems.

3. Understand, and use Context free grammar, and parse tree construction

4. Evaluating the working of lex and yacc compiler for debugging of programs

Implement the following experiments: 1. Simulate the following CPU scheduling algorithms

a) Round Robin b) SJF c) FCFS d) Priority

2. Simulate Peterson solution for the critical section problem.

3. Simulate Bankers Algorithm for Dead Lock Avoidance & Detection.

4. Simulate MVT and MFT

5. Simulate Paging Technique of memory management.

6. Simulate all page replacement algorithms

a) FIFO b) LRU c) LFU Etc. …

7. Simulate all file allocation strategies

a) Sequential b) Indexed c) Linked

8. Simulate all File Organization Techniques

a) Single level directory b) Two level

9. Design a Lexical Analyzer for a given Language.

10. Implement the Lexical Analyzer Using Lex Tool.

11. Design predictive parser for the given language.

12. Design a LALR bottom up parser using YACC tool.

Page 18: Department of Information Technology COURSE STRUCTURE

B.Tech- 6th

Semester

SYLLABUS

(Applicable for 2012-13 admitted batch)

Course Title: DATAWAREHOUSING AND DATA MINING Course Code: IT3413

L T P C

3 1 0 4

Course Objectives The course content enables students to:

1. Analyze the difference between On Line Transaction Processing and On Line analytical

processing

2. Create Multidimensional schemas suitable for data warehousing

3. Understand various data mining functionalities

4. Understand in detail about data mining algorithms

Course Outcomes At the end of the course students are able to:

1. Design a data mart or data warehouse for any organization

2. Extract knowledge using data mining techniques

3. Adapt to new data mining tools

4. Explore recent trends in data mining such as web mining, multimedia mining

UNIT- I (11+4) Hrs Introduction: Fundamentals of data mining, Data Mining Functionalities, Major issues in Data

Mining

Data Preprocessing: Needs Preprocessing the Data, Data Cleaning, Data Integration and

Transformation, Data Reduction, Data Warehouse and OLAP Technology for Data Mining Data

Warehouse, Multi-dimensional Data Model, Data Warehouse Architecture

UNIT-II (11+3) Hrs Data Mining Primitives, Languages, and System Architectures : Data Mining Primitives, Data

Mining Query Languages, Designing Graphical User Interfaces Based on a Data Mining Query

Language, Architectures of Data Mining Systems.

Concepts Description: Characterization and Comparison: Data Generalization and

Summarization-Based Characterization, Analytical Characterization: Analysis of Attribute Relevance,

Mining Class Comparisons: Discriminating between Different Classes

UNIT- III (11+4) Hrs Mining Association Rules in Large Databases: Association Rule Mining, Mining Single-

Dimensional Boolean Association Rules from Transactional Databases, Mining Multilevel Association

Rules from Transaction Databases.

Classification and Prediction: Issues Regarding Classification and Prediction, Classification by

Decision Tree Induction, Bayesian Classification, Classification by Back propagation, Prediction.

UNIT IV (12+4) Hrs Cluster Analysis Introduction: Types of Data in Cluster Analysis, A Categorization of Major

Clustering Methods, Partitioning Methods, Density-Based Methods, Grid-Based Methods, Model-

Based Clustering Methods, Outlier Analysis.

Mining Complex Types of Data: Multidimensional Analysis and Descriptive Mining of Complex,

Data Objects, Mining Multimedia Databases, Mining Text Databases, Mining the World Wide Web.

Page 19: Department of Information Technology COURSE STRUCTURE

Text Books: 1. Data Mining – Concepts and Techniques - Jiawei Han & Micheline Kamber Harcourt, India.

2. Data Mining Techniques – Arun K Pujari, University Press.

Reference Books: 1. Data Mining Introductory and advanced topics –Margaret H Dunham, Pearson Education

2. Data Warehousing in the Real World – Sam Anahory & Dennis Murray. Pearson Edn

3. Data Warehousing Fundamentals – Paulraj Ponnaiah Wiley Student Edition.

Page 20: Department of Information Technology COURSE STRUCTURE

B.Tech- 6th

Semester

SYLLABUS (Applicable for 2012-13 admitted batch)

Course Title: OBJECT ORIENTED ANALYSIS AND DESIGN Course Code: IT3414

L T P C

3 1 0 4 Course objectives: Students undergoing this course are expected to:

1. Develop the different UML diagrams for a software system based on the given requirements.

2. Apply forward engineering to convert diagram to code and reverse engineering to convert code

to diagram.

3. Analyze & design a s/w system in object oriented approach, using unified modeling language.

4. Select appropriate models for a s/w system depending upon the complexity of the system

Course outcomes: After undergoing the course, students will be able to understand:

1. Understand the use of unified modeling language for object oriented analysis and design

2. Know the syntax of different UML diagrams.

3. Develop different models for a software system.

4. Apply object oriented analysis and design to build a software system

5. Apply forward and reverse engineering for a software system.

UNIT – I (11+3) Hrs Introduction to UML: Importance of modeling, principles of modeling, object oriented modeling,

conceptual model of the UML, Architecture, Software Development Life Cycle.

Basic Structural Modeling: Classes, Relationships, common Mechanisms, and diagrams.

Advanced Structural Modeling: Advanced classes, advanced relationships, Interfaces, Types and

Roles, Packages.

UNIT – II (12+4) Hrs

Class & Object Diagrams: Terms, concepts, modeling techniques for Class & Object Diagrams.

Basic Behavioral Modeling-I: Interactions, Interaction diagrams.

UNIT-III (11+4) Hrs Basic Behavioral Modeling-II: Use cases, Use case Diagrams, Activity Diagrams.

Advanced Behavioral Modeling: Events and signals, state machines, processes and Threads, time

and space, state chart diagrams.

UNIT-IV (11+4) Hrs

Architectural Modeling: Component, Deployment, Component diagrams and Deployment diagrams.

Case Study: The Unified Library application.

Text Books: 1. Grady Booch, James Rumbaugh, IvarJacobson : The Unified Modeling Language User Guide,

Pearson Education.

2. Hans-Erik Eriksson, Magnus Penker, Brian Lyons, David Fado: UML 2 Toolkit, WILEY-

Dreamtech India Pvt. Ltd.

Reference Books:

1. Meilir Page-Jones: Fundamentals of Object Oriented Design in UML, Pearson Education.

2. Atul Kahate: Object Oriented Analysis & Design, The McGraw-Hill Companies.

3. Gandharba Swain: Object Oriented Analysis & Design Through Unified Modeling Language,

Lakshmi Publications Pvt. Ltd , New Delhi.

Page 21: Department of Information Technology COURSE STRUCTURE

B.Tech- 6th

Semester

SYLLABUS (Applicable for 2012-13 admitted batch)

Course Title: WEB TECHNOLOGIES Course Code: IT3415

L T P C

3 1 0 4

Course Objectives: The course content enables students to:

1. understand best technologies for solving web client/server problems

2. analyze and design real time web applications

3. use Java script for dynamic effects and to validate form input entry

4. Analyze to Use appropriate client-side or Server-side applications

Course Outcomes: At the end of the course students are able to:

1. Choose, understand, and analyze any suitable real time web application.

2. Integrate java and server side scripting languages to develop web applications.

3. To develop and deploy real time web applications in web servers and in the cloud.

4. Extend this knowledge to .Net platforms.

UNIT – I (13+4) Hrs HTML Common tags- List, Tables, images, forms, Frames, Links and Navigation, Image Maps

CSS: Introduction, CSS Properties, Controlling Fonts, Text Formatting, Pseudo classes, Selectors,

CSS for Links, Lists, Tables.

Java Script: Learning Java script: Variables, operators, Functions, Control structures, Events,

Objects, Validations.

UNIT – II (10+3) Hrs PHP Programming: Introducing PHP: Creating PHP script, Running PHP script.

Working with Variables and constants: Using variables, Using constants, Data types, Operators.

Controlling program flow: Conditional statements, Control statements, Arrays, functions.Working

With forms.

UNIT-III (12+4) Hrs AJAX: Introduction, AJAX with XML

Servlets: introduction to servlets, Life cycle of servlets, JSDK, The servlet API, the javax.servlet

package, Reading servlet parameters and initialization parameters, The javax.servlet HTTP package,

Handling Http request and responses, Using cookie, session tracking,

Introduction to JSP: The problem with servlet, the anatomy of JSP page, JSP processing, JSP

application design with MVC, Tomcat server and testing tomcat, Generic dynamic content, using

scripting elements implicit JSP objects,

UNIT-IV (10+4) Hrs

JSP application development: Conditional processing display values using an expression to set an

attribute, Declaring variables and methods, sharing data between JSP pages, Requests and users

passing control and data between pages, Sharing sessions and application data, memory usage

considerations

Page 22: Department of Information Technology COURSE STRUCTURE

JDBC connectivity in JSP: Data base programming using JDBC, Studying javax.sql.* package,

Accessing a database from a JSP page, Application specific database actions, Deploying JAVA beans

in JSP page.

Text Books :

1. Web Technolgies, Uttam Roy, OXFORD University press

2. Web programming with HTML, XHTML and CSS, 2e, Jon Duckett, Wiley India

Reference Books: 1. Web programming Bai, Michael Ekedahl, CENAGE Learning , India edition.

2. An Introduction to Web Design + Programming, Paul S.Wang, India Edition

Page 23: Department of Information Technology COURSE STRUCTURE

B.Tech- 6th

Semester

SYLLABUS (Applicable for 2012-13 admitted batch)

Course Title: DIGITAL SIGNAL PROCESSING Course Code: ECE 3419

L T P C

3 1 0 4

Course objectives :

The course content enables students to :

1. Enhance the analytical ability of the students in facing the challenges posed by growing trends

in communication, control and signal processing areas.

2. develop ability among students for problem formulation, system design and solving skills

3. demonstrate basic knowledge of Digital Signal Processing by understanding various

transformations

4. Understand Various Discrete-time signals and class of Linear shift-invariant systems will be

studied using the convolution sum, and the frequency domain, using transformations.

5. Design system with digital network composed of adders, delay elements, and coefficient

multipliers.

Course Outcomes

At the end of the course students are able to

1. Analyse the system in Time and Frequency domain through its respective tools.

2. Demonstrate knowledge of complex number, Fourier series and ability to design electrical

and electronics systems, analyse and interpret data.

3. Design the digital filter circuits for generating desired signal wave shapes (nonsinusoidal) for

different applications like computers, control systems and counting and timing systems.

4. Design the digital computer or digital hardware for quantizing amplitudes of signals.

5. Design the various processing circuits that are necessary in the hardware or interfacing blocks

in systems used in radars, satellite etc

UNIT-I

Introduction to Discrete –Time signals and systems (15 hours) Classification of Discrete time signals & sequences, linear Time Invariant (LTI) systems, (BIBO)

stability, and causality.Linear convolution in time domain and graphical approach.

Concept of Z-transforms, Region of Convergence, properties, Inverse Z transform, Realization of

Digital filter structures: Direct form-I, Direct form-II, Transposed form, cascaded form, Parallel form.

UNIT-II

Discrete –Time signals in Transform domain (15 hours) Discrete Fourier Series(DFS), Discrete Time Fourier transforms(DTFT), Discrete Fourier

transform(DFT), Properties of DFT , linear convolution using DFT, Circular convolution, Fast

Fourier transforms (FFT) - Radix-2 decimation in time and decimation in frequency FFT Algorithms,

Inverse FFT.

Page 24: Department of Information Technology COURSE STRUCTURE

UNIT-III

IIR Digital Filters: (15 hours) Analog filter approximations – Butter worth and Chebyshev , Impulse Invariant transformation ,

Bilinear transformation, Design of IIR Digital filters from analog filters.

UNIT-IV

FIR Digital Filters & Multi rate Signal Processing (17 hours) FIR Digital Filters :Characteristics of FIR Digital Filters, frequency response, Design of FIR Digital

Filters using Window Techniques, Comparison of IIR & FIR filters.

Multi rate Processing: Decimation, interpolation, sampling rate conversion, Implementation of

sampling rate conversion.

TEXT BOOKS: 1. Digital Signal Processing by SanjitK.Mitra 2

ndEdition , TATA McGraw Hill

2. Digital Signal Processing, Principles, Algorithms, and Applications: John G. Proakis, Dimitris

G. Manolakis,Pearson Education / PHI, 2007.

Reference Books: 1.Digital Signal Processing – Alan V. Oppenheim, Ronald W. Schafer, PHI Ed., 2006

2. Digital Signal Processing: Andreas Antoniou, TATA McGraw Hill , 2006

3. Digital Signal Processing: MH Hayes, Schaum’s Outlines, TATA Mc-Graw Hill, 2007.

Page 25: Department of Information Technology COURSE STRUCTURE

B.Tech- 6th

Semester

SYLLABUS (Applicable for 2012-13 admitted batch)

Course Title: DISTRIBUTED DATABASES Course Code: IT3416

L T P C

3 1 0 4

Course Objectives:

This course is intended to 1. Inculcate knowledge on Centralized and Distributed Databases.

2. Understand Transparency and Fragmentation in Distributed Databases

3. Apply transaction management, concurrency control, and reliability in Distributed Databases.

4. Analyze the features of Object Oriented databases and Create awareness on the major technical

challenges in distributed systems design and implementation.

Course Outcomes:

At the end of the course the student will be able to:

1. Decompose global relations into fragments.

2. Apply DDBMS in Data Warehousing, web-based databases and pull/push based technologies.

3. Analyze the principles applied in contemporary distributed database systems.

4. Evaluation of CORBA architecture for interoperable databases.

UNIT – I (12+4) Hrs Features of Distributed versus Centralized Databases, Levels of Distribution Transparency, Reference

Architecture, Data Fragmentation, Integrity Constraints.Functions & Components of Distributed

DBMSs, Translation of Global Queries to Fragment Queries.

UNIT – II (10+4) Hrs Optimization of Access Strategies, A Framework for Query Optimization, Join Queries, General

Queries. The Management of Distributed Transactions, A Framework for Transaction Management,

Supporting Atomicity of Distributed Transactions, Concurrency Control for Distributed Transactions.

UNIT-III (11+4) Hrs Concurrency Control, Foundation of Distributed Concurrency Control, Distributed Deadlocks,

Timestamps, Optimistic Methods. Reliability, Non blocking Commitment Protocols, Determining a

Consistent View of the Network, Detection and Resolution of Inconsistency, Checkpoints and Cold

Restart.

UNIT-IV (12+3) Hrs Architectural Issues, Object Management, Distributed Object Storage, Object Query Processing,

Database Interoperability, Database Integration, Query Processing, Transaction Management, Object

Orientation and Interoperability.

Text Books: 1. Distributed Database Principles & Systems, Stefano Ceri, Giuseppe Pelagatti McGraw-Hill

2. Principles of Distributed Database Systems, M.TamerOzsu, Patrick Valduriez

Reference Books:

1. Distributed Database Systems, Chhanda Ray, Pearson Education

2. Distributed Database Systems, D. David Arthur Bell, Jane B. Grimson, Addison-Wesley

Page 26: Department of Information Technology COURSE STRUCTURE

B.Tech- 6th

Semester

SYLLABUS

(Applicable for 2012-13 admitted batch)

Course Title: SYSTEM SIMULATION & MODELING Course Code: IT3417

L T P C

3 1 0 4

Course Objectives: The course content enables students to:

1. Understand the benefits of modeling and simulation in support to the Systems Engineering

function.

2. Applying addressing distribution and interoperability aspects to improve collaboration

Between involved teams and communities

3. Analyzing addressing distribution and interoperability aspects to improve collaboration

Between involved teams and communities.

4. Creating modeling systems independent of the tools.

Course Outcomes: At the end of the course students are able to:

1. Understand basic concepts in modeling and simulation.

2. Analyze output data produced by a model and test validity of the model

3. Evaluate random number variates and apply them to develop simulation models

4. Create various simulation models and give practical examples for each category

UNIT – I (12+4) hrs System Models:The concepts of a System, System Environment, Stochastic Activities, Continuous

and Discrete Systems, System Modeling, Types of models.

System Studies: Subsystem, A Corporate Model, Environment segment, Production Segment,

Management Segment, full Corporate Model, Types of System study, System Analysis, System

Design, System Postulation.

UNIT – II (12+4) hrs System Simulation:The technique of simulation, the Monte-Carlo Method, Comparison of Simulation

and Analytical Methods, Experimental Nature of Simulation, Types of System Simulation, Numerical

Computation Technique for Continuous & Discrete Models, Distributed Lag Models, Cobweb Models.

Continuous System Simulation: Continuous System Models, Differential Equations, Analog

Computers & Methods, Hybrid Computers. CSSLs, CSMP-III, Feedback Systems, Simulation of an

Autopilot.

UNIT-III (10+4) hrs System Dynamics:Exponential Growth &Decay Models, Modified Exponential Growth Models,

Logistic Curves, Generalization of Growth Models, System Dynamics Diagrams, Simple System

Dynamics Diagrams, Multi–Segment Models, Representation of Time Delays.

Probability Concepts in Simulation:Stochastic Variables, Discrete &ContinuousProbability

Functions, Measures of Probability Functions, Numerical Evaluation of Continuous Probability

Functions, Continuous Uniformly Distributed Random Numbers, A Uniform Random Number,

Generating Discrete Distributions, Non-Uniform Continuously Distributed Random Numbers, The

Rejection Method.

Page 27: Department of Information Technology COURSE STRUCTURE

UNIT-IV (11+3) hrs Arrival Patterns and Service Times:Congestion In Systems, Arrival Patterns, Poisson Arrival

Patterns, The Exponential Distribution, The ErlangDistribution, Service Times, Normal Distributions,

Queuing Disciplines, Measures Of Queues,The Single Server Queuing System, Queuing System with

Two Servers in Series and with Two Parallel Servers.

Discrete System Simulation:Discrete Events, Representation of Time, Generation of Arrival Patterns,

Simulation of a Telephone System, Delayed Calls, Simulation Programming Tasks, Measuring

Utilization And Occupancy.

Text Books: 1. Geoffrey Gordon, “System Simulation”, Second Edition, Pearson Education, 2007

Reference Books: 1. Sheldon M. Ross, “Simulation”, Academic Press(an imprint of Elsevier), Fourth Edition, 2006.

2. Jerry Banks, John S. Carson II, Barry L. Nelson, David M. Nicol, “Discrete Event System

Simulation”, 5th Edition, 2010, Pearson education Inc., New Delhi.

Page 28: Department of Information Technology COURSE STRUCTURE

B.Tech- 6th

Semester

SYLLABUS

(Applicable for 2012-13 admitted batch)

Course Title: CLOUD COMPUTING Course Code: IT3418

L T P C

3 1 0 4

Course Objectives 1. Design an API and a distributed platform that are hardware, vendor agnostic, a unified resource

representation.

2. Implement an agent system for negotiation of Cloud services.

3. Adapt tests and benchmarks for Cloud services and applications.

4. Evaluate features Private-Cloud and Design innovative cloud infrastructure.

Course Outcomes 1. Articulate the main concepts, key technologies, strengths, and limitations of cloud computing

and the possible applications for state-of-the-art cloud computing.

2. Identify the architecture and infrastructure of cloud computing, including SaaS, PaaS, IaaS,

public cloud, private cloud, hybrid cloud, etc.

3. Identify problems, and explain, analyze, and evaluate various cloud computing solutions.

4. Attempt to generate new ideas, innovations in cloud computing and Collaboratively research

and write a research paper, and present the research online.

UNIT I: (13+3) Hrs Understanding Cloud Computing: Cloud computing: Introduction, Cloud application architectures,

Value of cloud computing, Cloud Infrastructure models, Cloud Services, History of Cloud Computing,

Advantages of Cloud Computing, Disadvantages of Cloud Computing, Companies in the Cloud

Today, Amazon Web Services, Google services, IBM Cloud, Windows Azure

Before the move into the cloud: Know Your Software Licenses, The Shift to a Cloud Cost Model,

Service Levels for Cloud Applications

Ready for the cloud: Web Application Design, Machine Image Design, Privacy Design, Design,

Database Management

UNIT-II: (10+5) Hrs Virtual Machines and Virtualization of Clusters and Data Centers: Implementation Levels of

Virtualization, Virtualization Structures/Tools and Mechanisms, Virtualization of CPU, Memory, and

I/O Devices, Virtual Clusters and Resource Management, Virtualization for Data-Center Automation

Case Studies: Cloud centers in detail, Comparing approaches, Xen, Eucalyptus, CloudStack,

OpenStack

UNIT III: (10+3) Hrs Scaling a Cloud Infrastructure: Capacity Planning, Cloud Scale.

Cloud Security: Data Security, Network Security, Host Security, Compromise Response

Disaster Recovery: Disaster Recovery Planning, Disasters in cloud, Cloud Disaster Management

Page 29: Department of Information Technology COURSE STRUCTURE

UNIT IV: (12+4) Hrs Cloud Computing Software Security Fundamentals -Cloud information Security Objectives, Cloud

Security Services, Relevant Cloud Security Design Principles, Secure Cloud Software Requirements,

Approaches to Cloud Software Requirements Engineering, Cloud Security Policy Implementation

Cloud Computing Risk Issues: The CIA Triad, Privacy and Compliance Risks, Threats to

Infrastructure Data and Access Control, Cloud Access Control Issues, Cloud Service Provider Risks

TEXT BOOKS:

1. Cloud Application Architectures, George Reese, O’Reilly (Units I,II, III)

2. Cloud Security, Ronald L. Krutz and Russell Dean Vines, Wiley Publishing (Unit IV)

REFERENCE BOOKS: 1. Distributed & Cloud Computing From Parallel Processing to the Internet of Things, Kai Hwang.

Geoffrey C. Fox, Jack J.Dongarra, Morgan Kauffman Publishers

2. Michael Miller, Cloud Computing: Web-Based Applications That Change the Way You Work and

Collaborate Online, Que Publishing

3. Cloud Computing and SOA Convergence in Your Enterprise: A Step-by-Step Guide David S.

Linthicum Addison-Wesley Professional.

Page 30: Department of Information Technology COURSE STRUCTURE

B.Tech- 6th

Semester

SYLLABUS

(Applicable for 2012-13 admitted batch)

Course Title: SOFT COMPUTING Course Code: CSE3416

L T P C

3 1 0 4

Course Outcomes At the end of the course, the students are able to:

1. Identify and describe soft computing techniques and their roles in building intelligent

machines.

2. Recognize the feasibility of applying a soft computing methodology for a particular problem

3. Apply fuzzy logic and reasoning to handle uncertainty and solve engineering problems

4. Apply genetic algorithms to combinatorial optimization problems.

5. Apply neural networks to pattern classification and regression problems.

6. Effectively use existing software tools to solve real problems using a soft computing approach.

UNIT I: (10+3) Hrs

Basic elements of soft Computing – Introduction to soft computing, Fuzzy logic, Neural Networks

and Evolutionary Computing, Evolution of soft computing from computational AI to computing

intelligence, Machine learning basics.

UNIT II: (12+3) Hrs Supervised learning: Artificial Neural Networks- Introduction, Basic models of ANN, important

terminologies, Basic Learning Laws, Supervised Learning Networks, Perceptron Networks, Back

propagation Network. Radial basis function network and Hopfield Networks, Learning Vector

Quantization.

UNIT III:

(14+5) Hrs Unsupervised Learning Network- Introduction, Fixed Weight Competitive Nets, Maxnet, Hamming

Network, Kohonen Self-Organizing Feature Maps, Learning Vector Quantization, Counter

Propagation Networks, Adaptive Resonance Theory Networks.

UNIT IV: (9+4) Hrs

Introduction to Classical Sets and Fuzzy Sets- Crisp Sets and Fuzzy Sets- operations.Classical

Relations and Fuzzy Relations- Cardinality, Properties and composition.equivalence relations.

TEXT BOOKS :

1. Principles of Soft Computing- S N Sivanandam, S N Deepa, Wiley India, 2011

2. V. Kecman, “Learning and Soft computing”, Pearson Education, India

REFERENCES 1. George J. Klir and Bo Yuan, "Fuzzy sets and Fuzzy Logic", Prentice Hall, USA 1995.

2. N. J. Nelsson, "Artificial Intelligence - A New Synthesis", Harcourt Asia Ltd.1998.

3. D.E. Goldberg, "Genetic Algorithms: Search, Optimization and Machine Learning", Addison

Wesley, N.Y, 1989.

4. S. Haykins,“Neural networks: a comprehensive foundation”. Pearson Education, India.

Page 31: Department of Information Technology COURSE STRUCTURE

B.Tech- 6th

Semester

SYLLABUS (Applicable for 2012-13 admitted batch)

Course Title: OBJECT ORIENTED ANALYSIS AND DESIGN LAB Course Code: IT3219

L T P C

0 0 3 2

Course Objectives: This lab course is intended to:

1. Know the practical issues of the different Object oriented analysis and design concepts.

2. Inculcate the art of object oriented software analysis design.

3. Apply forward and reverse engineering of a software system.

4. Carry out the analysis and design of a system in an object oriented way.

Course outcomes: After undergoing the course students are able to:

1. Know the syntax of different UML diagrams.

2. Create different UML diagrams for a software system

3. Identify appropriate models to represent a software system.

4. Analyze and design a software system in an object oriented style using tools like Rational

Rose.

List of Experiments 1. The student should take up the case study of Unified Library application which is mentioned in the

theory, and Model it in different views i.e. Use case view, logical view, component view, Deployment

view, Database design, forward and Reverse Engineering, and Generation of documentation of the

project.

2. Student has to take up another case study of his/her own interest and do the same whatever

mentioned in first problem. Some of the ideas regarding case studies are given in reference books

which were mentioned in theory syllabus can be referred for some idea.

Reference Books: 1. Meilir Page-Jones: Fundamentals of Object Oriented Design in UML, Pearson Education.

2. Pascal Roques: Modeling Software Systems Using UML2, WILEY-Dreamtech India Pvt. Ltd.

3. AtulKahate: Object Oriented Analysis & Design, The McGraw-Hill Companies.

4. Mark Priestley: Practical Object-Oriented Design with UML,TATAMcGrawHill

5. Gandharba Swain: Object Oriented Analysis & Design Through Unified Modeling Language,

Lakshmi Publications Pvt.Ltd , New Delhi.

Page 32: Department of Information Technology COURSE STRUCTURE

B.Tech- 6th

Semester

SYLLABUS (Applicable for 2012-13 admitted batch)

Course Title: WEB TECHNOLOGIES LAB Course Code: IT3220

L T P C

0 0 3 2

Course Objectives: This course is designed to enable the students to:

1. Understand the web technologies to create adaptive web pages for web application.

2. use CSS to implement a variety of presentation effects to the web application

3. know the concept and implementation of cookies as well as related privacy concerns

4. Develop a sophisticated web application that employs the MVC architecture.

Course Outcomes: At the end of this course the student can answer how to:

1. Integrate frontend and backend web technologies in distributed systems.

2. Facilitate interface between frontend and backend of a web application. 3. Debug, test and deploy web applications in different web servers.

4. Migrate the web applications to the other platforms like .Net

Experiment1: Design the following static web pages required for a Training and placement cell web

site.

1) Home Page 2) Login Page 3) Registration page

2)

Experiment2: 4) Company Details Page 5) Alumni Details Page 6) Placement Staff Details Page

Experimen3: 7) Student personal Info Page 8) Student Academic Info page 9) Semester Wise

Percentage & their Aggregate page

Experiment4: Validate login page and registration page using regular expressions.

Experiment5: Apply different font styles, font families, font colors and other formatting styles to the

above static web pages.

Experiment6: Install wamp server and tomcat server, access above developed static web pages using

these servers.

Experiment7: Write a servlet/PHP to connect to the database, Insert the details of the users who

register with the web site, whenever a new user clicks the submit button in the registration.

Experiment8: Write a JSP/PHP to connect to the database, Insert the details of the student academic

information with student academic info page.

Page 33: Department of Information Technology COURSE STRUCTURE

Experiment9: User Authentication:

Assume four users user1user2, user3 and user4 having the passwords pwd1, pwd2, pwd3 and pwd4

respectively. Write a servlet for doing the following.

1. Create a Cookie and add these four user id’s and passwords to this Cookie.

2. Read the user id and passwords entered in the Login form (week1) and authenticate with the values

(user id and passwords) available in the cookies.

If he is a valid user (i.e., user-name and password match) you should welcome him by name (user-

name) else you should display “You are not an authenticated user “.

Use init-parameters to do this. Store the user-names and passwords in the webinf.xml and access

them in the servlet by using the getInitParameters() method.

Experiment10: Write a JSP which does the following job:

Authenticate the user when he submits the login form using the user name and password from

the database.

Experiment11: write a JSP to insert the student’s semester wise percentages and calculate aggregate

and insert into database.

Experiment12: write a JSP to search the students according to their aggregate and produce sorted list

or according to their Enroll number.