w.e.f.

July 2010
Bachelor of Technology- Computer Engineering, Computer Science & Engineering, Bachelor of Technology -Master of Technology (B. TechM. Tech) and Bachelor of Technology- Master of Business Administration (B. Tech-MBA) in Computer Engineering and Computer Science &
Engineering- 5 Year Integrated: Scheme and Syllabi

CO 301

Automata Theory

L
4

T
1

P
-

C
4.5

Objective: To provide an understanding of the theoretical development of computer science,

particularly for finite representation of languages and machines

Unit 1
Finite Automata and Regular Expression: Finite State System, Basic Definition Non-Deterministic finite
Automata (NDFA), Deterministic finite Automata (DFA), Equivalence of DFA and NDFA Finite
Automata with E-moves, Regular expression, Equivalence of finite Automata and expression, Regular
expression conversion and vice-versa.
Unit 2
Introduction to Machines: Concept of basic machines, Properties and limitations of FSM, Moore and
Mealy Machines, Equivalence of Moore and Mealy Machines, Conversion of NFA and DFA by Ardens
method.
Properties of Regular sets: The Pumping Lemma for regular sets, Application of the pumping Lemma,
Closure Properties of regular sets, Myhill-Nerode Theorem and minimization of Finite Automata,
Minimization Algorithm.
Unit 3
Grammars: Definition, Context free and Context sensitive Grammar, Ambiguity regular grammar,
Reduced forms, Removal of useless symbols and unit production, Chomsky Normal Form (CNF),
Griebach Normal Form (GNF).
Pushdown Automata: Introduction to push-down machines, Application of push down machines.
Unit 4
Turing Machines, Deterministic and No-Deterministic Turing Machines, Design of T.M, Halting
Problem of T.M., PCP problem.
Chomsky Hierarchy: Chomsky hierarchies of grammars, unrestricted grammar, Context sensitive
Language, Relation between languages of classes.
Computability: Basic Concepts, Primitive Recursive functions.
Note: Eight questions will be set by the examiners taking at least two questions from each unit.
Students will be required to attempt five questions in all; at least one from each unit.
Books
1. John C. Martin: Introduction to Languages and the Theory of Computation, MGH.
2. Lewis & Papadimitriou: Elements of the Theory of Computation, PHI.
3. Daniel I.A. Cohen: Introduction to Computer Theory: John Wiley.
4. J.E. Hopcroft and J.D. Ullman: Introduction to Automata Theory Languages and Computation,
Narosa.
5. Introduction to Automata Theory, languages & computations Hopcroaft & O. D. Ullman,
R.Motwani.
6. Theory of Computer Sc. (Automata, Language & Computation): K.L.P.Mishra & N.Chandershekaran.
7. Introduction to formal language & Automata Peter Linz.

17

w.e.f. July 2010

Bachelor of Technology- Computer Engineering, Computer Science & Engineering, Bachelor of Technology -Master of Technology (B. TechM. Tech) and Bachelor of Technology- Master of Business Administration (B. Tech-MBA) in Computer Engineering and Computer Science &
Engineering- 5 Year Integrated: Scheme and Syllabi

CO 303

Analysis and Design of Algorithms

L
4

T
1

P
-

C
4.5

Objective: To familiarize students with the design strategies and bounds on the performance

of different computer algorithms.

Unit 1
Review of elementary data structures, analyzing algorithms, asymptotic notation, recurrence relations,
Hash tables, Binary search trees.
Heapsort, Priority queues, sorting in linear time, median and order statistics, dynamic order statistics.
Unit 2
Dynamic programming - Elements, Matrix-chain multiplication, longest common subsequence, Greedy
algorithms Elements, activity-selection problem, Huffman codes, task scheduling problem, Knapsack
problems, Divide & Conquer strategy.
Advanced Data Structures: Operations in B- Trees, Binomial heaps, Fibonacci heaps, data structures for
disjoint sets, strings.
Unit 3
Review of graph algorithms, topological sort, strongly connected components, minimum spanning trees Kruskal and Prim's, Single source shortest paths, Dijkstra's algorithm, Bellman-Ford algorithm, single
source shortest paths for directed acyclic graphs, difference constraints and shortest paths, All pairs
shortest paths - shortest paths and matrix multiplication, Floyd-Warshall algorithm.
Unit 4
Flow networks, Ford-Fulkerson method, Maximum bipartite matching, Sorting Networks, Comparison
network, the zero-one principle, Bitonic sorting network, merging network.
Note: Eight questions will be set by the examiners taking at least two questions from each unit.
Students will be required to attempt five questions in all; at least one from each unit.
Books
1. Cormen, Leiserson and Rivest: Introduction to Algorithms, 2/e, PHI.
2. Horowitz, Ellis and Sahni, Sartaj; Fundamentals of Computer Algorithms, Galgotia Publications.
3. Aho, Hopcroft, and Ullman: The Design and Analysis of Computer Algorithms, Addison Wesley.
nd
4. R. B. Patel, Expert Data Structures With C, Khanna Publications, Delhi, India, 2 Edition 2004,
ISBN 81-87325-07-0, pp. 1-909.
5. R. B. Patel & M.M.S. Rauthan, Expert Data Structures With C++, Khanna Publications, Delhi, India,
nd
2 Edition 2004, ISBN: 87522-03-8, pp. 1-752.

18

w.e.f. July 2010

Bachelor of Technology- Computer Engineering, Computer Science & Engineering, Bachelor of Technology -Master of Technology (B. TechM. Tech) and Bachelor of Technology- Master of Business Administration (B. Tech-MBA) in Computer Engineering and Computer Science &
Engineering- 5 Year Integrated: Scheme and Syllabi

CO 305

Database Management Systems

L
3

T
1

P
-

C
3.5

Objective: To introduce the concepts of database management systems and the design of

relational databases.
Unit 1
Introduction Overview of Database Management System, Various views of data, data models, Schemes,
Introduction to Database Languages & Environments, Advantages of DBMS over file processing systems,
Responsibility of database administrator, Three levels architecture of database systems, Introduction to
Client/Server architecture.
Data Models: E-R diagram(Entity Relationship), mapping constraints, keys, Reduction of E-R diagram
into tables, Naming secondary storage devices, Network and Hierarchical Model.
Unit 2
Sequential Files, Index sequential files, direct files, Hashing, B-trees index files, Inverted Lists.
Relational Model, Relational Algebra & various operations (set operations, select, project, join, division),
Order, Relational calculus: Domain, Tuple. Well formed formula, specification, quantifiers.
Unit 3
Introduction to Query Languages: QBE, integrity constraints, functional dependencies & normalization
th
(Normal forms up to 5 Normal Form).
Unit 4
Introduction to Distributed Data processing, Object Oriented Database Management systems, parallel
databases, Data mining & data warehousing, Concurrency control: Transaction, Timestamping, Lock
based Protocols, serializability and recovery techniques.
Note: Eight questions will be set by the examiners taking at least two questions from each unit.
Students will be required to attempt five questions in all; at least one from each unit.
Books
rd
1. Database System Concepts by A. Siberschatz, H. F. Korth and S. Sudarshan, 3 edition, 1997,
McGraw-Hill, International Edition.
2. Introduction to Database Management system by Bipin desai, 1991, Galgotia Pub.
rd
3. Fundamentals of Database Systems by R. Elmarsi and S. B. Navathe, 3 edition, 2000,
Addision-Wesley, Low Priced edition.
th
4. An Introduction to Database Systems by C. J. Date, 7 edition, Addision-Wesley, Low Priced
Edition, 2000
nd
5. Database Managemnet and Design by G.W. Hansen and J. V. Hansen, 2 edition, 1999,
Prentice-Hall of India, Eastern Economy Edition.
th
6. Database Management systems by A. K. Majumdar and P. Bhattacharyya, 5 edition, 1999, Tata
McGraw- Hill Publishing.
rd
7. A guide to SQL Standard, Date, C. and Darwen, H. 3 edition, Reading, MA: 1994, AddisionWesley.
8. Data Management & file Structure by Looms, 1989, PHI.

19

w.e.f. July 2010

Bachelor of Technology- Computer Engineering, Computer Science & Engineering, Bachelor of Technology -Master of Technology (B. TechM. Tech) and Bachelor of Technology- Master of Business Administration (B. Tech-MBA) in Computer Engineering and Computer Science &
Engineering- 5 Year Integrated: Scheme and Syllabi

CO 307

Microprocessor & Interfacing

L
3

T
1

P
-

C
3.5

Objective: To familiarize students with the architecture of a processor and machine level

programming.
Unit 1
THE 8085 PROCESSOR: Introduction to microprocessor, 8085 microprocessor: Architecture,
instruction set, interrupt structure, and assembly language programming.
MEMORY INTERFACING: Semiconductor memory and its types- Static and dynamic RAM, ROM,
EPROM, EEROM and NOVRAM-Interfacing memory- Interfacing SRAM, DRAM, EPROM etc.
Timing of RAM and ROM signals.
Unit 2
THE 8086 MICROPROCESSOR ARCHITECTURE : Architecture, block diagram of 8086, details of
sub-blocks such as EU, BIU; memory segmentation and physical address computations, program
relocation, addressing modes, instruction formats, pin diagram and description of various signals.
INSTRUCTION SET OF 8086 : Instruction execution timing, assembler instruction format, data transfer
instructions, arithmetic instructions, branch instructions, looping instructions, Nap and HL T instructions,
flag manipulation instructions, logical instructions, shift and rotate instructions, directives and operators,
programming examples.
Unit 3
INTERFACING DEVICE: The 8255 PPI chip: Architecture, control words, modes and examples,
Interfacing D/A and A/D converters, 8253, 8251, 8279.
Unit 4
DMA: Introduction to DMA process, 8237 DMA controller,
INTERRUPT AND TIMER: 8259 Programmable interrupt controller, Programmable interval timer chips.
Note: Eight questions will be set by the examiners taking at least two questions from each unit.
Students will be required to attempt five questions in all; at least one from each unit.
Books
1. Microprocessor Architecture, Programming & Applications with 8085: Ramesh S Gaonkar; Wiley
Eastern Ltd.
2. The Intel Microprocessors 8086- Pentium processor: Brey; PHI
3. Microprocessors and interfacing: Hall; TMH
4. The 8088 & 8086 Microprocessors-Programming, interfacing, Hardware & Applications: Triebel &
Singh; PHI
5. Microcomputer systems: the 8086/8088 Family: architecture, Programming & Design: Yu-Chang
Liu & Glenn A Gibson; PHI.
6. Advanced Microprocessors and Interfacing: Badri Ram; TMH

20

w.e.f. July 2010

Bachelor of Technology- Computer Engineering, Computer Science & Engineering, Bachelor of Technology -Master of Technology (B. TechM. Tech) and Bachelor of Technology- Master of Business Administration (B. Tech-MBA) in Computer Engineering and Computer Science &
Engineering- 5 Year Integrated: Scheme and Syllabi

CO 309

Wireless and Mobile Communication

L
3

T
1

P
-

C
3.5

Objective: To acquaint the students with the concepts and the issues involved in the design of

wireless networks
Unit 1
Radio Propagation Characteristics, Models for Path loss, Shadowing & Multipath fading-delay spread,
Coherence bandwidth, Coherence Time, Doppler Spread Jakes Channel model.
Unit 2
Digital Modulation for Mobile radio, Analysis under fading channel, diversity techniques and Rake
demodulator. Introduction to Spread Spectrum Communication Multiple Access Techniques used
in Mobile Wireless Communications: FDMA/TDMA/CDMA.
Unit 3
The Cellular concept, Frequency Reuse basic theory of hexagonal cell layout, spectrum efficiency,
FDM/TDM, Cellular System, channel allocation schemes, Handover Analysis, cellular CDMA, Soft
capacity, Erlang capacity comparison.
Unit 4
Wireless standards-GSM, IS-95, UMTS-IMT-2000, Signaling, Call Control, Mobility Management and
location Tracing.
Note: Eight questions will be set by the examiners taking at least two questions from each unit.
Students will be required to attempt five questions in all; at least one from each unit.
Books
1.
Theodore S. Reppaport, Wireless Communications Principles and Practice, IEEE Press, Prentice
Hall.
2.
William C.Y.Lec, Mobile Cellular Telecommunications, Analog and Digital Systems, Mc-Graw
Hill Inc.
3.
Kamilo Feher, Wireless Digital Communications, Modernization & Spread Spectrum
Applications, Prentice Hall of India, New Delhi.
4.
Kaveh Pahlavan and Allen H. Levesque Wireless Information Networks, Wiley Series, John
Wiley and Sons Inc.

21

w.e.f. July 2010

Bachelor of Technology- Computer Engineering, Computer Science & Engineering, Bachelor of Technology -Master of Technology (B. TechM. Tech) and Bachelor of Technology- Master of Business Administration (B. Tech-MBA) in Computer Engineering and Computer Science &
Engineering- 5 Year Integrated: Scheme and Syllabi

CO 311

Analysis and Design of Algorithms (Pr)

P
3

C
1.5

List of Practical:
Experimental work will be based on the course Analysis and Design of Algorithms (CO 303).

CO 313

Database Management Systems (Pr)

P
3

C
1.5

List of Practical:
Experimental work will be based on the course Database Management Systems (CO 305).

CO 315

Microprocessor and Interfacing (Pr)

P
3

C
1.5

List of Practical:
Experimental work will be based on the course Microprocessor and Interfacing course (CO 307).

CO 317

Industrial Training

T
-

C
4

th

Students of the department will go for industrial training just after completion of the 4 semester duration
of training will be 4-6 week period. Students are free to take training in their desired area. But they must
choose technical area for the training. At the end of the training students are required to submit One
bounded report of the training work performed at their work of place within One Week of completion of
the training to the department. This report will be presented in the form of the seminar in class. Duration
of

presentation

may

be

of

30

60

minutes