B. Tech. CSE PDF

GYAN VIHAR SCHOOL OF ENGINEERING AND TECHNOLOGY
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Teaching and Examination Scheme for B.Tech (CSE) program
Edition 2012
Year: II
S.
No.
Course Code
1
2
3
4
5
MA 203
CP 201
EC 215
CP 203
CP 205
CP 210
CP 212
6
EC 213
HS 201
EC 217
7
8
9
10
EC 259
EC 253
CP 251
CP 253
11
DE 201
Semester: III
Course Name
A. Theory
Advance Mathematics
Data Structure & Algorithms
Switching Theory & Logic Design
Principles of Programming Language
Departmental Elective
Internet Programming
Management Information System
PATTERN RECOGNITION &
LEARNING
Open Electives
Medical Electronics
Communication Skill
Electronic Devices & Circuits
B. Practicals / Sessionals
Digital Electronics Lab
Electronic Devices & Circuits Lab
Data Structure & Algorithms Lab
Internet Programming Lab
C. Discipline and Extra Curricular
Activities
Discipline and Extra Curricular Activities
III
Total
Total Teaching Load
Credits
Contact Hrs/Wk.
L
T/S
P
Course Code
1
2
3
4
5
CP 202
MA 204
EC 222
CP 206
CP 208
CP 217
6
EC 216
EC 218
HS 202
7
8
9
10
EC 355
CP 254
CP 256
CP 258
11
DE 202
Weightage (in%)
CE
ESE
4
4
3
3
3
3
3
3
3
3
1
1
1
-
3
3
3
3
3
30
30
30
30
30
70
70
70
70
70
30
70
1
1
2
1
2
2
2+2
2+2
3
3
3
3
60
60
60
60
40
40
40
40
2
27
100
18
33
12
Year: II
S.
No.
Exam
Hrs.
Semester: IV
Course Name
A. Theory
Software Engineering
Statistical Probability & Theory
Microprocessor & Interface
JAVA
Open Source Technology
E-Commerce
Open Electives
Telecom Engg. Fundamentals
Solar power Computers
Cognitive Skill
Microprocessor Lab
JAVA Lab
UNIX Lab
Software Engineering Lab
Activities
IV
Total
Total Teaching Load
Credits
Contact Hrs/Wk.
L
T/S
P
Exam
Hrs.
Weightage (in%)
CE
ESE
3
4
4
3
3
3
3
3
3
3
1
1
-
3
3
3
3
3
30
30
30
30
30
70
70
70
70
70
30
70
1
2
1
1
2+2
2+2
2
2
3
3
3
3
60
60
60
60
40
40
40
40
2
27
100
18
30
10

Teaching and Examination Scheme for B. Tech (CSE) program
Edition 2012
Year: III
Semester: V
S.
No.
Course Code
1
2
3
4
5
CP 301
CP 303
CP 305
CP 307
CP 309
CP 311
6
EC 312
HS 301
7
8
9
10
CP 351
CP 355
CP 353
PE 301
11
DE 301
Course Name
A. Theory
Database Management System
Discrete mathematical Structure
Web Technology
Computer Graphics
Logical & Functional Programming
Advance Data Structure
Open Elective
Introduction to wireless Network
Verbal and non-Verbal Reasoning
Computer Graphics lab
Web Programming Lab
Data Base Management System Lab
Minor Project
Activities
V
Total
Total Teaching Load
Credits
Contact Hrs/Wk.
L
T/S
P
Exam
Hrs.
Weightage (in%)
CE
ESE
4
3
4
3
3
3
3
3
3
3
1
1
-
3
3
3
3
3
30
30
30
30
30
70
70
70
70
70
30
70
1
1
1
1
2
2+2
2+2
2
3
3
3
3
60
60
60
60
40
40
40
40
2
28
100
21
31
Year: III
08
Semester: VI
S.
No.
Course Code
1
2
3
4
5
6
CP 302
CP 304
CP 306
CP 308
CP 310
CP 312
CP 314
CP 316
BM302
BM 203
HS 302
7
8
9
10
CP 352
CP 354
CP 356
PE 302
11
DE 302
Course Name
A. Theory
Computer Architecture
Theory of Computation
Computer Networks
Design Analysis & Algorithm
System soft ware Engineering
Departmental Elective IV
Data Mining & dataq warehusing
Simulation Modeling
Bio Informatics
Open Electives
Entrepreneurship & small scale Business
management
Human Resource Management
Technical Writing
Computer Architecture lab
COMPUTER NETWORK Lab
System software Lab
Major Project (Stage -I )
Activities
VI
Total
Total Teaching Load
Credits
Contact Hrs/Wk.
L
T/S
P
Exam
Hrs.
Weightage (in%)
CE
ESE
3
4
4
4
3
3
3
3
3
3
3
3
1
1
1
-
3
3
3
3
3
3
30
30
30
30
30
30
70
70
70
70
70
70
30
70
1
1
1
1
2+2
2
2+2
2
3
3
3
3
60
60
60
60
40
40
40
40
2
28
100
21
31
08

Teaching and Examination Scheme for B. Tech (CSE) Program
Edition 2012
Year: IV
S.
No.
Course
Code
1
2
3
4
5
CP 405
CP 407
CP 409
CP 403
CP 411
CP 415
EC 419
HS 401
BM 504
EC 417
7
8
9
10
CP 451
CP 453
PE 401
PT 401
11
DE 401
S.
No.
1
2
3
4
Year: IV
Course Code
CP 402
CP 404
CP 406
CP 408
CP 410
CP 414
5
CP 420
EC 418
6
7
8
9
10
CP 452
EC 458
CP 454
CP 456
SM 402
11
DE 402
Semester: VII
Course Name
A. Theory
Operating Systems
Artificial Intelligence
Real Time Systems
Aysnchronous Transfer Mode Networks
Departmental ElectiveV
Multimedia Systems
Neural Network
Open Electives
Signal & System
Technical aptitude
Operation and Production Management
Logic Synthesis
.NET Lab
X-Windows Lab
Major Project (Stage -II )
PracticalTraining Seminar
Activities
VII
Total
Total Teaching Load
Course Name
A. Theory
Network Securtiy System
Advance Computer Architectures
Compiler Construction
Departmental ElectiveVI
Distributed Systems
Fault Tolerant System
Embedded Systems
Open Electives
Parallel Computing
CAD for VLSI DESIGN
Compiler Lab
VLSI Design Lab
Advance Computer Architecture Lab
NETWORK SYSTEM SECURITY LAB
B. Tech. Seminar
Activities
VIII
Total
Total Teaching Load
Credits
Contact Hrs/Wk.
L
T/S
P
Exam
Hrs.
Weightage (in%)
CE
ESE
3
4
4
3
3
3
3
3
3
3
1
1
-
3
3
3
3
3
30
30
30
30
30
70
70
70
70
70
30
70
1
2
1
2
2
2+2
2+2
2
3
3
3
3
60
60
60
60
40
40
40
40
2
27
Credits
100
18
33
10
Contact Hrs/Wk.
L
T/S
P
Semester: VIII
Exam
Hrs.
Weightage (in%)
CE
ESE
4
3
4
3
3
3
3
3
1
1
1
-
3
3
3
3
30
30
30
30
70
70
70
70
30
70
2
1
1
1
1
2+2
2
2+2
2
2
3
3
3
3
3
60
60
60
60
60
40
40
40
40
40
2
25
100
15
29
12

List of courses offered
S.
No.
Course Code
Course Name
Credits
Contact Hrs/Wk.
Exam
Hrs.
Weightage (in%)
T/S
CE
ESE
1
2
CP 201
CP 202
Data Structure & Algorithms

Software Engineering
4
3
3
3
1
-
3
3
30
30
70
70
3
4
CP 203
CP 205
Principles of Programming Language

Internet Programming
30
70
5
6
CP 206
CP 208
JAVA
Open Source Technology
30
70
7
8
CP 210
CP 212
Management Information System

PATTERN RECOGNITION & LEARNING
CP 217
E-Commerce
10
11
CP 251
CP 253
Data Structure & Algorithms Lab

Internet Programming Lab
2
1
2+2
2+2
3
3
60
60
40
40
12
13
CP 254
CP 256
JAVA Lab
UNIX Lab
2
1
2+2
2
3
3
60
60
40
40
14
CP 258
Software Engineering Lab
60
40
15
16
CP 301
CP 302
Database Management System

Computer Architecture
4
3
3
3
1
-
3
3
30
30
70
70
17
CP 303
Discrete mathematical Structure
30
70
18
19
CP 304
CP 305
Theory of Computation
Web Technology
4
4
3
3
1
1
3
3
30
30
70
70
20
CP 306
Computer Networks
30
70
21
CP 307
Computer Graphics
30
70
22
CP 308
Design Analysis & Algorithm
30
70
23
CP 309
Logical & Functional Programming
24
CP 310
System soft ware Engineering
30
70
25
CP 311
Advance Data Structure
26
CP 312
Data Mining & dataq warehusing
27
28
CP 314
CP 316
Simulation Modeling
Bio Informatics
29
CP 351
Computer Graphics lab
60
40
30
31
CP 352
CP 353
Computer Architecture lab

Data Base Management System Lab
1
1
2+2
2+2
3
3
60
60
40
40
32
CP 354
COMPUTER NETWORK Lab
60
40
33
CP 355
Web Programming Lab
2+2
60
40
34
CP 356
System software Lab
2+2
60
40
35
CP 402
Network Securtiy System
30
70
36
CP 403
Aysnchronous Transfer Mode Networks
30
70
37
CP 404
Advance Computer Architectures
30
70
38
CP 405
Operating Systems
30
70
39
CP 406
Compiler Construction
30
70
40
CP 407
Artificial Intelligence
30
70
41
CP 408
Distributed Systems
42
CP 409
Real Time Systems
30
70
43
CP 410
Fault Tolerant System
44
CP 411
Multimedia Systems
45
CP 414
Embedded Systems
46
47
CP 415
CP 420
Neural Network
Parallel Computing
48
CP 451
.NET Lab
60
40
49
CP 452
Compiler Lab
2+2
60
40
50
CP 453
X-Windows Lab
2+2
60
40
51
CP 454
Advance Computer Architecture Lab
2+2
60
40
52
CP 456
NETWORK SYSTEM SECURITY LAB
60
40
53
EC 213
Medical Electronics
54
EC 215
Switching Theory & Logic Design
30
70
55
EC 216
Telecom Engg. Fundamentals
56
EC 217
Electronic Devices & Circuits
57
EC 218
Solar power Computers
58
EC 222
Microprocessor & Interface
30
70
59
EC 253
Electronic Devices & Circuits Lab
60
40
60
EC 259
Digital Electronics Lab
60
40
61
EC 312
Introduction to wireless Network
62
EC 355
Microprocessor Lab
2+2
60
40
63
EC 417
Logic Synthesis
64
EC 418
CAD for VLSI DESIGN
65
EC 419
Signal & System
66
EC 458
VLSI Design Lab
60
40
67
BM 203
68
BM 302
69
BM 504
Entrepreneurship & small scale Business

management
70
MA 203
Advance Mathematics
30
70
71
MA 204
Statistical Probability & Theory
30
70
72
HS 201
Communication Skill
73
HS 202
Cognitive Skill
74
HS 301
Verbal and non-Verbal Reasoning
75
HS 302
Technical Writing
76
HS 401
Technical aptitude
77
PE 301
Minor Project
60
40
78
PE 302
Major Project (Stage -I )
60
40
79
PE 401
Major Project (Stage -II )
2+2
60
40
80
PT 401
PracticalTraining Seminar
60
40
81
SM 402
B. Tech. Seminar
60
40
82
DE 201
Discipline and Extra Curricular Activities III
100
83
DE 202
Discipline and Extra Curricular Activities IV
100
84
DE 301
Discipline and Extra Curricular Activities V
100
85
DE 302
Discipline and Extra Curricular Activities VI
100
86
DE 401
Discipline and Extra Curricular Activities VII
100
87
DE 402
Discipline and Extra Curricular Activities VIII
100
CP 201 : DATA STRUCTURES AND ALGORITHMS

Unit
Contents of the Course
I
II
III
IV
V
C(L,T,P) = 4 (3,1,0)
Hours
Data Structure: Definition, Implementation, Operation, Application, Algorithm writing and convention. Analysis of algorithm,
Complexity Measures and Notations. Arrays: Representation of arrays (multidimensional), Address calculation using column and
row major ordering. Linked Lists : Implementation, Doubly linked list, Circular linked list, unrolled linked list, skip-lists, Splices,
Sentinel nodes, Application (Sparse Matrix, Associative Array, Functional Programming)
Stacks : Definition, Implementation, Application (Tower of Hanoi, Function Call and return, Parentheses Matching,
Back-tracking, Expression Evaluation) Queues : Definition, deque, enque, priority queue, bounded queue,
Implementation, Application
Tree: Definition of elements, Binary trees: Types (Full, Complete, Almost complete), Binary Search Tree, Traversal
(Pre, In, Post & Level order) Pruning, Grafting. Application: Arithmetic Expressions Evaluation Variations: Indexed
Binary Tree Threaded Binary Tree, AVL tree, Multi-way trees, B tree, B+ tree, Forest, Trie and Dictionary
Graphs: Elementary definition, Representation (Adjacency Matrix, Adjacency Lists) Traversal (BFS,
DFS)Application: Spanning Tree (Prim and Kruskal Algorithm) Dijkstra's algorithm, shortest path algorithms.
Sorting: Bubble, Selection, Insertion, Quick, Radix Merge, Bucket, Heap, Searching: Hashing, Symbol Table, Binary
Search, Simple String Searching
Total
7
6
6
34
Reference Books:
1.
Aho A.V., J.E.Hopcroft. J.D.Ulman: Data Structures and Algorithms, Addison Wesley.
2.
Brastrad: Algorithms, PHI.
3.
Horowitz and Sawhni: Algorithms Design and Analysis, CS Press.
4.
Kruse R.L.: Data structure and Program Design.PHI.
5.
Tanenbaum : Data structures in C,PHI
6.
Trembley & Sorenson :An Introduction to Data Structures, Mc-Graw Hill International
CP 202
Unit
I
II
III
IV
V
SOFTWARE ENGINEERING
C(L,T,P) = 3 (3,0,0)
System Analysis: Characteristics, Problems in system Development System Level project Planning, System
evelopment Life cycle (SDLC), Computer system engineering system analysis, modeling the architecture, system
specification.
Software Project Management: Objectives, Resources and their estimation, LOC and FP estimation, effort estimation
COCOMO estimation model, risk analysis Software project scheduling. Software Development : Life Cycle
(SWDLC), SWDLC models software engineering approaches
Requirement Analysis: Requirement analysis tasks, Analysis principles. Software prototyping and specification data
dictionary Finite state machine (FSM) models. Structured Analysis: Data and control flow diagrams, control and
process specification behavioral modeling, extension for data intensive applications
Software Design: Design fundamentals, Effective modular design Data architectural and procedural design, design
documentation
Object Oriented Analysis: Object oriented Analysis Modeling, Data modeling. Object Oriented Design: OOD
concepts and methods class and object definitions, refining operations. Class and object relationships, object
modularization. Introduction to Unified Modeling Language
Total
Hours
7
6
7
8
35
Reference Books:
1.
Pressman; Software Engineering-A practitioner's Approach, McGraw Hill International
2.
Behforooz and F.J. Hudson: Software Engineering Fundamentals Oxford University Press
CP 203
Unit
I
II
III
IV
V
PRINCIPLES OF PROGRAMMING LANGUAGE

C(L,T,P) = 3 (3,0,0)
Programming Language: Definition, History, Features. Issue in Language Design: Structure and Operation of
computer Language Paradigms. Efficiency, Regularity. Issues in Language Translation: Syntax, Semantics, Stages
analysis and synthesis, Parse Tree, CFG and BNF grammar.
Specification and Implementation of Elementary and Structured Data Types Type equivalence, checking and
conversion. Array, List, Structure, Union.
Sequence control with Expressions, Conditional Statements, Loops, Exception handling Subprogram definition and
activation, simple and recursive subprogram Subprogram environment. Parameter passing mechanism.
Abstract Data type, information hiding, encapsulation, type definition. Static and Stack-Based Storage management
Fixed and Variable size heap storage management. Garbage Collection
Parallel Programming: Introduction, parallel processing and programming language Threads, semaphore, monitor,
message passing.
Total
Reference Books:
1.
V.Rajaraman :Fundamentals of Computers
2.
Ghezzi: Programming Language Concepts, Addison Wesley.
3.
Kernighan, Ritchie :Programming in C
4.
Structure :Programming in C++
5.
Pratt :Programming Languages
6.
Ravi Shetty:Programming Language
Hours
8
7
7
6
6
34
CP 205:
Units
I
II
INTERNET PROGRAMING
C(L,T,P) = 3 (3,0,0)
Course Contents
Internet Connection Concepts Server, Client and Parts, DNS, Telephone, Cable and Satellite connectionsDialup, ISDN, ADSL and Leased live based connection, Cable and DSS a/c, Web TV and Internet, ISP features.
TCP and UDP protocols, URLs , CGI, MIME and introduction to SGML
Introduction of intranet - Intranet v/s LAN, Components of Internet-Workstations and Client software, Server and
Network operating system. Network cards, cabling and hubs, steps for creating an intranet. Maintenance and
connecting to internet.
E-mail technology - features and concepts massage headers, address book, attachment, filtering and forwarding mails.
III
IV
Web technology - Elements of web clients and servers languages and protocols, web page and web sites, special
kinds of web sites, web resources search engines, massage boards, clubs, news groups and chat, web page creation
concepts planning, navigation, themes and publishing. Analyzing web traffic log file data, analyzing log file and
product for analyzing web traffic.
Scripting languages HTML forms frames table webpage design java script introduction control
structures functions arrays objects simple web applications. Dynamic HTML introduction cascading
style sheets objects model and collections events model filter and transition data binding data control
ActiveX Control handling of multimedia data.
Total
Hours
6
7
8
35
Reference Books:
1. Young, The Complete Reference Of Internet, Tata McGraw Hill.
2. Deitel, Deitel and Nieto, Internet and World Wide Web How To Program, Pearson Education Publisher, 2000.
3. Thom no A. Powell, The Complete Reference HTML and XHTML, fourth edition Tata McGraw Hill, 2003.
CP 206
Units
II
III
IV
JAVA
C(L,T,P) = 4 (3,1,0)

An overview of Java: Object oriented programming, Two paradigms, abstraction, the, OOP principles, Java class
librariesDate types, variables and arrays: Integers, floating-point types, characters, Boolean, Iterates, Variable,
Data types and casting, automatic type promotion in expressions arrays.
Operators: Arithmetic operators, bit wise operators, relational operators, Boolean logical assignment operators,
the? Operator, operator precedence Control statements: -Java's selection statements, iteration statements, jump
statements Introduction to classes: Class fundamentals, declaring object reference variable, Introducing methods,
constructors, the key word, garbage collection, the finalize () method.
Methods and Classes:-Overloading methods, using objects as parameters, recursion Inheritance: Inheritance
basics, using super, method overriding, dynamic method dispatch, using abstract Classes, Using final with
inheritance, Package and Interfaces, Package asses protection, importing packages Exception handling: Exception
handling fundamentals. Exception types, Uncaught Exceptions Using try and catch, multiple catch clauses, nested
try statements throw, Finally Java built in exception creating your own exception sub classes, using exceptions.
Multithreaded Programming: The Java thread model, the main thread, creating thread, creating multiple thread,
using is alive () and join (). Thread priorities, synchronization, Inter thread Communications, suspending resuming
and stopping thread using multithreading
String handling: The string constructor, string length, special string operator character extraction, string
comparison, searching string, modifying string, data conversion, changing the case of characters, string buffer.
Networking: Networking basics, Java and the Internet Address, TCP/IP client Sockets URL,URL connection,
TCP/IP server Sockets The Applet Class The Applet Class: its architecture displays methods. The HTML
APPLET. Passing parameters to Applet. The get Documentation Base () and get Code Base () methods Applet
Context and Show Document
Total
Reference Books:
1. Java 2 Computer Reference (Tata McGraw Hill)
2. Core Java-I (Addison Wesley) - horstmann
3. Core Java - II (Addison Wesley)
Hours
7
7
35
CP 208
Unit
OPEN SOURCE TECHNOLOGY

C(L,T,P) = 3 (3,0,0)
Total Contact
Hrs.
OST overview: Evolution & development of OST and contemporary technologies, Factors leading to its
growth.
Open Source Initiative (OSI), Free Software Foundation and the GNU Project, principle and methodologies.
I
Contexts of OST (India & international).
Applications of open source (open source teaching and open source media) Risk Factors. Myths regarding
open source.
Philosophy of Software Freedom, Free Software, OSS, Closed software, Public Domain Software, Shared
software, Shared source.
II
Detail of few OSS like Open Audio, Video, 2d & 3d graphics software, system tools, office tools,
Networking & internet, Security, Educational tools and Games
Open Source Development Model, Starting and Maintaining an Open Source Project
Open Source Hardware, Open Source Design, Ongoing OS Projects (i.e. examples of few good upcoming
III
software projects.) Case Study: - Linux, Wikipedia.
Licenses and Patents: What Is A License, How to create your own Licenses?
IV
Important FOSS Licenses (Apache,BSD, GPL, LGPL), copyrights and copy lefts, Patents
Social and Financial impacts of open source technology, Economics of FOSS: Zero Marginal Cost, Income
generation opportunities
V
Problems with traditional commercial software, Internationalization, Open Source as a Business Strategy.
Total
Reference Books:
1) Vikas thada, Review to OST
2) Balaguruswamy concepts of open source concepts
CP 210
MANAGEMENT INFORMATION SYSTEM
C(L,T,P) = 3 (3,0,0)
Unit
Introduction: MIS concept, Definition, role & Impact of MIS
I
Process of management, organization structure & behavior
Basic of Management Information System: Decision Making, Information concepts
II
System concepts & control Types of system handling system complexity System development model
Development of Management Information System: Requirement and implementation of MIS
III
Choice of information Technology for Management Information System
Application of Management Information system: Application in manufacturing sector using for personal
management
IV
Financial management, Production Management, Material Management, Marketing Management Application in
Service Sector
Enterprise Resource Planning (ERP): EMS, ERP, Benefits implementation, EMS & MIS.
V
Case Studies: Application of SAP technologies in manufacturing sector.
Total
Reference Books:
1. S.Jawadekar: Management Information System, (Tata McGraw Hill)
2. Loudon & Loudon-Management Information Systems, Pearson Education Asia.
CP 212
Unit
7
6
8
35
Hours
6
7
6
7
33
PATTERN RECOGNITION & LEARNING

C(L,T,P) = 3 (3,0,0)
Total Contact Hrs.
Introduction to Learning, different approaches to machine Learning.
7
I
Learning Algorithms, Complexity of inductive inference.
Review of formal languages, finite automata and regular languages, context-free languages and
parsing.
6
II
Language identification in the limit. Gold's basic results.
Polynomial learning, PAC learnability, Valiant's results.
6
III
VC-dimension. Examples from language identification.
Sample Complexity for finite hypothesis spaces,
6
IV
Learnability of COMPUTER NETWORK F formulas.
Sample Complexity for infinite hypothesis spaces, VC dimension for neural networks.
7
V
Mistake Bound Model of Learning.
32
Total
Reference Books:
1. Mitchell T.M., Machine Learning, Mc-Graw Hill International, 1984.
2. Anthony M. and Biggs N., Computational Learning Theory: An Introduction, Cambridge University Press, England, 1992.
3. Natarajan B.K., Machine Learning: A Theoretical Approach, Morgan Kaufman, 1991.
4. Kearns M.J. and Vazirani U.V., an Introduction to Computational Learning Theory, Cambridge, Ma., MIT Press, 1994.
CP 217 E-COMMERCE
Unit
C(L,T,P) = 3 (3,0,0)
Total
Contact Hrs.
Business Strategy in an Electronic Age: Value Chain-supply chains, Proter's value chain, model and InterOrganizational value chains. Competitive Advantage-Competitive strategy
Proter's Model, First Mover advantage and competitive advantage using e-commerce Business strategy
Introduction to Business Strategy, Strategic Implications of IT technology e-commerce Implementation and
evaluation
Business to Business Electronic Commerce: Inter-organizational Transactions,
The credit Transaction Trade cycle.
A variety of transactions, Electronic markets-markets and electronic markets, usage of electronic markets,
Advantages and disadvantages of electronic markets
Electronic Data Interchange (EDI): Definition and benefits of EDI.
EDI technology, standards, communications, implementation, agreements and securities.
EDI trading patterns and transactions.
Building an E-Commerce Site: Introduction to object behavior, components, active scripting.
Object models, Infrastructure objects, service object and data objects, choosing the objects.
Building a scalable application, Addition the configure method, connecting to the database, Accessing and
versioning the database.
Building the catalog object with example. Creating shopping basket-Holding state, creating the tables for a
shopping basket, modifying the object model and making the basket accessible
J2EE Architecture Overview: Enterprise components, Information technology in the enterprises,
Introduction to enterprise objects and enterprise component model.
The J2EE model features, J2EE components-container architecture. Enterprises Java and J2EE architecture.
Total
II
III
IV
6
32
Reference Books:
1.
2.
3.
4.
David Whiteley - E-Commerce Strategy, Technology and Application, Tata McGraw Hill.
Mathew Reynolds - Beginning E-commerce with Visual Basic ASP, SQL Server 7.0 and MTS, Shroff Publishers & Distributors
Pvt. Ltd.
Perrone & Chaganti - Building Java Enterprises System with J2EE, Techmedia.
Kalakota - Frontiers of Electronic Commerce, Pearson Education.
CP 251 DATA STRUCTURE AND ALGORITHM LAB
C(L,T,P) = 2 (0,0,2+2)
1. Program on array searching, sorting (Bubble sort, Quick sort, Marge sort etc.)
2. Program to insert element at desire position, replacing element, deletion in array.
3. Various matrices operations.
4. Various strings programs.
5. Implementation of stack and queue using array
6. Implementation of stack and queue using link lists
7. Implementation of circular queue using link lists.
8. Polynomial addition, multiplication.
9. Two-way link lists programs.
10. Infix to postfix/prefix conversion.
11. BST implementation (addition, deletion, searching).
12. Graph traversal (BFS, DFS).
CP 253 INTERNET PROGRAMMING LAB
C(L,T,P) = 2 (0,0,2+2)
1. Create a bio-data of self using HTML with a photograph on the page and containing marks in a table.
2. Develop your web page with the following properties.
(1) 2 Photographs display at the same place, which can flip on mouse over.
(2) Link to separate HTML file for academics, sports and other interests.
3. Enhance your Web page using style sheets, frames and setup a hyper link to your friends page.
4. Make a form for submission of Querying about the interest rates of bank (use Text fields of HTML) and submit buttons of HTML.
5. Make a local query form, which takes in the input the range of marks through Text fields and display the list of students having marks in
that range in another window.
6. Enhance the above query through password protection.
7. Build a shopping Cart page in which items of 10 types are picked and quantity and a bill is generated by the web page.
8. Enhance the above page for making a payment through electronic billing system.
9. Associate guest book in your web page.
10.
Setup a Counter to count the number of visitors on your web page.
CP 254
JAVA LAB
C(L,T,P) = 2 (0,0,2+2)
1. Programs based on inheritance property.

2. Programs of operator overloading (complex number arithmetic, polar coordinates).
3. Programs using friend functions.
4. Write a Program for implementing exception handling
5. Write a Program for implementing multithreading
6. Write a Program for crating a stack and its operation
7. To implement spell checker using dictionary.
8. To implement color selector from a given set of colors.
9. To implement shape selector from a given set of shapes.
10. To implement a calculator with its functionality.
11. To show movement of a car.
CP 256
UNIX LAB
C(L,T,P) = 1 (0,0,2)
1. Practice commands: cp, mv, rm, ln, ls, who, echo, cat, mkdir, rmdir. Wildcards (? *) ,
I/O redirection (<, >, >>), pipelines (|)
2. Practice commands: xargs, alias, set-unset, setenv-unsetenv, export, source, ps, job, kill.
3. Practice commands: head, tail, cut, paste, sed, grep, sort, uniq, find, locate, chmod.
4. Writing a simple shell script to echo who is logged in.
5. Write a shell script to display only executable files in a given directory.
6. Write a shell script to sort a list of file either in alphabetic order or largest file first according to user response.
7. Write a shell script to count the lines. Words and characters in its input (Note: Don't use wc).
8. Write a shell script to print end of a glossary file in reverse order using array. (Hint: use awk tail).
9. Modify cal command to accept more than one month (e.g. $cal Oct, Nov, ) (Hint : use alias too)
10. Write a shell script to check whether Ram logged in, continue checking every 60 seconds until success.
CP 258
SOFTWARE ENGINEERING LAB
C(L,T,P) = 1 (0,0,2)
In this lab first 8 experiments are to practice software engineering techniques. Use any open source CASE tool. Many of them are available
at www.sourceforge.net. You can choose any other CASE tool, as per choice. Language: C++ / JAVA
Design Approach: Object Oriented these designing can be done on any automation system e.g. library management system, billing system,
payroll system, bus reservation system, gas agency management system, book-shop management system, students management system.
1. Do feasibility study
2. Document all the requirements as specified by customer in Software Requirement Specification
3. Design sequence diagrams for project
4. Design Collaboration diagram
5. Design Data Flow Diagram for the project
6. Design Entity Relation Diagram for the project
7. Design Class diagram
8. Design at least 10 test cases for each module.
9. -10: Code and test the project, which you have designed in last 8 labs.
CP 301 DATABASE MANAGEMENT SYSTEMS
Unit
C(L,T,P) = 4 (3,1,0)
Total
Contact Hrs.
INTRODUCTION TO DATABASE SYSTEMS: Overview and History of DBMS. File System vs DBMS
.Advantage of DBMS Describing and Storing Data in a DBMS.
Queries in DBMS. Transaction management and Structure of a DBMS
ENTITY RELATIONSHIP MODEL: Overview of Data Design Entities, Attributes and Entity Sets,
Relationship and Relationship Sets. Features of the ER Model-Key Constraints, Participation Constraints,
Weak Entities, Class Hierarchies, Aggregation Conceptual Data Base, Design with ER Model-Entity vs
II
Attribute, Entity vs Relationship Binary vs Ternary Relationship and Aggregation vs ternary Relationship
Conceptual Design for a Large Enterprise
RELATIONSHIP ALGEBRA AND CALCULUS: Relationship Algebra Selection and Projection, Set
III
Operations, Renaming, Joints, Division Relation Calculus, Expressive Power of Algebra and Calculus
SQL QUERIES PROGRAMMING AND TRIGGERS: The Forms of a Basic SQL Query, Union,
Intersection and Except, Nested Queries ,Correlated Nested Queries, Set-Comparison Operations, Aggregate
IV
Operators, Null Values
Embedded SQL, Dynamic SQL, ODBC and JDBC, Triggers and Active Databases.
SCHEMA REFINEMENT AND NORMAL FORMS: Introductions to Schema Refinement, Functional
Dependencies, Boyce-Codd Normal Forms, Third Normal Form
V
Normalization-Decomposition into BCOMPUTER NETWORK F Decomposition into 3-NF manufacturing
sector.
Total
Reference Books:
1.
2.
3.
4.
CP 302
Unit
8
34
Raghu Rama Krishnan : Database Managment Systems ,2nd ed: Tata Mc-Graw Hill
Elmasri -Fundamentals of Data Base Systems, Pearson Educations.
Silverschatz Korth and Sudarshan -Database Systems Concepts, 4th ed. Tata Mc-Graw Hill.
Gordon C- Everest -Database Management Objectives Systems Functions and Administration. Tata Mc-Graw Hill.
COMPUTER ARCHITECTURE
C(L,T,P) = 3 (3,0,0)
REGISTER TRANSFER LANGUAGE: Data movement around registers. Data movement from/to memory,
arithmetic and logic micro operations.
Concept of bus and timing in register transfer
CPU ORGANISATION: Addressing Modes, Instruction Format.
II
CPU organization with large registers, stacks and handling of interrupts & subroutines Instruction pipelining
ARITHMETIC ALGORITHM: Array multiplier, Booth's algorithm.
III
Addition subtraction for signed unsigned numbers and 2's complement numbers
MICROPROGRAMMED CONTROL Unit : Basic organization of micro-programmed controller
IV
Horizontal & Vertical formats, Address sequencer
MEMORY ORGANISATION: Concept of RAM/ROM, basic cell of RAM
Associative memory, Cache memory organization, Vertical memory organization.
V
I/O ORGANISATION: Introduction to Peripherals & their interfacing. Strobe based and handshake-based
communication, DMA based data transfer, I/O processor
Total
Reference Books:
1. J.P.Hayes -'Computer Architecture & organization', Mc-Graw Hill.
2. Heuring-Computer System Design and Architecture, Pearson Education.
3. M.MORRISMANNO-'Computer System Architecture', Prentice Hall of India.
4. Bartee-Computer Architecture, Tata Mc-Graw Hill.
5. Stallings-Computer Organization and Architecture, Pearson Education.
I
Total Contact
Hrs.
6
7
7
7
8
34
CP 303 DISCRETE MATHEMATICAL STRUCTURES

Unit
C(L,T,P) = 4 (3,1,0)
Total
Contact
Hrs.
Formal Logic: Statement, Symbolic Representation and Tautologies, Quantifiers, Predicator and validity
Normal form. Propositional Logic, Predicate Logic, Logic Programming and Proof of correctness.
Sets and Functions: Sets, relations, functions, operations, equivalence relations Relation of partial order,
partitions, binary relations. Transforms: Discrete Fourier and Inverse Fourier Transforms in one and two
II
dimensions, discrete Cosine transform
Graph Theory: Graphs - Directed and Undirected, Eulerian chains and cycles Hamiltonian chains and cycles,
BFS DFS Trees, chromatic number, connectivity and other graphical parameters Applications.
III
Polya's Theory of enumeration and its applications
Proof, Relation and Analysis of Algorithm Techniques for theorem proving: Direct Proof, Proof by Contra
position, Proof by exhausting cares and proof by contradiction, Principle of mathematical induction, principle
IV
of complete induction. Solution methods for linear, first-order recurrence relations with constant coefficients.
Monoids and Groups: Groups, Semigroups and Monoids cyclic semi graphs and sub monoids,
Subgroups and cosets. Congruence relations on semi groups. Morphism, Normal sub groups.
V
Structure off cyclic groups, permutation groups and dihedral groups elementary applications in coding theory
Total
Reference Books:
1. Kolman b, Busby R.: Discrete Mathematical Structure for Computer Science, PHI.
2. Knuth, D.E. :The Art of Computer Programming, Volume I, Narosa
3. Liu :Introduction to Discrete Mathematics, McGraw Hill
4. Deo : Graph Theory, PHI
CP 304
Unit
THEORY OF COMPUTATION
8
35
C(L,T,P) = 4 (3,1,0)
Total
Contact
Hrs.
Finite Automata & Regular Expression: Basic Concepts of finite state system, Deterministic and non-deterministic
finite automation and designing regular expressions relationship between regular expression & Finite automata
minimization of finite automation mealy & Moore Machines
Regular Sets of Regular Grammars: Basic Definition of Formal Language and Grammars. Regular Sets and Regular
Grammars closure proportion of regular sets, Pumping lemma for regular sets, decision Algorithms for regular sets,
II
Myhell_Nerod Theory & Organization of Finite Automata
Context Free Languages& Pushdown Automata: Context Free Grammars Derivations and Languages Relationship
between derivation and derivation trees ambiguity simplification of CEG Greiback Normal form Chomsky
normal forms Problems related to COMPUTER NETWORK F and GNF Pushdown Automata: Definitions Moves
III
Instantaneous descriptions Deterministic pushdown automata Pushdown automata and CFL - pumping lemma for
CFL - Applications of pumping Lemma.
Turing Machines: Turing machines Computable Languages and functions Turing Machine constructions Storage
in finite control multiple tracks checking of symbols subroutines two way infinite tape.
IV
Undecidability:Properties of recursive and Recursively enumerable languages Universal Turing Machines as an
undecidable problem Universal Languages Rices Theorems
Linear bounded Automata Context Sensitive Language: Chomsky Hierarchy of Languages and automata Basic
Definition& descriptions of Theory & Organization of Linear bounded Automata Properties of context-sensitive
V
languages.
Total
Reference Book:
1. John E.Hopcroft, Rajeev Motwani and J.D. Ulman, Introduction to Automata theory Languages and Computation, Pearson
Education
2. John C. Martin, Introduction to Languages and the Theory of Computation, TMH.
3. Cohen, Introduction to Computer Theory, Pearson Education Asia.
I
7
33
CP 305
Unit
WEB TECHNOLOGY
C(L,T,P) = 3 (3,0,0)
Total Contact
Hrs.
Introduction and Web Development Strategies History of Web

Protocols governing Web, Creating Websites for individual and Corporate World, Cyber Laws Web
Applications
Writing Web Projects, Identification of Objects, Target Users, Web Team, Planning and Process
Development.
HTML, XML and Scripting List, Tables, Images, Forms, Frames, CSS Document type definition,
XML schemes, Object Models, Presenting XML, Using XML Processors: DOM and SAX
Introduction to Java Script, Object in Java Script, Dynamic HTML with Java Script
Java Beans and Web Servers Introduction to Java Beans, Advantage, Properties, BDK
Introduction to EJB, Java Beans API Introduction to Servelets, Lifecycle, JSDK, Servlet API
Servlet Packages: HTTP package, working with Http request and response, Security Issues.
Introduction to JSP, JSP processing, JSP Application Design, Tomcat Server, Implicit
JSPobjects, Conditional Processing, Declaring variables and methods
Error Handling and Debugging, Sharing data between JSP pages- Sharing Session and Application Data.
Database Connectivity Database Programming using JDBC
Studying Javax.sql.*package, accessing a database from a JSP page
Application-specific Database Action, Developing Java Beans in a JSP page, introduction to Struts
framework.
Total:
II
III
IV
8
35
Reference Books:
1 Ajit singh poonia, web technology and fundamentals
2 J.E. Frend internet and history
CP 306
Unit
COMPUTER NETWORKS
C(L,T,P) = 3 (3,0,0)
Network, Network Protocols, Edge, Access Networks and Physical Media Protocol Layers and their services
models, Internet Backbones, NAP's and ISPs
Application Layer: Protocol and Service provided by application layer, transport protocols. The World Wide
Web.
HTTP, Message formats, User Server Interaction and Web caches. FTP commands and replies. Electronic Mail,
II
SMTP, Mail Message Formats and MIME and Mail Access Protocols DNS The internet's directory service DNS
records and Message.
Transport Layer: Transport Layer Service and Principles, Multiplexing and Demultiplexing applications,
Connectionless Transport. UDP Segment structure and UDP Checksum. Principles of Reliable Data Transfer-Go
back to N and Selective Repeat. Connection Oriented Transport TCP Connection and Segment Structure,
III
Sequence Numbers and acknowledgement numbers, Telnet, Round trip time and timeout. TCP connection
management
Network Layer and Routing: Network service model, Routing principles. Link State routing Algorithm, A
distant Vector routing & OSPF algorithm. Router Components; Input Prot, Switching fabric and output port.
IV
IPV6 Packet format.
Sonet/SDH: Synchronous Transport Signals. Physical configuration-SONET Devices, Sections, Lines and Paths.
SONET Layers-Photonic Layer, section layer, line layer, path layer and device layer relationship.
Sonet Frame format. Section overhead, Line overhead and path overhead. Virtual Tributaries and types of VTs.
V
Point To Point Protocol (PPP), transition States, PPP Layers-Physical Layer and Data Link Layer, Link Control
Protocols. LCP Packets and options. Authentication PAP and CHAP, Network Control Protocol (NCP).
Total
Reference Books:
1. J.F.Kurose and K.W.Ross-Computer Networking, Pearson Education Asia.
2. B.A.Forouzan-Data Communications and Networking, Tata Mc-Graw Hill.
3. Garcia and Widjaja-Communication Networks, Tata Mc-Graw Hill.
I
Total Contact
Hrs.
6
35
CP 307 COMPUTER GRAPHICS

Unit
C(L,T,P) = 3 (3,0,0)
Total
Contact Hrs.
Introduction to Raster scan displays, Storage tube displays, refreshing, flicking, interlacing, color monitors,
display processors resolution, working principle of dot matrix, inkjet laser printers, working principles of
keyboard, mouse scanner, digitizing camera, track ball , tablets and joysticks
graphical input techniques, positioning techniques, rubber band techniques, dragging etc
Scan conversion techniques, image representation, line drawing
simple DDA, Bresenhams Algorithm, Circle drawing, general method, symmetric DDA
Bresenhams Algorithm, curves, parametric function, Beizier Method, Bsp- line Method
2D & 3D Co-ordinate system, Translation, Rotation, Scaling, Reflection Inverse transformation, Composite
transformation
world coordinate system, screen coordinate system, parallel and perspective projection, Representation of 3D
object on 2D screen
Point Clipping. Line Clipping Algorithms, Polygon Clipping algorithms
Introduction to Hidden Surface elimination, Basic illumination model, diffuse reflection, specular reflection,
phong shading, Gourand shading ray tracing
color models like RGB, YIQ, CMY, HSV etc
Multimedia components, Multimedia Hardware, SCSI, IDE, MCI
Multimedia data and file formats, RTF, TIFF, MIDI, JPEG, DIB, MPEG, Multimedia Tools, Presentation
tools, Authoring tools, presentation
Total
II
III
IV
7
33
Reference Books:
1.
2.
3.
CP 308
Unit
J.Foley, A. Van dam, S.Feiner, J.Hughes: Computer Graphics Principles and Practice. Addison Wesley.
D.Rogers and Adams: Mathematical Elements of computer Graphics McGraw Hill.
D.Hearn and Baker: Computer Graphics PHI.
DESIGN & ANALYSIS OF ALGORITHMS
C(L,T,P) = 4 (3,1,0)
BACKGROUND: Review of Algorithm Complexity and Order Notations and Sorting Methods.
DIVIDE AND CONQUER METHOD: Binary Search, Merge Sort, Quick sort and strassen's matrix
multiplication algorithms.
I
GREEDY METHOD: Knapsack Problem, Job Sequencing, Optimal Merge Patterns and Minimal Spanning
Trees
DYNAMIC PROGRAMMING: Matrix Chain Multiplication. Longest Common Subsequence and 0/1
Knapsack Problem.
II
BRANCH AND BOUND: Traveling Salesman Problem and Lower Bound Theory.
Backtracking Algorithms and queens problem.
PATTERN MATCHING ALGORITHMS: Nave and Rabin Karp string matching algorithms, KMP Matcher
and Boyer Moore Algorithms.
III
ASSIGNMENT PROBLEMS: Formulation of Assignment and Quadratic Assignment Problem
RANDOMIZED ALGORITHMS. Las Vegas algorithms, Monte Carlo algorithms, randomized algorithm for
Min-Cut, randomized algorithm for 2-SAT.
IV
Problem definition of Multicommodity flow, Flow shop scheduling and Network capacity assignment
problems
PROBLEM CLASSES NP, NP-HARD AND NP-COMPLETE: Definitions of P, NP-Hard and NP-Complete
Problems.
V
Decision Problems. Cook's Theorem. Proving NP-Complete Problems - Satisfiability problem and Vertex
Cover Problem. Approximation Algorithms for Vertex Cover and Set Cover Problem.
Total
Reference Books:
1.
2.
3.
4.
5.
Aho A.V. J.E. Hopcroft, J.D. Ullman: Design and Analysis of Algorithms, Pearson Education.
Rivest and Cormen, Introduction to Algorithms, Prentice Hall of India.
Baase, Computer Algorithms, Pearson Education.
Brassard, Algorithmics, Prentice Hall.
Bazaraa, Linear Programming & Network Flows,John Wiley & Sons.
Total
Contact
Hrs.
8
35
CP 309 LOGICAL AND FUNCTIONAL PROGRAMMING

Unit
C(L,T,P) = 3 (3,0,0)
Total Contact
Hrs.
PROPOSITIONS: Fully parenthesized propositions, Evaluation of constant propositions, Evaluation of

proposition n a state.
Precedence rules for operators, Tautologies, Propositions a sets of states and Transforming English to
prepositional form
REASONING USING EQUIVALENCE TRANSFORMATIONS: The laws of equivalence, rules of substitution
and transitivity, formal system of axioms and Inference rules.
NATURAL DEDUCTION SYSTEM: Introduction to deductive proofs, Inference rules, proofs and sub-proofs,
adding flexibility to the natural deduction system and developing natural deduction system proofs
PREDICATES: Extending the range of a state, Quantification, Free and Bound Identifiers, Textual substitution
Quantification over other ranges and some theorems about textual substitution and states
LOGIC PROGRAMMING: Introduction to prepositional and predicate calculus, First-order predicate calculus
Format logical systems, PROLOG programming-Facts, Rules and queries, Implementations, Applications,
Strengths and Weaknesses
FUNCTIONAL PROGRAMMING: Introduction to lambda calculus-Syntax and semantics, Computability and
correctness.
Features of Functional Languages-Composition of functions, Functions as first-class Objects, no side effects and
clean semantics
LISP Programming-Data types and structures, Scheme dialect, primitive functions, functions for constructing
functions and functional forms. Applications of functional languages and comparison of functional and
imperative languages
Total
II
III
IV
7
7
35
Reference Books:
1.
2.
3.
Appleby-Programming Languages, Tata Mc-Graw Hill.

Sebesta-Concepts of Programming Languages, Pearson Education
David Gries-The Science of programming, Narosa Publication House.
CP 310
SYSTEM SOFTWARE ENGINEERING
Unit
C(L,T,P) = 4 (3,1,0)

Overview: Comparison of machine language, assembly language and high level languages
External and internal representation of instructions and data. Data allocation structures, search structures
and addressing modes.
Activities and system software for program generation, translation and execution. Editors for source code
and object code/executable code files
Assemblers: Assembly language specification. Machine dependent and independent features of assembler.
Classification of assemblers. Pass structure of assemblers (problem and associated for IBM-PC.
Loader and Linkers: Functions and classification.
Machine dependent and independent features of loaders
Design of bootstrap, absolute and relocatable loaders, Design of linker. Case study of MS-DOS linker
Macro processors: Macro definition, call and expansion. Macro processor algorithm and data structure.
Machine independent features (parameters, unique labels, conditional expansion, nesting and recursion).
Pass structure and design of microprocessor and macro assembler, Case study of MASM macro processor
High level language processor: HLL specification: Grammars and parse trees, expression and precedence.
Lexical analysis: Classification of tokens, scanning methods, character recognition, lexical ambiguity.
Syntactic analysis: Operator precedence parsing, recursive descent parsing.
Symbol Table Management: Data structure for symbol table, basing functions for symbols, overflow
technique, block structure in symbol table
Total
II
III
IV
Reference Books:
1.
2.
3.
D.M. Dhamdhere-System programming & operating system. Tata McGraw Hill.

L.L. Beck-System Software, Pearson Education
J.J. Donovan-System programming Tata McGraw Hill.
Total Contact
Hrs.
7
6
33
CP 311
Unit
II
III
IV
ADVANCED DATA STRUCTURES
C(L,T,P) = 3 (3,0,0)
Total Contact
Hrs.
ADVANCED TREES: Definitions Operations on Weight Balanced Trees (Huffman Trees), 2-3 Trees and
Red-Black Trees.
Augmenting Red-Black Trees to Dynamic Order Statistics and Interval Tree Applications.
Operations on Disjoint sets and its union-find problem Implementing Sets. Dictionaries, Priority Queues
and Concatenable Queues using 2-3 Trees
MERGEABLE HEAPS: Merge able Heap Operations, Binomial Trees Implementing Binomial Heaps and
its Operations, 2-3-4. Trees and 2-3-4 Heaps.
Amortization analysis and Potential Function of Fibonacci Heap Implementing Fibonacci Heap.
SORTING NETWORK: Comparison network, zero-one principle, bitonic sorting and merging network
sorter.
GRAPH THEORY DEFINITIONS: Definitions of Isomorphic Components.
Circuits, Fundamental Circuits, Cut-sets. Cut-Vertices Planer and Dual graphs, Spanning Trees,
Kuratovski's two Graphs
GRAPH THEORY ALGORITHMS: Algorithms for Connectedness, Finding all Spanning Trees in a
Weighted Graph and Planarity Testing
Breadth First and Depth First Search, Topological Sort, Strongly Connected Components and Articulation
Point. Single Min-Cut Max-Flow theorem of Network Flows. Ford-Fulkerson Max Flow Algorithms
NUMBER THEORITIC ALGORITHM: Number theoretic notation, Division theorem

GCD recursion, Modular arithmetic, Solving Linear equation, Chinese remainder theorem, power of an
V
element
RSA public key Cryptosystem, primality Testing and Integer Factorization
Total
Reference Books:
1. Narsingh Deo-Graph Theory with Application to Engineering and Computer Science, Prentice Hall of India.
2. Baase-Computer Algorithms, Pearson Education.
3. Cormen-Introduction to Algorithms, Prentice Hall of India.
4. Aho A.V., Hopcrptt J.E. and Ullman J.D.-The Design and Analysis of Computer Algorithms, Pearson Education.
5. Horowitz and Sawhni-Fundamentals of Data Structures Galgotia Book Source.
CP 312
Unit
DATA MININIG AND DATA WAREHOUSING
8
35
C(L,T,P) = 3 (3,0,0)

Overview, Motivation(for Data Mining),Data Mining-Definition & Functionalities Data Processing, Form of
Data Preprocessing Data Cleaning: Missing Values, Noisy Data, (Binning, Clustering, Regression, Computer
and Human inspection) Inconsistent Data, Data Integration and Transformation. Data Reduction:-Data Cube
I
Aggregation, Dimensionality reduction Data Compression, Luminosity Reduction, Clustering, Discrimination
and Concept hierarchy generation
Concept Description:- Definition, Data Generalization, Analytical Characterization, Analysis of attribute
relevance, Mining Class comparisons Statistical measures in large Databases. Measuring Central Tendency,
Measuring Dispersion of Data, Graph Displays of Basic Statistical class Description Mining Association Rules
II
in Large Databases, Association rule mining, mining Single-Dimensional Boolean Association rules from
Transactional Databases Apriority Algorithm, Mining Multilevel Association rules from Transaction
Databases and Mining Multi-Dimensional Association rules from Relational Databases.
What is Classification & Prediction, Issues regarding Classification and prediction, Decision tree, Bayesian
Classification, Classification by Back propagation Multilayer feed-forward Neural Network, Back propagation
Algorithm, Classification methods K-nearest neighbor classifiers, Genetic Algorithm. Cluster Analysis: Data
III
types in cluster analysis, Categories of clustering methods Partitioning methods. Hierarchical ClusteringCURE and Chameleon. Density Based Methods-DBSCAN, OPTICS. Grid Based Methods- STING, CLIQUE.
Model Based Method Statistical Approach, Neural Network approach, Outlier Analysis
Data Warehousing: Overview, Definition, Delivery Process, Difference between Database System and Data
Warehouse Multi Dimensional Data Model, Data Cubes, Stars, Snow Flakes, Fact Constellations, Concept
IV
hierarchy, Process Architecture, 3 Tier Architecture, Data Mining
Aggregation, Historical information, Query Facility, OLAP function and Tools.
OLAP Servers, ROLAP, MOLAP, HOLAP, Data Mining interface, Security, Backup and Recovery, Tuning
V
Data Warehouse, Testing Data Warehouse.
Total
Reference Books:
1. Rob Mattson-Web Warehousing and Knowledge Management, Tata Mc-Graw Hill.
2. Shelley Powers-Dynamic Web Publishing, Techmedia.
3. Anahory-Data Warehousing in the Real World, Pearson Education Asia.
Hours
8
35
CP 314
SIMULATION AND MODELING
Unit
C(L,T,P) = 3 (3,0,0)
Total Contact
Hrs.
System definition and components, Stochastic activities, continuous and discrete systems
System modeling, types of models, static and dynamic physical models, static and dynamic mathematical
models, full corporate model, types of system study
System simulation, why to simulate and when to simulate, basic nature of simulation
technique of simulation, comparison of simulation and analytical methods, types of system simulation, real
time simulation, hybrid simulation
II
Simulation of pure-pursuit problem single-server queuing system and an inventory problem, Monte-Carlo
simulation, Distributed Lag models, Cobweb model.
Simulation of continuous systems, analog vs. digital simulation, simulation of water reservoir system,
simulation of servo system, simulation of an autopilot.
Discrete system simulation, fixed time-step vs. event-to-event model, generation of random numbers, test of
III
randomness, generalization of non-uniformly distributed random numbers
Monte-Carlo computation vs. stochastic simulation
System Dynamics, exponential growth models, exponential decay models, modified exponential growth models
logistic curves, generalization of growth models, system dynamics diagrams, feedback in socio-economic
IV
systems and world models
Simulation of PERT networks, critical path simulation, uncertainties in activity duration, resource allocation
and consideration.
Simulation software, simulation languages, continuous and discrete simulation languages, expression based
V
languages, object-oriented simulation, general-purpose vs. application-oriented simulation packages
CSMP-III and MODSIM-III.
Total
Reference Books:
I
1.
2.
II
III
IV
33
Kelton W.D. and Law A.M. -Simulation Modeling and Analysis, II Edition, Mc-Graw Hill.
G.A.Korn-Interactive Dynamic System Simulation, Mc Graw Hill.
CP 316
Units
BIO-INFORMATICS
C(L,T,P) = 3 (3,0,0)
Course Contents
Introductory Concepts: The Central Dogma The Killer application Parallel Universes Watsons Definition
Top Down Versus Bottom up Information Flow Convergence Databases Data Management Data Life Cycle
Database Technology Interfaces Implementation Networks Geographical Scope Communication Models
Transmissions Technology Protocols Bandwidth Topology Hardware Contents Security Ownership
Implementation Management.
Search Engines and Data Visualization: The search process Search Engine Technology Searching and
Information Theory Computational methods Search Engines and Knowledge
Management Data Visualization sequence visualization structure visualization user Interface Animation
Versus simulation General Purpose Technologies.
Statistics and Data Mining: Statistical concepts Microarrays Imperfect Data Randomness Variability
Approximation Interface Noise Assumptions Sampling and Distributions Hypothesis Testing Quantifying
Randomness Data Analysis Tool selection statistics of Alignment Clustering and Classification Data Mining
Methods Selection and Sampling Preprocessing and Cleaning Transformation and Reduction Data Mining
Methods Evaluation Visualization Designing new queries Pattern Recognition and Discovery Machine
Learning Text Mining Tools.\
Pattern Matching: Pairwise sequence alignment Local versus global alignment Multiple sequence alignment
Computational methods Dot Matrix analysis Substitution matrices Dynamic Programming Word methods
Bayesian methods Multiple sequence alignment
Modeling and Simulation: Drug Discovery Components Process Perspectives Numeric considerations
Algorithms Hardware Issues Protein structure AbInitio Methods Heuristic methods Systems Biology
Tools
Total
REFERENCE BOOKS:
1. Ranjan Bose, Information Theory, Coding and Cryptography, Tata McGraw- Hill, 2002.
2. Viterbi, Information Theory and Coding, McGraw-Hill, 1982.
3. John G. Proakis, Digital Communications, McGraw-Hill, New edition, 2000.
4. Gareth A. Jones and J. Mary Jones, Information and Coding Theory, Springer
Undergraduate Mathematics Series, 2000
Hours
35
CP 351 COMPUTER GRAPHICS LAB
C(L,T,P) = 1 (0,0,2)
1. Implementation of line generation using slopes method, DDA and Bresenhams algorithms.
2. Implementation of circle generation using Mid-point method and Bresenhams algorithm.
3. Implementation of ellipse generation using Mid-point method.
4. Implementation of polygon filling using Flood-fill, Boundary-fill and Scan-line algorithms.
5. Implementation of 2D transformation: Translation, Scaling, Rotation, Mirror Reflection and Shearing (write a menu driven program).
6. Implementation of Line Clipping using Cohen-Sutherland algorithm and Bisection Method.
7. Implementation of Polygon Clipping using Sutherland-Hodgman algorithm.
8. Implementation of 3D geometric transformations: Translation, Scalind and rotation.
9. Implementation of Curve generation using Interpolation methods.
10. Implementation of Curve generation using B-spline and Bezier curves.
11. Implementation of any one of Back face removal algorithms such as Depth-Buffer algorithm, Painters algorithm, Warnocks
algorithm, Scan-line algorithm)
CP 352
COMPUTER ARCHITECTURE LAB
C(L,T,P) = 2 (0,0,2+2)]
This lab will be based on assembly programming on of RISC processor simulator SPIM. SPIM simulator is available at site
SPIM exercises
1. Read an integer from the keyboard and print it out if (n => n_min AND n <= n_max).
2. Read an integer from the keyboard and print out the following as per switch-case statement
Switch (n)
{n <= 10 print "not a lot"
n == 12 print "a dozen"
n == 13 print "a baker's dozen"
n == 20 print "a score"
n >= 100 print "lots and lots"
n! = 42 print "integer"
otherwise print "you have the answer!}
3. Read a string from the keyboard and count the number of letters. Use the equivalent of following for loop to count number
of chars.
for (s1=0; str [s1] != '\n'; ++s1)
4. Print out a line of characters using simple procedure call.
5. Print out a triangle of characters using recursive procedure call.
6. Print factorial of a number using recursion.
7. Print reverse string after reading from keyboard.
8. Print a string after swapping case of each letter.
9. Print an integer in binary and hex.
10. Implement bubble sort algorithm.
11. Print Pascal Triangle of base size 12.
12. Evaluate and print Ackerman function.
CP 353
DATABASE MANAGEMENT LAB
C(L,T,P) = 2 (0,0,2+2)
Student can use MySql (preferred open source DBMS) or any other Commercial DBMS tool (MS-Access / ORACLE) at backend and C++
(preferred) VB/JAVA at front end.
1. (a) Write a C++ program to store students records (roll no, name, father name) of a class using file handling. (Using C++ and File
handling).
(b) Re-write program 1, using any DBMS and any compatible language. (C++/MySQL) (VB and MS-Access)
2. Database creation/ deletion, table creation/ deletion.
(a) Write a program to take a string as input from user. Create a database of same name. Now ask user to input two more strin g, create two
tables of these names in above database.
(b) Write a program, which ask user to enter database name and table name to delete. If database exist and table exist then delete that table.
3. Write a program, which ask user to enter a valid SQL query and display the result of that query.
4. Write a program in C++ to parse the user entered query and check the validity of query. (Only SELECT query with WHERE clause)
5 - 6. Create a database db1, having two tables t1 (id, name, age) and t2 (id, subject, marks).
(a) Write a query to display name and age of given id (id should be asked as input).
(b) Write a query to display average age of all students.
(c) Write a query to display mark-sheet of any student (whose id is given as input).
(d) Display list of all students sorted by the total marks in all subjects.
7 - 8. Design a Loan Approval and Repayment System to handle Customer's Application for Loan and handle loan repayments by
depositing installments and reducing balances.
9 -10. Design a Video Library Management System for managing issue and return of Video tapes/CD and manage customer's queries
CP 354
COMPUTER NETWORK LAB
C(L,T,P) = 1(0,0,2)
1. The lab is to be conducted in Perl programming language, Perl works on all platforms (including windows)
2. Write few basic programs of Perl.
a. A Hello World Program
b. Write a program to add to 10 numbers.
c. Write a program of reading input from the keyboard and displaying them on monitor.
d. Write a program to take two strings as input and compare them
3. To understand advance constructs of Perl
e. Write a program to create a list of your course (all theory courses in current semester) using array and print them.
f. Write a program to accept ten number, store it into a hash table (Perl have itself) and when asked by user tell him that number exists or
not. (do not store duplicate numbers)
g. Write a program to compute the number of lines in a file.
4. Find the IP address of a host or turn an IP address into a name.
5. Connect to an FTP server and get or put files. Automate the one-time transfer of many files to download the file everyday, which have
changed since yesterday. (use Net: FTP)
6. Write a program to send mail. The programs should monitor system resources like disk space and notify admin by mail when disk space
becomes dangerously low. (use Net: mail)
7. Fetch mail from a POP3 server (use Net: pop 3)
8. Find out who owns a domain (use Net: whois, Whois is a service provided by domain name registration authorities to identify owners of
domain names)
9. Test whether a machine is alive. machine can be specified using IP address or domain name of machine.
10. You have a URL that fetch its content from a Perl script, convert it to ASCII text (by stripping html tags) and display it.
11. Writing a TCP Client, Writing a TCP Server and communicate some data over TCP
CP 355 WEB PROGRAMING LAB

1.
2.
3.
4.
5.
6.
7.
8.
9.
C(L,T,P) = 2 (0,0,2+2)
Develop a static html page using style sheet to show your own profile.
Add a page to show 5 photos and add a page to show your academics in a table
Add a page containing 5 links to your favorite website Add navigational links to all above pages (add menu).
Update your homepage, by creating few html file (e.g. header, footer, left-sidebar, right), in these file you will put all html code
to be shown on every page.
Use Cascading Style Sheets to format your all pages in a common format.
Basic Php programs: Write a simple "hello word" program using php.
Write a program to accept two strings (name and age) from user. Print welcome statement e.g. Hi Ram, your age is 24."
Write a program to create a calculator, which can support add, subtraction and multiply and division operation.
Write a program to take input parameters for a table (no. of rows and no. of columns), and create the desired table.
Create a "Contact Me" page -Ask user to enter his name, email ID, Use Java-Script to verify entered email address.
Store submitted value in a MySql database. Display latest 5 submitted records in contact me page. Display above record with
navigation support. e.g. (next, previous, first, last).
CP 356
SYSTEM SOFTWARE LAB
C(L,T,P) = 2 (0,0,2+2)
In this lab we will practice how source code is processed by compiler/ assembler/ pre-processor.
All programs have to be written in C++
1. Write a class for file handling, having functions to open/ read/ write/ close/ reset.
(2-5) Develop a program which take input a file of C language
a. Print Lines of Codes and print signature of all function (including main)
b. Print number of variables in every function (with type)
c. Generate a new file without the comments. (/* */ and //)
d. Process all #define (i.e. #define MAX 100, than replace every occurrence of MAX with 100).
(Macro value 100 can be an expression also.)
6. Write a program to create a symbol table.
7. Write a program which can parse a given C file and store all variables and functions in symbol table.
(8-10). Write a program to convert given C program into RTL code.
Assumption
a. input C file will have only main function,
b. only two type of statements, either variable declaration statements
(int sub1=23;) OR mathematical expression (sub1=sub2-sub3 ;).
c. system have 16 registers (R1 to R16)
d. RTL opcode available are: ADD, LOAD, MOVE, SUB, MULTIPLY, DIVIDE
e. No control-flow (i.e. if-else, loop, jump etc.) expression is there in input code e.g.
int main()
{
int sub1=72, sub2=85, sub3=63;
float per;
per=(sub1+sub2+sub3)/(100+100+100);
}
CP 402
NETWORK SECURITY SYSTEM
Unit
C(L,T,P) = 4 (3,1,0)
Total
Contact
Hrs.
Introduction to security attacks, services and mechanism, introduction to cryptography.

Conventional Encryption: Conventional encryption model, classical encryption techniques- substitution ciphers
and transposition ciphers, cryptanalysis, stereography, stream and block ciphers.
Modern Block Ciphers: Block ciphers principals, Shannons theory of confusion and diffusion, festal structure,
data encryption standard(DES), strength of DES, differential and linear crypt analysis of DES, block cipher modes
of operations, triple DES, IDEA encryption and decryption, strength of IDEA, confidentiality using conventional
encryption, traffic confidentiality, key distribution, random number generation
Introduction to graph, ring and field, prime and relative prime numbers, modular arithmetic
Fermats and Eulers theorem, primality testing, Euclids Algorithm, Chinese Remainder theorem, discrete
logarithms.
Principals of public key crypto systems, RSA algorithm, security of RSA, key management, Diffle-Hellman key
exchange algorithm, introductory idea of Elliptic curve cryptography, Elganel encryption.
Message Authentication and Hash Function: Authentication requirements, authentication functions, message
authentication code
Hash functions, birthday attacks, security of hash functions and MACS, MD5 message digest algorithm,
Secure hash algorithm (SHA). Digital Signatures: Digital Signatures, authentication protocols, digital signature
standards (DSS), proof of digital signature algorithm
Authentication Applications: Kerberos and X.509, directory authentication service, electronic mail security-pretty
good privacy (PGP), S/MIME
IP Security: Architecture, Authentication header, Encapsulating security payloads, combining security
associations, key management.
Web Security: Secure socket layer and transport layer security, secure electronic transaction (SET). System
Security: Intruders, Viruses and related threads, firewall design principals, trusted systems
Total
II
III
IV
8
35
Reference Books:
Hawang & Briggs-Network security, Mc Graw Hill.
CP 403
ASYNCHRONOUS TRANSFER MODE NETWORKS
Unit
C(L,T,P) = 3 (3,0,0)

INTRODUCTION: An overview of communication networks protocol layering, multiplexing and switching
principles of Asynchronous Transfer Mode Precursor Technologies-X 25, Frame Relay and ISDN.
Broad Band-ISDN (B-ISDN)-Configuration, Interfaces, reference model and services
ATM PROTOCOL STACK :ATM reference model,
Physical layer transmission convergence sub layer functions, physical medium dependent sub layer and physical
layer standards for ATM
ATM layer-ATM cell header structure.
ATM layer functions. ATM adaptation layer-AAL1 to AAL5 layers
TRAFFIC MANAGEMENT: Concept of Traffic and service. Traffic and service characteristics of voice and
video data.
ATM Traffic descriptors and QOS parameters. Factors affecting QOS parameters and service categories.
QOS classes. Elements of ATM Traffic management-Traffic contracting, policing and shaping
SWITCHING IN ATM: Performance measures and Architectural issues in switch design. ATM switching
Architecture
Total
II
III
IV
Reference Books:
1.
2.
3.
Sunil Kasera-ATM Networks Concepts and Protocols, Tata McGraw Hills.

Rainer Handel-ATM Networks 2nd Edition, Pearson Education Asia.
Stallings B-ISDN & ATM with Frame Relay-Pearson
Total Contact
Hrs.
6
7
7
7
35
CP 404
ADVANCED COMPUTER ARCHITECTURES
Unit
C(L,T,P) = 4 (3,1,0)
Total
Contact
Hrs.
INTRODUCTION: Parallel Computing, Parallel Computer Model, Program and Network Properties,
Parallel Architectural Classification Schemes, Flynns & Fangs Classification, Performance Metrics and
Measures, Speedup Performance Laws: Multiprocessor System and Interconnection Networks;
I
IEEE POSIX Threads: Creating and Exiting Threads, Simultaneous Execution of Threads, Thread
Synchronization using Semaphore and Mutex, Canceling the Threads.
PIPELINING AND MEMORY HIERARCHY: Basic and Intermediate Concepts, Instruction Set Principle;
ILP: Basics, Exploiting ILP, Limits on ILP; Linear and Nonlinear Pipeline Processors; Super Scalar and Super
II
Pipeline Design; Memory Hierarchy Design: Advanced Optimization of Cache Performance, Memory
Technology and Optimization, Cache Coherence and Synchronization Mechanisms.
THREAD AND PROCESS LEVEL PARALLEL ARCHITECTURE: Introduction to MIMD Architecture,
Multithreaded Architectures, Distributed Memory MIMD Architectures
Shared Memory MIMD Architecture, Clustering, Instruction Level Data Parallel Architecture, SIMD
III
Architecture, Fine Grained and Coarse Grained SIMD Architecture, Associative and Neural Architecture
Data Parallel Pipelined and Systolic Architectures, Vector Architectures
Parallel Algorithms: PRAM Algorithms: Parallel Reduction, Prefix Sums, Preorder Tree Traversal, Merging
two Sorted lists;
Matrix Multiplication: Row Column Oriented Algorithms, Block Oriented Algorithms; Parallel Quick sort,
IV
Hyper Quick sort;
Solving Linear Systems: Gaussian Elimination, Jacobi Algorithm; Parallel Algorithm Design Strategies
Developing Parallel Computing Applications: OpenMP Implementation in C: Execution Model, Memory
Model;
Directives: Conditional Compilation, Internal Control Variables, Parallel Construct, Work Sharing Constructs,
V
Combined Parallel Work-Sharing Constructs, Master and Synchronization Constructs; Run-Time Library
Routines: Execution Environment Routines, Lock Routines, Timing Routines; Simple Examples in C. Basics
of MPI
Total
Reference Books:
1. Hawang & Briggs-Computer Architecture & Parallel Processing, Mc Graw Hill.
2. Subrata Das-Advanced Computer Architecture, Vol I & II.
CP 405
Unit
OPERATING SYSTEMS
35
C(L,T,P) = 3 (3,0,0)
Introduction to Operating Systems, Operating system services, multiprogramming, time-sharing system,

storage structures
System calls, multiprocessor system.
I
Basic concepts of CPU scheduling, Scheduling criteria, Scheduling algorithms, algorithm evaluation, multiple
processor scheduling, real time scheduling
I/0 devices organization, I/0 devices organization, I/0 devices organization, I/0 buffering
Process concept, process scheduling, operations on processes
Threads, inter-process communication, precedence graphs
Critical section problem, semaphores, and classical problems of synchronization.
II
Deadlock problem, deadlock characterization, deadlock prevention, deadlock avoidance, deadlock detection,
recovery from deadlock, Methods for deadlock handling.
Concepts of memory management, logical and physical address space
swapping, contiguous and non-contiguous allocation
III
paging, segmentation, and paging combined with segmentation
Concepts of virtual memory, demand paging, page replacement algorithms
Allocation of frames, thrashing, demand segmentation. Security threads protection intruders-Viruses-trusted
IV
system
Disk scheduling, file concepts, file access methods, allocation methods, directory systems, file protection,
V
Introduction to distributed systems and parallel processing case study.
Total
Reference Books:
1. A.S.Tanenbaum-Modern Operating Systems, Pearson Education Asia.
2. D.M.Dhamdhere-Operating Systems-A Concept based approach, Tata Mc-Graw Hills.
3. Achyut godble -Operating Systems, Tata Mc-Graw Hills.
4. Stallings-Operating System, Pearson.
Total Contact
Hrs.
7
8
34
CP 406
COMPILER CONSTRUCTION
Unit
C(L,T,P) = 4 (3,1,0)
Total
Contact
Hrs.
Compiler, Translator, Interpreter definition, Phase of compiler introduction to one pass & Multipass
compilers,
Bootstrapping, Review of Finite automata lexical analyzer, Input, buffering, Recognition of tokens
Idea about LEX: A lexical analyzer generator, Error handling
Review of CFG Ambiguity of grammars, Introduction to parsing. Bottom up parsing Top down parsing
techniques, Shift reduce parsing, Operator precedence parsing, Recursive descent parsing predictive parsers.
LL grammars & passers error handling of LL parser. LR parsers, Construction of SLR, Conical LR & LALR
parsing tables, parsing with ambiguous grammar.
Introduction of automatic parser generator: YACC error handling in LR parsers.
Syntax directed definitions; Construction of syntax trees,
L-attributed definitions, Top down translation.
Specification of a type checker, Intermediate code forms using postfix notation and three address code,
Representing TAC using triples and quadruples, Translation of assignment statement. Boolean expression and
control structures
Storage organization, Storage allocation, Strategies, Activation records, Accessing local and non local names
in a block structured language
Parameters passing, Symbol table organization, Data structures used in symbol tables
Definition of basic block control flow graphs, DAG representation of basic block, Advantages of DAG,
Sources of optimization, Loop optimization, Idea about global data flow analysis, Loop invariant computation,
Peephole optimization, Issues in design of code generator, A simple code generator, Code generation from
DAG
Total
II
III
IV
8
35
Reference Books:
1.
2.
3.
CP 407
Unit
II
III
IV
V
A.V. Aho-Compilers principles, techniques and tools, Pearson Education Asia.

N.Wirth-Compiler Construction, Pearson Education Asia.
Charles N.Fischer-Crafting a Computer in C, Pearson Education Asia.
ARTIFICIAL INTELLIGENCE
C(L,T,P) = 4 (3,1,0)

Meaning and definition of artificial intelligence, Various types of production systems, Characteristics of
production systems
Study and comparison of breadth first search and depth first search. Techniques, other Search Techniques
like hill Climbing, Best first Search.
A* algorithm, AO* algorithms etc, and various types of control strategies
Knowledge Representation, Problems in representing knowledge, knowledge representation using
propositional and predicate logic, comparison of propositional and predicate logic
Resolution, refutation, deduction, theorem proving, inferencing, monotonic and non-monotonic reasoning.
Probabilistic reasoning, Baye's theorem, semantic networks scripts schemas, frames, conceptual dependency
and fuzzy logic, forward and backward reasoning
Game playing techniques like minimax procedure,
alpha-beta cut-offs etc, planning, Study of the block world problem in robotics,
Introduction to understanding and natural languages processing
Introduction to learning, Various techniques used in learning, introduction to neural networks, applications of
neural networks, common sense, reasoning, some example of expert systems.
Total
Reference Books:
1. E.Rich, K Knight-Artificial Intelligence, Tata McGraw Hills.
2. S.Russell, P.Norving-Artificial Intelligence-A Modern Approach, Pearson Education, Asia.
3. Thomas Dean-Artificial Intelligence-Theory & Practice, Pearson Education, Asia.
4. Alison Caursey - The Essence of Artificial Intelligence, Pearson Education, Asia.
Total
Contact Hrs.
7
7
7
7
34
CP 408
DISTRIBUTED SYSTEMS
C(L,T,P) = 3 (3,0,0)
Unit

CHARACTERIZATION OF DISTRIBUTED SYSTEMS: Introduction, Examples of distributed Systems,
Resource sharing and the Web Challenges. System Models: Architectural models, Fundamental Models
Theoretical Foundation for Distributed System: Limitation of Distributed system, absence of global clock, shared
memory, Logical clocks, Lamports & vectors logical clocks, Causal ordering of messages, global state, and
I
termination. Distributed Mutual Exclusion: Classification of distributed mutual exclusion, requirement of mutual
exclusion theorem, Token based and non token based algorithms, performance metric for distributed mutual
exclusion algorithms
DISTRIBUTED DEADLOCK DETECTION: system model, resource Vs communication deadlocks, deadlock
prevention, avoidance, detection & resolution, centralized dead lock detection, distributed dead lock detection
Path pushing algorithms, edge chasing algorithms. Agreement Protocols: Introduction System models,
II
classification of Agreement Problem Byzantine agreement problem, Consensus problem, Interactive consistency
Problem, Solution to Byzantine Agreement problem Application of Agreement problem, Atomic Commit in
Distributed Database system
DISTRIBUTED OBJECTS AND REMOTE INVOCATION: Communication between distributed objects,
Remote procedure call, Events and notifications, Java RMI case study. SECURITY: Overview of security
techniques, Cryptographic algorithms, Digital signatures Cryptography pragmatics, Case studies: Needham
III
Schroeder, Kerberos, SSL & Millicent. DISTRIBUTED FILE SYSTEMS: File service architecture, Sun
Network File System, The Andrew File System, Recent advances
TRANSACTIONS AND CONCURRENCY CONTROL: Transactions, Nested transactions, Locks, Optimistic
Concurrency control, Timestamp ordering, Comparison of methods for concurrency control. DISTRIBUTED
TRANSACTIONS: Flat and nested distributed transactions, Atomic Commit protocols, Concurrency control in
IV
distributed transactions, Distributed deadlocks, Transaction recovery. Replication: System model and group
communication, Fault - tolerant services, highly available services, Transactions with replicated data
DISTRIBUTED ALGORITHMS: Introduction to communication protocols, Balanced sliding window protocol,
Routing algorithms, Destination based routing, APP problem, Deadlock free Packet switching, Introduction to
V
Wave & traversal algorithms, Election algorithm.CORBA CASE STUDY: CORBA RMI, CORBA services
Total
Reference Books:
1. George Coulouris-Distributed Systems Concepts and Design, 3rd ed., Pearson Education Asia.
2. A.S. Tanenbaum-Distributed Systems Principles and Paradigms, Prentice Hall of India.
3. Darrel Ince-Developing Distributed and E-Commerce Applications, Addition Wesley.
CP 409
Unit
REAL TIME SYSTEMS
Hours
8
34
C(L,T,P) = 3 (3,0,0)

Introduction: Definition, Typical Real Time Applications: Digital Control, High Level Controls, Signal
Processing etc., Release Times, Deadlines, and Timing Constraints, Hard Real Time Systems and Soft Real
I
Time Systems, Reference Models for Real Time Systems: Processors and Resources, Temporal Parameters of
Real Time Workload Periodic Task Model, Precedence Constraints and Data Dependency.
Real Time Scheduling: Common Approaches to Real Time Scheduling: Clock Driven Approach, Weighted
Round Robin Approach, Priority Driven Approach, Dynamic Versus Static Systems, Optimality of EffectiveII
Deadline-First (EDF) and Least-Slack-Time-First (LST) Algorithms, Offline Versus Online Scheduling,
Scheduling Aperiodic and Sporadic jobs in Priority Driven and Clock Driven Systems
Resources Access Control: Effect of Resource Contention and Resource Access Control (RAC), Nonpreemptive Critical Sections, Basic Priority-Inheritance and Priority-Ceiling Protocols Stack Based PriorityIII
Ceiling Protocol, Use of Priority-Ceiling Protocol in Dynamic Priority Systems, Preemption Ceiling Protocol,
Access Control in Multiple-Unit Resources, Controlling Concurrent Accesses to Data Objects
Multiprocessor System Environment: Multiprocessor and Distributed System Model, Multiprocessor PriorityCeiling Protocol, Schedulability of Fixed-Priority End-to-End Periodic Tasks, Scheduling Algorithms for EndIV
to-End Periodic Tasks, End-to-End Tasks in Heterogeneous Systems, Predictability and Validation of Dynamic
Multiprocessor Systems, Scheduling of Tasks with Temporal Distance Constraints
Real Time Communication: Model of Real Time Communication
Priority-Based Service and Weighted Round- Robin Service Disciplines for Switched Networks
V
Medium Access Control Protocols for Broadcast Networks, Internet and Resource Reservation Protocols, Real
Time Protocols, Communication in Multicomputer System, An Overview of Real Time Operating Systems
Total
Reference Books:
1. W.S.Liu-Real-Time Systems, Pearson Education Asia.
2. Raymond A.Buhr-Introduction to Real-Time Systems, Pearson education Asia.
3. Alan Burns-Real-Time Systems and Programming Languages, Pearson Education.
Hours
6
8
35
CP 410
FAULT TOLERANT SYSTEM
Unit
C(L,T,P) = 3 (3,0,0)
Total
Contact
Hrs.
Basic Concepts: Failure and Faults, reliability and failurerate, relation between eligibility and Mean-time
Between failures, maintainability and availability, reliability of series and parallel systems,
I
Test Generation: Fault diagnosis of digital systems, Test generation for combinational logic circuits
conventional methods, Random testing, transition count testing and signature analysis.sd
Fault Tolerant Design: Basic concepts static, dynamic, Hybrid, and self-purging redundancy, shift-over
Modular Redundancy (SMR). Triple Modular redundancy, SMR. Reconfiguration, use of error correcting
codes.
II
Time redundancy, software redundancy, fail soft-operation, examples of practical fault tolerant systems,
Introduction to fault Tolerant Design of VLSI Chips.
Self Checking Circuits: Design of Totally self-checking checkers, checkers using m-out of n codes, Berger
codes and low cost residue code. Self-checking sequential Machines, partially self checking circuits.
III
Fail Safe Design: Strongly fault secure circuits, failsafe Design of sequential circuits using partition theory
and Berger codes, totally self-checking PLA design.
Design for Testable Combination Logic circuits: Basic concepts of test ability, controllability and
observability.
IV
The read-muller expansion technique, three level OR-AND-OR design, use of control logic and syndrometestable design.
Design of Testable Sequential circuits The scan-path technique level sensitive scan design (LSSD)
Random Access scan technique, built-in-test, built-in-test of VLSI chips, design for autonomous self-Test,
V
Designing Testability into logic Boards.
Total
Reference Books:
1. LALA: Digital systems design using PLDs PHI 1990.
2. N. N. Biswas: Logic Design theory, PHI 1990.
CP 411
MULTIMEDIA SYSTEMS
Unit
7
36
C(L,T,P) = 3 (3,0,0)
Total Contact
Hrs.
Introduction to Multimedia, Multimedia Information, Multimedia Objects, Multimedia in business and work.
Convergence of Computer
Communication and Entertainment products and Stages of Multimedia Projects, Multimedia hardware, Memory
& storage devices, Communication devices,
Multimedia software's, presentation tools, tools for object generations, video, sound, image capturing, authoring
tools, card and page based authoring tools
Multimedia Building Blocks Text
Sound MIDI, Digital Audio, audio file formats, MIDI under windows environment Audio & Video Capture.
Data Compression Huffman Coding, Shannon Fano Algorithm, Huffman Algorithms
Adaptive Coding, Arithmetic Coding Higher Order Modeling. Finite Context Modeling, Dictionary based
Compression, Sliding Window Compression, LZ77, LZW compression, Compression, Compression ratio loss
less & lossy compression
Speech Compression & Synthesis Digital Audio concepts
Sampling Variables, Loss less compression of sound, loss compression & silence compression.
Images: Multiple monitors, bitmaps, Vector drawing, lossy graphic compression, image file formatic animations
Images standards
JPEG Compression, Zig Zag Coding, Multimedia Database. Content based retrieval for text and images,
Video: Video representation, Colors, Video Compression, MPEG standards, MHEG Standard Video Streaming
on net, Video Conferencing, Multimedia Broadcast Services, Indexing and retrieval of Video Database, recent
development in Multimedia
Total
II
III
IV
Reference Books:
1.
2.
Ralf Steinmetz & Klara Nahrstedt - Multimedia: computing, Communication & Applications, Pearson Education Asia.
Prabhat K.Andleigh-Multimedia System Design, Prentice Hall, Iran Thaukrar.
34
CP 414
Unit
I
II
III
IV
V
EMBEDDED SYSTEMS
C(L,T,P) = 3 (3,0,0)
Overview of Embedded System: Embedded System, Categories and Requirements of Embedded Systems
Challenges and Issues in Embedded Software Development, Applications of Embedded Systems in Consumer
Electronics, Control System, Biomedical Systems, Handheld computers, Communication devices
Embedded Hardware & Software Development Environment: Hardware Architecture
Micro- Controller Architecture, Communication Interface Standards, Embedded System Development Process,
Embedded Operating systems Types of Embedded Operating systems
Design quality and Microcontroller: Quality matrix, software and hardware, Estimation
8 Bit microcontrollers Architecture, on chip peripherals, instruction set/programming of Intel MCS51 family (8
bit ) Inter facing of 8051 with LCD, ADC, sensors, stepper motor, key board, DAC, memory
Real Time & Database Applications: Real- Time Embedded Software Development, Sending a Message over a
Serial Link, Simulation of a Process Control System Controlling an Appliance from the RTLinux System,
Embedded Database Applications using examples like Salary Survey, Energy Meter Readings
Programming Languages for Embedded Systems: Tools for building embedded systems - with case studies. Microchip PIC16
family PIC16F873 processor features architecture memory organization register file map I/O ports PORTA - PORTB PORTC
Data EEPROM and flash program memory Asynchronous serial port SPI mode I2C mode
Total
Reference Books:
1 William Stallings: Embedded System (PHI, 5th Ed.)
2 James Martin: semiconductor in computer (PHI, 3rd Ed.)
CP 415
Unit
I
II
NEURAL NETWORK
Hours
6
7
8
35
C(L,T,P) = 3 (3,0,0)
Neural Networks and Fuzzy Systems: Neural and Fuzzy Machine Intelligence, Fuzziness as Multivalence, the DynamicalSystems Approach to Machine Intelligence, and Intelligent Behavior as Adaptive Model- Free Estimation. (11)
Neural Dynamics I: Activations and Signals, Neurons as Functions, Signal Monotonicity, Biological Activations and Signals,
Neuron Fields, Neuronal Dynamical Systems, Common Signal Functions, Pulse-Coded Signal Functions
Hours
6
7
Neuronal Dynamics II: Activation Models, Neuronal Dynamical Systems, Additive Neuronal Dynamics, Additive
Neuronal Feedback, Additive Bivalent Models, BAM Connection Matrices, Additive Dynamic and the Noise8
Saturation Dilemma, General Neuronal Activations: Cohen-Grossberg and Multiplicative Models
Synaptic Dynamics I: Unsupervised Learning, Learning as Encoding, Change, and Quantization, Four
Unsupervised Learning Laws, Probability Spaces and Random Processes, Stochastic Unsupervised Learning and
7
IV
Stochastic Equilibrium, Signal Hebbian Learning, Competitive Learning, Differential Hebbian Learning,
Differential Competitive Learning.
Synaptic Dynamics II: Supervised Learning, Supervised Function Estimation, Supervised Learning as Operant
Conditioning, Supervised Learning as Stochastic Pattern Learning with known Class Memberships, Supervised
7
V
Learning as stochastic Approximation, The Back propagation Algorithm.
Total
35
Reference Books:
1. An Introduction to Neural Networks, K Gurney, Routledge, 1997, Non-mathematical introduction
2. Neural Networks: A Comprehensive Foundation, S Haykin , Prentice Hall, 1999, Very comprehensive and up-to-date, but heavy in maths
3. Neural Networks for Pattern Recognition, C M Bishop, Oxford University Press, 1995
III
CP 420
Unit
I
II
III
IV
V
PARALLEL COMPUTING
C(L,T,P) = 3 (3,0,0)
SCALABILITY AND CLUSTERING: Evolution of Computer Architecture Dimensions of Scalability Parallel
Computer Models Basic Concepts Of Clustering Scalable Design Principles Parallel Programming Overview
Processes, Tasks and Threads Parallelism Issues Interaction / Communication Issues Semantic Issues In
Parallel Programs.
ENABLING TECHNOLOGIES :System Development Trends Principles of Processor Design Microprocessor
Architecture Families Hierarchical Memory Technology Cache Coherence Protocols Shared Memory
Consistency Distributed Cache Memory Architecture Latency Tolerance Techniques Multithreaded Latency
Hiding.
SYSTEM INTERCONNECTS: Basics of Interconnection Networks Network Topologies and Properties
Buses, Crossbar and Multistage Switches, Software Multithreading Synchronization Mechanisms
PARALLEL PROGRAMMING: Paradigms And Programmability Parallel Programming Models Shared
Memory Programming.
MESSAGE PASSING PROGRAMMING: Message Passing Paradigm Message Passing Interface Parallel
Virtual Machine
Total
Reference Books:
1.Kai Hwang and Zhi Wei Xu, Scalable Parallel Computing, Tata McGraw-Hill, New Delhi, 2003
Hours
6
7
6
6
32
CP 451
.NET LAB
C(L,T,P) = 2(0,0,2+2)
1.
Web Form Fundamentals
2.
The Anatomy of an Asp.Net Application, Server Controls, HTML Control
3.
Access, Page Class, Application Events, Asp.Net Configuration
4.
Web Controls Web Controls Basics, Web Control Classes, List Controls, Table Controls,
5.
Web Controls Event and auto post back
6.
State Management
7.
View State, Transferring Information between Pages, Cookies, Session State,
8.
Session State Configuration, Application State
9.
Rich Controls
10. Calendar, AdRotator, Multiple Views

11. Styles, Themes, and Master Pages
12. Style sheets, Themes, Skins, Master Pages, Content
CP 452
COMPILER LAB
C(L,T,P) = 2 (0,0,2+2)
13. Program Writing in C/C++

14.
15. 1,2 Write a Program to identify data storage statements in an 8086 assembly language program and estimate the size of data
segment.
16. 3. Write a program to identify macro definitions in an assembly language program.
17. 4,5. Extend the above program to implement simple and recursive macro expansion.
18. 6. Write a program to process include and define macro in C language.
19. 7, 8 Write a program to parse source code string of C-language and identify token in terms of keywords and identifiers.
20. 9. Construct parse tree of arithmetic statements in C language program.
21. 10. Write a program to optimize the source program for operator strength reduction, dead code elimination and frequency
reduction transformation.
22. 11, 12 Design a simple high level language containing arithmetic and logic operations pointers, branch and loop instructions.
Write its lexical analyzer using lex.
CP 453
MS & X-WINDOWS LAB
C(L,T,P) = 2 (0,0,2+2)
1. To understand x-windows, x-lib, x-toolkit and x network protocol and learn its commend line argument. Programs in C/C++ language.
2. Write a program to establish connection with x server and get the sender and protocol information.
3. Using X library of the server, write a program to create a new window of a given size, title, border, foreground and background colors.
4-5 To implement keyboard event handling/marking using x library.
6-7 To implement mouse event handling/marking using x library and interface with windows managers and drawing applications.
8. To implement a multiple windows application.
9-10 To implement various drag and drop based GUI components in Visual Basic.
11-12 To implement various drag and drop based GUI components in Motif and Lesstif.
CP 454
ADVANCE COMPUTER ARCHITECTURE LAB
C(L,T,P) = 2 (0,0,2+2)
This lab will be based on assembly programming on of RISC processor simulator SPIM. SPIM simulator is available at site
SPIM exercises
1. Read an integer from the keyboard and print it out if (n => n_min AND n <= n_max).
2. Read an integer from the keyboard and print out the following as per switch-case statement
Switch (n)
{n <= 10 print "not a lot"
n == 12 print "a dozen"
n == 13 print "a baker's dozen"
n == 20 print "a score"
n >= 100 print "lots and lots"

n! = 42 print "integer"
otherwise print "you have the answer!}
3. Read a string from the keyboard and count the number of letters. Use the equivalent of following for loop to count number of chars.
for (s1=0; str [s1] != '\n'; ++s1)
4. Print out a line of characters using simple procedure call.
5. Print out a triangle of characters using recursive procedure call.
6. Print factorial of a number using recursion.
7. Print reverse string after reading from keyboard.
8. Print a string after swapping case of each letter.
9. Print an integer in binary and hex.
10. Implement bubble sort algorithm.
11. Print Pascal Triangle of base size 12.
12. Evaluate and print Ackerman function.
13. Write a Program onOPEMP implantation
14. WAP on thread synchronization
15. WAP on Simple Pipelining
16. Program on Hyper Quick Sort
17. Program on Timing Routines
18. Program on Lock Routines
CP 456
1.
2.
3.
4.
5.
6.
7.
8.
EC 213
Unit
NETWORK SYSTEM SECURITY LAB LAB
C(L,T,P) = 1 (0,0,2)
Write a Program in C++ to encrypt & decrypt a text message using stream cipher.
Write a Program in C++ to encrypt & decrypt a text message using block cipher.
Write a Program in C++ to encrypt & decrypt a text/document file.
Write a Program in C++ to implement fiestel Cipher model.
Write a Program in C++ to implement Diffie- Hellman Key Exchange.
Write a Program in C++ to implement Hashing Techniques.
Write a Program in C++ to implement RSA Algorithm.
Write a Program in C++ to implement enveloping of keys
MEDICAL ELECTRONICS
C(L,T,P) = 3 (3,0,0)
Introduction of Human Physiology: Nerve physiology. Functions of nerves and myoneural junctions.
Membranae and action potential of nerves. Function of skeletal and smooth muscle and its rhythmic
I
contraction, cardiac muscle. Blood flow system, Arterial pressure Mechanism of respiration. COMPUTER
NETWORK S function of spinal cord and cord reflexes. Myo-electrical control of paralyzed muscles.
ECG, EMG and EEG: Principle & Means of recording non-electrical biological parameters. Signals from
micro-electrodes and slat bridge Use of field electric devices as electrometers,driven shield,photon coupled
II
amplifier. Artifacts
Measurement of biological events : Electronic methods of measuring blood pressure, skin & systemic body
III
temperature Pulse rate and coronary care monitoring.
Biomedical Instruments: Electronic pace makers. Implantable power source. Defibrillators. Micro power
transmitter for telemeter binominals. Special characteristics of CRO in bio-medical applications Surgical
IV
and therapeutic diathermy units. Physiological simulators. Basic diagnostic X-ray units. Introduction to
patient monitoring and intensive care unit. Interference and patient safety. Anaesthetic explosion and fires.
Miscellaneous : Introduction to heart Lung machines, CT scanners Ultrasound sonography and Doppler
V
measurements, NMR & PET Scans. Use of lasers in medical applications.
Total
Reference Books:
1. Webster, J.G.: Medical Instrumentation, Application and Design, John Willey and Sons.
2. Jacobson, B.Wester, J.G.: Medical and Clinical Engineering Prentice Hall, International.
3. Cromwell: Biometical Instrumentation and Measurements.et al. Prentice Hall, International.
4. R.S. Khandipur: Handbook of Biomeideal Instrumentation. Tata McGraw Hill.
5. Carr: Introduction to Biomedical Equipmens, Pearson Education.
Hours
8
7
7
6
34
EC 215 : SWITCHING THEORY AND LOGIC DESIGN

Unit
C(L,T,P) = 3 (3,0,0)
Total
Contact
Hrs.
Number systems, Coding Schemes: BCD, Excess-3, Grey, r's and (r-l)s complement. Boolean Algebra,
Fundamental theorems, Simplifications of Boolean expressions
Logic gates and their truth table. Gate implementation and Truth table of Boolean functions.
Standard forms of Boolean functions. Minterm and Maxterm designation of functions. Simplification of
functions on Karnaugh maps
Incompletely specified functions. Cubical representation of Boolean functions and determination of prime
implicants
II
Selection of an optimal set of prime implicants. Multiple output circuits and map minimization of multiple
output circuits
Tabular determination of multiple output prime implicants.
Combinational circuits Adder, subtractor, encoder, coder
III
Multiplexer. Design of Combinational circuit using Multiplexers.
Multiplexer. Design of Combinational circuit using Multiplexers. Flip Flops: RS, J-K, D, T. Sequential
circuits. Clock, pulse and level mode sequential circuits Analysis and design of sequential circuits
Synthesis of state diagrams, Finite memory circuits, equivalence relations equivalent states and circuits
IV
Determination of classes of indistinguishable states and simplification by implicants tables. Mealy and Moore
machines
State assignment and memory element input equations, Partitioning and state assignment.
Switching Devices. Positive and Negative logic of OR, AND, NOR, NAND, XOR and XNOR gates
Logic Family: RTL, DTL, DCTL, TTL, RCTL, ECL, HTL, MOS and CMOS logic circuit. Speed and delay in
V
logic circuits, integrated circuit logic and noise immunity
Total
Reference Books:
1. Sandiege: Modern Digital Design, McGraw Hill.
2. Moris Mano :Digital Design, PHI
3. H, Taub, D.Schilling :Digital Integrated Electronics, McGraw Hill
4. Hill & Peterson :Switching Theory and Logic Design, John Wiley
5. Parag K. Lala: Practical Digital Logic Design & Testing Prentice Hall of India.
I
EC 216
Unit
TELECOM ENGG. FUNDAMENTALS
6
33
C(L,T,P) = 4 (3,1,0)
INTRODUCTION :- Electromagnetic Spectrum, Frequency Spectrum-Bandwidth-Allocation, Time domain

and Frequency domain analysis
TRANSMISSION MEDIA:- Twisted pair, UTP cables, Coaxial and optical fiber cables, wireless, microwave
I
and satellite transmission
DATA TRANSMISSION: - Transmission impairments. Serial and parallel transmission, Simplex, half duplex
or full duplex transmission mode.
DATA ENCODING :- Modulation (ASK, FSK and PSK, PCM, PAM, Delta Modulations), Line coding (NRZL, NRZI , Bipolar AMI, Manchester and differential Manchester),
II
MULTIPLEXING:- FDM, Synchronous and Statistical TDM
DATA LINK LAYER: Channel allocation problem, pure and slotted ALOHA Protocols, Persisted And NonPersisted CSMA Collision Free Protocols, Digital Cellular Radio and CDMA
Logical Link Sub Layer, MAC Sub layer.
III
Brief Introduction: Frame Relay, PPP
PROTOCOL :- OSI & TCP/IP Protocol Architecture
SWITCHING NETWORKS: Circuit switching Networks, Space and Time division switching, Routing circuit
switched networks, control signaling packet switching principles, fixed, flooding and adaptive routing strategies:
IV
X.25 & X.28 protocols Brief introduction: ISDN,ADSL
NETWORK DEVICES: Gateway, Router, Bridge, Switch, Hub, Repeater, Multilayer Switch, Protocol
Converter, Router, Proxy, Firewall, Multiplexer, Network Card, Modem.
V
NETWORK TECHNOLOGY: DSL, GSM, Bluetooth, Infrared.
Total
Reference Books:
1. William Stallings: Data and Computer Communications (PHI, 5 th Ed.)
2. James Martin: Telecommunication and the Computer (PHI, 3rd Ed.)
Total
Contact
Hrs.
7
35
EC 217 : ELECTRONIC DEVICES & CIRCUITS
Unit
C(L,T,P) = 4 (3,1,0)
Total Contact
Hrs.
Diode circuits: Diode as a circuit. Element, load line concept

Clipping & clamping circuits, voltages multipliers.
Devices: construction, characteristics and working principles of the following devices. Diodes BJT, JFET,
MOSFET, UJT, photo diodes, LEDs, photo transistorsSolar cells. Thermistor, LDR
Transistors: transistor characteristics, current components, current gains. Alpha and vita operating point.
High bride model, h- parameter equivalent circuits
CE, CB and Cc configuration Dc and ac analysis of CE, CC and CB amplifiers
Evers- moll model. Biasing and stabilization techniques. Thermal run away, thermal stability. Equivalent
circuits and blessing of JFETs and MOSFETs
Low frequency CS and CD JFET amplifiers. FET as a voltage variable resistor.
Small signal amplifiers at low frequency: analysis of BJT and FET, dc and rc coupled amplifiers Frequency
response
Midband gain, gains at low and high frequency. Analysis of dc and differential amplifiers, Millers theorem
Cascading transistor amplifiers, Darlington and cascaded circuits. Emitter and source followers.
Oscillators: concept of feedback classification, criterion for oscillation. Tuned collector, Hartley Colpitts
Rc- phase shift, Wein bridge and crystal oscillators, astable, monostable and bistable multivibrators.
Schmitt trigger
Total
I
II
III
IV
8
7
6
34
Reference Books:
1. J.Millman & C.C. Halkias :Integrated Electronics, McGraw Hill
2. Millman Grabel: Microelectronics, McGraw Hill.
EC 222
MICROPROCESSOR AND INTERFACES
Unit
C(L,T,P) = 4 (3,1,0)

Introduction to Micro Computer Systems: Microprocessors, microcontroller and microcomputer devices
Machine and assembly language, Bus concept. Architecture & Pinout of 8085A
Assembly Language and Programming in 8085: Instruction set, Program structures (sequential,
conditional, (iterative)
Macros and subroutines, Stack, Counter and timing delay, interrupt structure and its programming
Peripherals and their interfacing with 8085-I: Memory Interfacing, Interfacing I/O ports
Data transfer schemes (Synchronous, asynchronous, interrupt driven), Architecture & interfacing of PPI
8255, Data Converters and Timer 8254
Peripherals and their interfacing with 8085-II:
Architecture & interfacing of- DMA controller 8257,
interrupt Controller 8259A, USART 8251, Level Converters MC 1488 and MC 1489
Current loop, RS 232 C and RS 422 A
Comparative study of 8085 A, 8086 and 8088 (Pinout, internal architecture, timing diagrams)
Instruction format and addressing modes Data and Branch related. Features of Pentium processor, MMX
and Dual core processor
Total
I
II
III
IV
Reference Books:
1.
2.
3.
4.
5.
6.
Gaonkar-8085 Programming, Penram Press.

A.P. Mathur-Introduction to Microprocessors, Tata Mc-Graw-Hill.
Antanakos-Introduction to Intel Family Microprocessors, Pearson Education.
Gilmore-Microprocessors Principles and Applications, Tata Mc-Graw Hill.
B.Ram-Fundamentals of Microprocessors & Micro Computers, Dhanpat Rai Pub.
Ray and Bhurchandi-Intel Microprocessors, Tata-Mc-Graw Hill.
Total Contact
Hrs.
6
7
7
35
EC 253
S.
No.
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
ELECTRONIC DEVICES & CIRCUITS LAB
C(L,T,P) = 1 (0,0,2)
List of Experiments
Study the following devices:
(a) Analog & digital multimeters
(b) Function/ Signal generators
(c) Regulated d. c. power supplies (constant voltage and constant current operations)
(d) Study of analog CRO, measurement of time period, amplitude, frequency & phase angle using Lissajous figures.
Plot V-I characteristic of P-N junction diode & calculate cut-in voltage, reverse saturation current and static & dynamic
resistances.
Plot V-I characteristic of zener diode and study of zener diode as voltage regulator. Observe the effect of load changes and
determine load limits of the voltage regulator.
Plot frequency response curve for single stage amplifier and to determine gain bandwidth product.
Plot drain current - drain voltage and drain current gate bias characteristics of field effect transistor and measure of Idss & Vp
Application of Diode as clipper & clamper
Plot gain- frequency characteristic of two stage RC coupled amplifier & calculate its bandwidth and compare it with theoretical
value.
Plot gain- frequency characteristic of emitter follower & find out its input and output resistances.
Plot input and output characteristics of BJT in CB, CC and CE configurations. Find their hparameters.
Study half wave rectifier and effect of filters on wave. Also calculate theoretical & practical ripple factor.
Study bridge rectifier and measure the effect of filter network on D.C. voltage output & ripple factor.
EC 259 DIGITAL ELECTRONICS LAB
C(L,T,P) = 1 (0,0,2)
1. Experimental study of characteristics of CMOS integrated circuits.

2. Interfacing of CMOS to TTL and CMOS.
3. Study of various combinatorial circuits based on: AND/NAND Logic blocks and OR/NOR Logic blocks.
4. Study of following combinational circuits: Multiplexer; Demultiplexer and Encoder. Verify truth tables of various logic functions.
5. To study various waveforms at different points of transistor bistable multivibrators and its frequency variation with different parameters.
6. To study transistor astable multivibrators.
7. To design a frequency driver using IC-555/timer.
8. To study Schmitt trigger circuit.
9. To study OP-AMP as Current to voltage and voltage to current converter comparator.
10. BCD to binary conversion on digital/IC trainer.
11. Study various Flip flops and construct Parallel-in-Serial-out register. Testing of digital IC by automatic digital IC trainer.
EC 312
Unit
INTRODUCTION TO WIRELESS NETWORK
C(L,T,P) = 3 (3,0,0)
Total
Contact Hrs.
MULTIPLE ACCESS TECHNIQUES FOR WIRELESS COMMUNICATION : Introduction, FDMA, TDMA,

Spread Spectrum, Multiple access, SDMA, Packet radio, Packet radio protocols, CSMA protocols, Reservation
protocols
II
INTRODUCTION TO WIRELESS NETWORKING : Introduction, Difference between wireless and fixed

telephone networks, Development of wireless networks, Traffic routing in wireless networks.
III
WIRELESS DATA SERVICES : CDPD, ARDIS, RMD, Common channel signaling, ISDN, BISDN and ATM,
SS7, SS7 user part, signaling traffic in SS7.
IV
MOBILE IP AND WIRELESS ACCESS PROTOCOL : Mobile IP Operation of mobile IP, Co-located address,
Registration, Tunneling, WAP Architecture, overview, WML scripts, WAP service, WAP session protocol,
wireless transaction, Wireless datagram protocol.
WIRELESS LAN TECHNOLOGY & BLUE TOOTH :: Infrared LANs, Spread spectrum LANs, Narrow bank
microwave LANs, IEEE 802 protocol Architecture, IEEE802 architecture and services, 802.11 medium access
control, 802.11 physical layer.BLUE TOOTH : Overview, Radio specification, Base band specification, Links
manager specification, Logical link control and adaptation protocol. Introduction to WLL Technology.
Total
Reference Books:
1. Wireless Digital Communications Kamilo Feher, PHI, 1999.
2. Principles of Wireless Networks Kaveh Pah Laven and P. Krishna Murthy, Pearson Education, 2002.
3. Wireless Communications Andreaws F. Molisch, Wiley India, 2006.
4. Introduction to Wireless and Mobile Systems Dharma Prakash Agarwal, Qing-An Zeng, Thomson 2nd Edition, 2006.
7
33
EC 355
MICROPROCESSORS LAB
C(L,T,P) = 2 (0,0,2+2)
1. Study of hardware, functions, memory, and operations of 8085 kit.

2. Program to perform integer addition (two and three numbers 8 bit)
3. Program to perform multiplication (two 8 bit numbers).
4. Program to perform division (two 8 bit numbers).
5. Transfer of a block data in memory to another place in memory in forward and
reverse order.
6. Swapping of two block data in memory.
7. Addition of 10 numbers using array.
8. Searching a number in an array.
9. Sorting of array (ascending, descending order).
10. Print Fibonacci sequence. (15 elements)
11. To insert a number at correct place in a sorted array.
12. Interfacing seven segment display using 8255.
EC 417
Unit
LOGIC SYNTHESIS
C(L,T,P) = 4 (3,1,0)

Introduction to VLSI, circuits Asics and Moore's Law. Microelectronic Design, Styles, four phases in creating
Microelectronics chips computer Aided Synthesis and Optimization. Algorithms Review of Graph Definitions
and Notations Decision and Optimization Problems, Shortest and Longest Path Problems, Vertex Cover,
I
Graph, Coloring, Clique covering and partitioning Algorithms Boolean Algebra and Representation of
Boolean Functions, binary Decision diagrams. Satisfiability and cover problems
Hardware Modeling: Introduction to Hardware Modeling Language, State Diagrams. Data flow and
Sequencing Graphs. Compilation and Behavioral Optimization Techniques. Circuits Specifications for
Architectural Synthesis Resources and constraints. Fundamental Architectural Synthesis Problems Temporal
II
Domain Scheduling Spatial Domain Binding Hierarchical Models and Synchronization Problem. Area and
performance estimation-Resource Dominated circuits and General Circuits.
Scheduling Algorithms: Model for Scheduling Problems, Scheduling without Resource ConstraintsUnconstrained Scheduling ASAP Scheduling Algorithms Latency. Constrained Scheduling. ALAP scheduling.
Under Timing Constraints and Relative Scheduling with Resource Constraints Integer Linear Programming
III
Model, Multiprocessor Scheduling, Heuristic Scheduling Algorithms (List Scheduling). Force Directed
Scheduling
Two Level Combination Logic Optimization: Logic Optimization Principles-Definitions Exact Logic
Minimization Heuristic, Logic Minimization, and Testability Properties Operations on Two level logic CoverIV
positional Cube Notation Functions with Multivolume inputs and list oriented manipulation. Algorithms for
logic minimization
Sequential logic optimization: Introduction, Sequential circuit optimization using state based models- state
minimization, state encoding. Sequential circuit optimization using network models. Implicit finite state
V
machine traversal methods. Testability consideration for synchronous circuits
Total
Reference Books:
1. Giovanni De Micheli-Synthesis and Optimization of Digital Circuits, Mc-Graw Hill Inc.
2. Zainalabedin Navabi-VHDL Analysis and Modeling of Digital Systems, Mc-Graw Hill Inc.
3. J.Bhasker-VHDL Primer, Addision Wesley.
4. Brassard-Algorithms, Prentice Hall.
Hours
7
33
EC 418
CAD FOR VLSI DESIGN
C(L,T,P) = 3 (3,0,0)
Unit

Modern digital systems, complexity and diversity of digital systems Productivity gap and need for CAD
I
tools. introduction to steps and CAD flow for designing with ASIC and FPGA
Introduction to VHDL, background, VHDL requirement, Elements of VHDL, top down design, convention
and syntax, basic concepts in VHDL i.e. characterizing H/W languages, objects, classes, and signal
II
assignments
Structural specification of H/W- Parts library, Wiring, modeling, binding alternatives, top down wiring.
III
Design organization and parameterization. Type declaration, VHDL operators
VHDL subprogram parameters, overloading, predefined attributes, user defined attributes, packaging basic
utilities. VHDL as a modeling language- bi-directional component modeling, multi mode component
IV
modeling
Examples of VHDL synthesis subsets- combinational logic synthesis, sequential circuit synthesis,
State machine synthesis. VHDL language grammar. Introduction to synthetic circuits and circuit
V
repositories
Total
Reference Books:
1. Wayne Wolf-Modern VLSI Design,3rd ed Pearson Education Asia.
2. Kiat-Sent Yeo-CMOS/BiCCMOSVLSI,Pearson Education Asia.
3. Neil H.E. Weste-Principles of CMOS VLSI Design, Pearson Education Asia.
EC 419
Unit
SIGNAL AND SYSTEM
6
7
7
7
8
35
C(L,T,P) = 3 (3,0,0)
Total Contact
Hrs.
Flow Graph and Matrix Representation of Digital Filters: Signal flow graph representation of digital
network, matrix representation
I
basic network structures for IIR and FIR systems
Tellegens theorem for digital filters and its applications
Digital filter Design Techniques: Design of IIR and FIR digital filters
II
Computer aided design of IIR and FIR filters, comparison of IIR and FIR digital filters.
Computation of the Discrete Fourier Transform: Goertzel algorithm
FT algorithms, decimation in time and frequency, FFFT algorithm for N a composite number, Chirp Z
III
transforms (CZT)
Discrete Random Signals: Discrete time random process
IV
averages spectrum representations of infinite energy signals, response of linear system to random signals
Power Spectrum Estimation: Basic principles of spectrum estimation, estimates of the auto covariance,
V
power spectrum, cross covariance and cross spectrum.
Total
Reference Books
1. L Philips, J. M. Parr, E. A Riskin, Signals, Systems and Transforms, 3rd ed., Pearson Education, Delhi,
2. R. E. Zeimer, W. H. Tranter, and D. R. Fannin, Signals and Systems: Continuous and Discrete, 4th ,
3. M. J. Roberts, Signals and Systems: Analysis using Transform methods and MATLAB, Tata McGraw Hill,
EC 458
Hours
VLSI DESIGN LAB
C(L,T,P) = 1 (0,0,2)
Simple Design exercises:

1. Half adder, Full adder, Subtractor Flip Flops, 4bit comparator.
2. Parity generator
3. Bit up/down counter with load able count
4. Decoder and encoder
5. 8 bit shift register
6. 8:1 multiplexer
7. Test bench for a full adder
8. Barrel shifter
9. N by m binary multiplier
10. RISC CPU (3bit opcode, 5bit address)
TOOLS:
Xilinx Tools/ Synopsis Tools/ Cadence Tools/ Model SIM/ Leonardo Spectrum Tools/VIS/SIS Tools to be used.
7
7
7
8
35
BM 203
Unit
I
II
III
IV
V
C (L, T, P) = 4 (4, 0, 0)
Course Contents
Introduction to HRM: Concept, Nature & Scope, HRM vs. Personnel Management, Objectives, Functions
Human Resource Planning: Process & Objectives, Methods of Manpower Search, Job Analysis and
Design, Recruitment & Selection
Management and Development of HR: Concept & Steps of Training, Process of Executive
Development, Performance Appraisal Meaning & Benefits
Compensation Management: Elements of Compensation, Factors affecting Compensation, Fringe
Benefits, Time Wage and Piece Wage System
Employee Relations: Industrial Disputes Concept & Causes, Trade Unionism Meaning &
Objectives, Collective Bargaining Need & Importance, Workers Participation Concept &
Evaluation
Total
Hours
6
8
8
7
7
36
Books Recommended
1. Gary Dessler Human Resource Management
2. Pareek U. & T.V Rao Designing & Managing Human Resource Systems
3. Ashwathappa Human Resource Management
BM 302 Entrepreneurship and Small Scale Business Management C (L, T, P) = 4 (4, 0, 0)

Unit
I
Course Contents
Introduction: Definition, meaning, importance and relevance types & characteristics and classification of
entrepreneurship, identification of business barriers to entrepreneurship. Opportunities, environment scanning in
rough 7 Domains of market attractiveness & porters 5-forcus model
Needs, Tools techniques: For market assessment & survey, entrepreneurship motivations & environment
innovations & creativity.
Business plan writing, scope, type, process of identifying target market, survey industry & competition analysis.
Entrepreneurship development program: Objectives, Programs of EDP, Entrepreneurial development cause
Relevance & Accruements or EDP
Small business management: Starting up a new business venture, Scope of fund raising to start up a new venture.
Total
Books Recommended:
1. Jain P.C handbook for New Entrepreneurs: Oxford University Press
2. Drucker Peter F: Innovation & Entrepreneur
3. Lalitha D Rani : Women Entrepreneur. APH Publishing Corporation
II
III
IV
V
BM 504
Unit
I
II
III
IV
Hours
7
7
6
6
6
32
C (L, T, P) = 4 (4, 0, 0)
Course Contents
Operation Research: Operation management - introduction. Operation research and operation strategy, forecasting
demand and linear regression, transportation and assignment problems, allocation of resources
Production Management: Nature and scope of production management - process planning and design facility
location; types of manufacturing systems & layouts; layout planning and analysis material handling - principalsequipments, line balancing-problems operations decisions-production planning and control - in mass production in
batch/job order manufacturing.
Facilities Planning: Capacity planning - models, process planning - aggregate planning - scheduling maintenance
management concepts - work study, method study, work measurement, work sampling work environment-industrial
safety; computer aided manufacturing (CAM), artificial intelligence & expert systems.
Material Management: Material management - an overview, production control, storage and retrieval system.
Inventory control - JIT .Network techniques simulation, EOQ, EOQ problems with shortage, allowed,
standardization, and waste management.
TQM and Project Management: Concept of total quality (TQ). International quality certification and other
standards and their applicability in design manufacturing humanistic and marketing aspects of TQ. Total quality of
services. Total quality and safety. ERP and business process engineering maintenance management, project
management-PERT & CPM.
Total
Reference/Text Books:
S.N. Chery - Production and Operation Management
E. E. Adams Production and Operation Management
Hours
6
8
35
MA 203 : ADVANCE MATHEMATICS
Unit
C(L,T,P) = 4 (3,1,0)

Linear Programming: Mathematical Formulation of Linear Programming problem. Graphical method of
solving Linear Programming problem
Simplex method for solving Linear Programming problem
Duality in Linear Programming problem.
Project Scheduling: Project Scheduling by PERT and CPM Network Analysis.
Sequencing Theory: General Sequencing problem
N-jobs through 2 machines & 3 machines and 2-jobs through m machine.
Transportation Problem
Find the initial solution using North West Corner rule, Least Cost Method.
Find optimal solution using Stepping Stone method, Modified Distribution Method.
Solve unbalanced transportation problem using fictitious origins or destination.
Assignment problem Solving Assignment problem using Hungarian Method
Transform Calculus Laplace transform with its simple properties, Applications to the solution of ordinary
and partial differential equation having constant coefficients with special reference to the wave and diffusion
equation
Numerical Methods:- Finite differences and Interpolation , Numerical differentiation and Integration
.Solution of Algebraic and transcedual equations by Graphical method, Bisection method ,Regular Falsi
method and Newtons Raphson method .Numerical solution of ordinary differential equations
Total
II
III
IV
Total Contact
Hrs.
7
8
37
Reference Books:
Advanced Mathematics for Engineers by Chandrika Prasad
Higher Engineering Mathematics by B.S. Grewal
Higher Engineering Mathematics by Y.N. Gaur and C.L. Koul
Higher Engineering Mathematics by K.C. Jain and M.L. Rawat
MA 204
Unit
II
III
IV
V
STATISTICAL PROBABILITY & THEORY
C(L,T,P) = 4 (3,1,0)

Introduction & Discrete random variables
Sample space, Events, Algebra of events, Bernoulli Trials. Probability & Bayes theorem. Random
variables & their event space, Probability generating function, expectations, moments, computations of
mean time to failure. Bernoulli & Poisson Processes
Discrete & continuous distributions: Probability distribution & Probability densities: Binomial, Poisson,
normal,rectangular and exponential distribution & their PDFs, moments and MGFs for above
distributions
Correlation & Regression Correlation & regression: Linear regression, Rank correlation, Method of
least squares, Fitting of straight lines & second degree parabola. Normal regression and correlation analysis
Queuing Theory: Pure birth, Pure Death and Birth-Death Processes. Mathematical Models for M/M/I,
M/M/N, M/M/S and M/M/S/N queues.
Game Theory: Minimax & Maximum Strategies, Application of liner programming (Graphical Method)
Total
Reference Books:
1. K.S.Trivedi :Probability & Statistics with RELIABILITY Queuing and Computer Science Application (PHI)
2. J.E. Frend & R.E. Walpole :Mathematical Statistics
3. Taha :Operational Research
4. Kapoor & Saxena :Statistics & Probability
5. Gokhroo et al. : Advanced Engg. Statistics (4CP1)
Total Contact
Hrs.
6
7
7
7
8
35
HS 201 COMMUNICATION SKILLS
Unit
1
C(L,T,P)=3(3,0,0)
Course Contents
Foundation and background of organizational behaviour, contemporary challenges-workforce
diversity, cross cultural dynamics, changing nature of managerial work, ethical issues at work,
emotional intelligence in contemporary business. Perception, Personality, Learning, Motivation
Concepts and applications, individual decision making.
Understanding and managing group processes-interpersonal & group dynamics, Group
cohesiveness, Group decision making Emotional Intelligence-concept and applications,
Understanding work teams, power & politics, Empowerment, Conflict & Negotiation.
Purpose and process of communication; myths and realities of communication; paths of
communication; oral communication; noise, barriers to communication; listening process, types
of listening, deterrents to listening process, essentials of good listening; telephonic
communication.
Non verbal communication; gestures, handshakes, gazes, smiles, hand movements, styles of
working, voice modulations, body sport for interviews; business etiquettes; business dining,
business manners of people of different cultures, managing customer care.
Written communication; mechanics of writing, report writing, circulars, notices, memos, agenda
and minutes; business correspondence-business letter format, style of letter arrangement, types
of letters, telex managers, facsimiles, electronic mail; diary writing; development resume.
Total
Hours
7
35
Reference Books:
1. Enrich your English by CIEFL (Academic Skills book)
2. Contemporary English Grammar Raymond Murphy
3. Organizational Behavior, - Fred Luthans9thEdition, McGraw-Hill Irwin, 2002.
4. Organizational Behavior, Tenth Edition, TMG, 1998.John W. Newstorm and Keith Davis
5. Business Communication Today By Bovee, Thill, Schazman
6. G. Business Communication by Pal and Korlahalli
HS202
Units
1
2
3
4
CONGNITIVE SKILLS
C(L,T,P)=3(3,0,0)
Contents of the Subject

Introduction to Mindfulness, Mindfulness Exercise, DBT Life Skills Distress Tolerance
Mindfulness Exercise, DBT Life Skills Emotion Regulation
Mindfulness Exercise, DBT Life Skills Interpersonal Effectiveness
Mindfulness Exercise, Anxiety Disorders, Depression, and Personality Disorders, Acceptance:
Living in the Here-and-Now as a Way of Life
Hours
8
8
7
7
7
Total
Reference Books:
1. Shivani D.R. (1998): NGO Development Initiative & Policy Vikas Publications
HS301
Units
1
2
3
4
5
VERBAL & NON-VERBAL REASONING
C(L,T,P)=3(3,0,0)
Course Contents
Logical Sequence of Words, Blood Relation Test, Syllogism
Series Completion, Cause and Effect, Dice
Venn Diagrams, Cube and Cuboids Analogy
Seating Arrangement, Character Puzzles, Direction Sense Test
Classification, Data Sufficiency, Arithmetic Reasoning, Verification of Truth
Total
Reference Books:
Reasoning by R.S. Aggarwal
Hours
7
7
7
7
7
35
37
HS302
Units
1
2
3
4
5
C(L,T,P) = 3(3,0,0)
Course Contents
Writing Process- Intro of various types of writings, Gathering, Writing, Reviewing, Editing,
Indexing, Testing
Review Writing- Internal, Friendly and Anonymous reviews, Quantity review, Quality review,
Precis Wring, Paragraph Writing, Report Writing- Science and research reports, business
Reports, Business Report, Business overview
Letter Writing- Letter of Inquiry, Letter of adjustment, Claim Letter and follow of Letter, Letter
of acceptance, Letter of refusal
Job search correspondence- cover letter, CV and resume
Writing Mails- User Guides, Reference Guide, Online helps, Website, Technical Proposal
Writing.
Total
HS 401
Units
1
2
3
4
5
EMPLOYABILITY SKILLSIV: TECHNICAL WRITING
TECHNICAL APTITUDE
7
7
7
35
C(LTP)=3(3,0,0)
Course Contents
PPL (Principal of Programming Language, C, C++, Java, Asp.net, DSA
DBMS, RDBMS
Networking & Related topics
Software Engineering and Related topics
Operating System (Windows, Linux, MS office)
Total
Reference Books:
MCQs in Computer Science by Timothy Williams, TMH
Hours
7
Hours
7
7
8
7
7
36

B. Tech. CSE PDF

Uploaded by

Copyright:

Available Formats

B. Tech. CSE PDF

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

B. Tech. CSE PDF

Uploaded by

Copyright:

Available Formats

GYAN VIHAR SCHOOL OF ENGINEERING AND TECHNOLOGY

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

GYAN VIHAR SCHOOL OF ENGINEERING AND TECHNOLOGY

GYAN VIHAR SCHOOL OF ENGINEERING AND TECHNOLOGY

GYAN VIHAR SCHOOL OF ENGINEERING AND TECHNOLOGY

Data Structure & Algorithms

Principles of Programming Language

Management Information System

Data Structure & Algorithms Lab

Software Engineering Lab

Database Management System

Discrete mathematical Structure

Design Analysis & Algorithm

Logical & Functional Programming

System soft ware Engineering

Advance Data Structure

Data Mining & dataq warehusing

Computer Graphics lab

Computer Architecture lab

COMPUTER NETWORK Lab

Web Programming Lab

System software Lab

Network Securtiy System

Aysnchronous Transfer Mode Networks

Advance Computer Architectures

Real Time Systems

Fault Tolerant System

Advance Computer Architecture Lab

NETWORK SYSTEM SECURITY LAB

Switching Theory & Logic Design

Telecom Engg. Fundamentals

Electronic Devices & Circuits

Solar power Computers

Microprocessor & Interface

Electronic Devices & Circuits Lab

Digital Electronics Lab

Introduction to wireless Network

CAD for VLSI DESIGN

Signal & System

VLSI Design Lab

Human Resource Management

Entrepreneurship & small scale Business

Statistical Probability & Theory

Verbal and non-Verbal Reasoning

Major Project (Stage -I )

Major Project (Stage -II )

Discipline and Extra Curricular Activities III

Discipline and Extra Curricular Activities IV

Discipline and Extra Curricular Activities V

Discipline and Extra Curricular Activities VI

Discipline and Extra Curricular Activities VII

Discipline and Extra Curricular Activities VIII

CP 201 : DATA STRUCTURES AND ALGORITHMS

PRINCIPLES OF PROGRAMMING LANGUAGE

Contents of the Course

OPEN SOURCE TECHNOLOGY

PATTERN RECOGNITION & LEARNING

CP 251 DATA STRUCTURE AND ALGORITHM LAB

1. Programs based on inheritance property.