Wa0001

NATIONAL INSTITUTE OF TECHNOLOGY DURGAPUR
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Curriculum & Syllabi for B. Tech. Course
FIRST SEMESTER (COMMON TO ALL BRANCHES)
FIRST SEMESTER (COMMON TO ALL BRANCHES)

Sl. No Sub. Code Subject L-T-P Credits
1 MA 01 MATHEMATICS - I 3-0-0 3
2 EM 01 ENGINEERING MECHNICS 3-0-0 3
3 EG 51 ENGINEERING GRAPHICS 1-0-3 3
4 WS 51 WROKSHOP PRACTICE – I 0-0-3 2
5 EA 51 CO-CURRICULAR ACTIVITIES 0-0-3 1
TOTAL 7-0-9 12
SECOND SEMESTER (COMMON TO ALL BRANCHES)

1 MA 02 MATHEMATICS - II 3-1-0 4
HS 02 ENGINEERING ECONOMICS & 3-0-0 3
2
ACCOUNTANCY
3 EM 51 GRAPHICAL ANALYSIS USING CAD 0-0-3 2
4 WS 52 WROKSHOP PRACTICE – II 0-0-3 2
5 EA 52 CO-CURRICULAR ACTIVITIES 0-0-3 1
TOTAL 6-1-9 12
Subject List (Semester – 1: Gr-I / Semester – 2: Gr - II)

1 PH 01 ENGINEERING PHYSICS 3-0-0 3
2 CY 01 ENGINEERING CHEMISTRY 3-0-0 3
3 ES 01 ENVIRONMENTAL STUDIES 2-0-0 2
4 HS 01 ENGLISH 3-0-0 3
5 PH 51 PHYSICS LABORATORY 0-0-2 1
6 CY 51 CHEMISTRY LABORATORY 0-0-2 1
TOTAL 11-0-4 13
Subject List (Semester – 1: Gr-II / Semester – 2: Gr - I)

1 CS 01 INTRODUCTION TO COMPUTING 3-0-0 3
2 EC 01 BASIC ELECTRONICS 3-0-0 3
3 EE 01 ELECTRICAL TECHNOLOGY 3-0-0 3
4 CS 51 COMPUTING LABORATORY 0-0-3 2
5 EC 51 BASIC ELECTRONICS LAB 0-0-2 1
6 EE 51 ELECTRICAL TECHNOLOGY LAB 0-0-2 1
TOTAL 9-0-7 13
GR – I : Section A – D
GR – II : Section E – H
[1]
THIRD SEMESTER
1 MA 03 Mathematics- III 3-0-0 3
2 CS 301 Data Structures 3-1-0 4
3 CS 302 Digital Logic Design 3-0-0 3
4 PH 331 Semiconductor Physics 3-0-0 3
5 EC 331 Linear Integrated Circuits 3-0-0 3
6 CS 351 Data Structures Laboratory 0-0-3 2
7 PH 381 Semiconductor Physics Laboratory 0-0-3 2
8 EC 381 Linear Integrated Circuits Laboratory 0-0-3 2
TOTAL 15-1-9 22
FOURTH SEMESTER
1 CS 401 Microprocessor &its Applications 3-1-0 4
2 CS 402 Computer Organization and Architecture 3-0-0 3
3 CS 403 Discrete Structures 3-0-0 3
4 CS 404 Object Oriented Programming 3-0-0 3
5 EC 431 Communication Engineering 3-0-0 3
6 CS 451 Object Oriented Programming Laboratory 0-0-3 2
7 CS 452 Microprocessor Laboratory 0-0-3 2
8 EC 481 Communication Engineering Laboratory 0-0-3 2
TOTAL 15-1-9 22
FIFTH SEMESTER
1 CS 501 Database Management Systems 3-1-0 4
2 CS 502 Theory of Computation 3-0-0 3
3 CS 503 Compiler Design 3-0-0 3
4 CS 504 Operating Systems 3-0-0 3
5 YY 54* Open Elective – I 3-0-0 3
6 CS 551 Database Management Systems Laboratory 0-0-3 2
7 CS 552 Compiler Design Laboratory 0-0-3 2
8 CS 553 Operating Systems Laboratory 0-0-3 2
TOTAL 15-1-9 22
SIXTH SEMESTER
1 MS 631 Principles of Management 3-0-0 3
2 CS 601 Computer Networks 3-1-0 4
3 CS 602 Algorithm Analysis and Design 3-0-0 3
4 CS 603 Artificial Intelligence and Expert Systems 3-0-0 3
5 CS 604 Software Engineering 3-0-0 3
6 CS 651 Computer Networks Laboratory 0-0-3 2
7 CS 652 Software Engineering Laboratory 0-0-3 2
8 HS 681 Professional Communications 0-0-3 2
TOTAL 15-1-9 22
[2]
SEVENTH SEMESTER
1 CS 701 Digital Image Processing 3-1-0 4
2 CS 702 Adv. Computer Architecture 3-0-0 3
3 CS 710-719 Departmental Elective I 3-0-0 3
4 CS 720-729 Departmental Elective II 3-0-0 3
5 CS 751 Artificial Intelligence Laboratory 0-0-3 2
6 CS 752 Image Processing Laboratory 0-0-3 2
7 CS 753 Seminar – I 0-0-2 1
8 CS 754 Project – I 0-0-6 3
9 CS 755 Vocational Training/Summer Internship 0-0-0 1
TOTAL 12-1-14 22
EIGHTH SEMESTER
1 CS 810-19 Departmental Elective-III 3-0-0 3
2 CS 820-29 Departmental Elective-IV 3-0-0 3
3 YY 84* Open Elective -II 3-0-0 3
4 CS 851 CAD for VLSI Laboratory 0-0-3 2
5 CS 852 Internet Programming Laboratory 0-0-3 2
6 CS 853 Seminar – II 0-0-2 1
7 CS 854 Project – II 0-0-14 6
8 CS 855 Viva Voce 0-0-0 2
TOTAL 9-0-22 22
Departmental Electives I
Sub. Code Subject L-T-P Credits
CS 710 Soft Computing 3-0-0 3
CS 711 Computational Geometry 3-0-0 3
CS 712 Mobile Computing 3-0-0 3
CS 713 Complex Network Theory 3-0-0 3
CS 714 Distributed Systems 3-0-0 3
CS 715 Cryptography and Network Security 3-0-0 3
Departmental Elective II
Sub. Code SUBJECT L-T-P CREDIT
CS 720 Principles of Programming Languages 3-0-0 3
CS 721 CAD for VLSI 3-0-0 3
CS 722 Advanced Graph Theory 3-0-0 3
CS 723 Internet Technologies 3-0-0 3
CS 724 Parallel Computing 3-0-0 3
CS 725 Data Mining and Data Warehousing 3-0-0 3
Departmental Elective III

CS 810 Computer Graphics 3-0-0 3
CS 811 Biometrics 3-0-0 3
CS 812 Information Coding Theory 3-0-0 3
CS 813 Optical Networks 3-0-0 3
[3]
CS 814 Computer Vision 3-0-0 3
CS 815 Dependable Computing 3-0-0 3
Departmental Elective IV
CS 820 VLSI Testing and Verification 3-0-0 3
CS 821 Pattern Recognition 3-0-0 3
CS 822 Embedded System Design 3-0-0 3
CS 823 High performance Computing 3-0-0 3
CS 824 Advanced Algorithms 3-0-0 3
CS 825 Symbolic logic and Logic Programming 3-0-0 3
Open Electives –I
Sub. Code SUBJECT L-T-P CREDI
T
CS 541 Data Structures 3-0-0 3
CS 542 Computer Organization 3-0-0 3
CS 543 Database Management Systems 3-0-0 3
CS 544 Object Oriented Programming 3-0-0 3
CS 545 Algorithm Design and Analysis 3-0-0 3
Open Electives –II

CS 841 Soft Computing 3-0-0 3
CS 842 Operating Systems 3-0-0 3
CS 843 Computer Networks 3-0-0 3
CS 844 Software Engineering 3-0-0 3
CS 845 Distributed System 3-0-0 3
Sub Discipline: NON-DEPARTMENTAL CORE
Sub. Code SUBJECT L-T-P CREDI

T
CS 331 Data Structure 3-0-0 3
CS 332 Fundamentals of Data structures 3-0-0 3
CS 333 Programming & Data Structure 3-0-0 3
CS 631 Data Base Management System 3-0-0 3
Sub Discipline: LABORATORY & SESSIONAL COURSES

CS 51 Computing Laboratory 0-0-3 2
CS 351 Data Structures Laboratory 0-0-3 2
CS 451 Object Oriented Programming Laboratory 0-0-3 2
CS 452 Microprocessor Laboratory 0-0-3 2
CS 551 Database Management Systems Laboratory 0-0-3 2
CS 552 Compiler Design Laboratory 0-0-3 2
CS 553 Operating Systems Laboratory 0-0-3 2
CS 651 Computer Networks Laboratory 0-0-3 2
[4]
CS 652 Software Engineering Laboratory 0-0-3 2
CS 751 Artificial Intelligence Laboratory 0-0-3 2
CS 752 Image Processing Laboratory 0-0-3 2
CS 852 Internet Programming Laboratory 0-0-3 2
CS 681 Database Management system Laboratory 0-0-3 2
CS 381 Data structure Laboratory 0-0-3 2
CS 382 Programming & Data structure Laboratory 0-0-3 2
CS 383 Programming & Data structure Laboratory 0-0-3 2
Sub Discipline: PROJECT, SEMINAR etc.

CS 753 Seminar – I 0-0-2 1
CS 754 Project – I 0-0-6 3
CS 853 Seminar – II 0-0-2 1
CS 854 Project – II 0-0-14 6
SUMMARY OF COURSES
SUBJECT SUBJECT L-T-P CREDIT DEVELOPER

CODE
CS 01 INTRODUCTION TO 3-0-0 3 D. R.
COMPUTING KISKU/S.B.
Fundamentals of Computer: History of Computer, Generation of Computer, Classification

of Computers. [2]
Basic Anatomy of Computer System, Primary & Secondary Memory, Processing Unit,
Input and Output devices. [3]
Binary & Allied number systems representation of signed and unsigned numbers. BCD,
ASII. Binary Arithmetic and logic gates. [4]
Assembly language, high level language, compiler and assembler (basic concepts). [2]
Basic concepts of operating systems like MS DOS, MS WINDOW, UNIX, Algorithm and
flow chart. [2]
C Fundamentals: The C character set identifiers and keywords, data type and sizes,
variable names, declaration, statements. [3]
Operators & Expressions: Arithmetic operators, relational and logical operators, type,
conversion, increment and decrement operators, bit wise operators, assignment operators
and expressions, precedence and order of evaluation. Input and Output: Standard input
and output, formatted output -- printf, formatted input scanf. [3]
Flow of Control: Statement and blocks, if - else, switch, loops - while, for do while, break
and continue, go to and labels. [2]
Fundamentals and Program Structures: Basic of functions, function types, functions
[5]
returning values, functions not returning values, auto, external, static and register
variables, scope rules, recursion, function prototypes, C preprocessor, command line
arguments. [3]
Arrays and Pointers: One dimensional arrays, pointers and functions, memory map of one
and two dimensional arrays, multidimensional arrays. [4]
Structures Union and Files: Basic of structures, structures and functions, arrays of
structures, bit fields, formatted and unformatted files. [4]
TEXT BOOKS:
1. The C Programming Language (ANSI C), 2nd Edition by Brian W. Kernighan and Dennis
M. Ritchie, Prentice Hall, 1988.
2. C Programming: A Modern Approach, 2nd Edition 2nd Edition by K. N. King, W. W.
Norton & Company, 2008.
REFERENCE BOOKS:
1. C Programming in 12 Easy Lessons by Greg Perry, Sams, pp. 640, 1994.
2. C - Traps and Pitfalls by Andrew R. Koenig, Addison Wesley, pp. 160, 1989.

CODE
CS 301 Data Structures 3-1-0 4 T. PAL
Introduction to Data Structures: Data, Data Types, String, Abstract Data Type (ADT) and
Data structures with examples. [4]
Linear Data Structure:
Arrays: Single and multi-dimensional arrays, Row and Column major Representation of
matrices, sparse matrices. [2]
Linked List: Creation, Display, Insertion and Deletion (in front, at end, and before and after
a specific node), Summation, average, maximum, minimum, Searching, Sorting,
Concatenation of two list (Circular and non-Circular),Doubly linked list, Application of
Linked List - polynomial, sparse matrix. [8]
Stack: Stack as an ADT, Stack operation, Array Representation of Stack, Link

Representation of Stack, Applications: Recursion, Function call, Conversion from infix to
postfix notation, Evaluation of postfix expression. [6]
Queue: Queue as an ADT, Queue operation, Array Representation of Queue and its
disadvantages, Linked Representation of Queue, Circular Queue, Priority Queue and its
applications. [3]
Non-linear Data Structure
Tree: Basic trees concept, Binary tree representation, Binary tree operation, Binary tree
traversal, (Preorder, Inorder and Postorder), Copying a Tree, checking equivalency
between two Trees. [6]
[6]
Binary search tree (BST): Creation, search, insertion, and deletion. [4]
Sorting and Searching
Sorting: Bubble sort, Selection sort, Insertion sort, Quick Sort. [8]
Searching: Sequential search, Binary search. [4].
TEXT BOOKS:
1. Data Structures Using C, ISRD Group, Second Edition, Tata McGraw-Hill.
2. Data Structure Using C, Balaguruswamy.
REFERENCE BOOKS:
1. Data Structure using C & C++, Angenstein&Tanenbaum, PHI.
2. An introduction to Data Structure, Trembly& Sorensen, MCHILL.

CODE
CS 302 Digital Logic Design 3-0-0 3 B. SEN
Switching Circuits: Logic families: TTL, nMOS, CMOS, dynamic CMOS and pass transistor
logic (PTL) circuits, inverters and other logic gates, area, power And delay characteristics,
concepts of fan-in, fan-out and noise margin. [6]
Switching theory: Boolean algebra, logic gates, and switching functions, truth tables and
switching expressions, minimization of completely and incompletely specified switching
functions, Karnaugh map and Quine-McCluskey method, multiple output minimization,
representation and manipulation of functions Using BDDs, two-level and multi-level logic
circuit synthesis. [8]
Combinational logic circuits: Realization of Boolean functions using NAND/NOR Gates,

Decoders, multiplexers. Logic design using ROMs, PLAs and FPGAs. Case Studies. [8]
Sequential circuits: Clocks, flip-flops, latches, counters and shift registers, finite-state
machine model, synthesis of synchronous sequential circuits, Minimization and state
assignment, asynchronous sequential circuit synthesis. [8]
ASM charts: Representation of sequential circuits using ASM charts, synthesis of output
and next state functions, data path control path partition-based design. [5]
TEXT BOOKS:
1.Digital Logic and Computer Design M. Morris Mano PHI
2.Digital Computer Fundamentals, Bartee Tata McGraw Hill
REFERENCE BOOKS:
1.Digital Computer Electronics, Malvino, Tata McGraw Hill, New Delhi
[7]
CODE
CS 401 Microprocessor & its 3-1-0 4 T. DE

Application
1. The 8085 Microprocessor: Microprocessor architecture, Register set, ALU, Interface

section, Timing and control section, Pin details of 8085 microprocessor. [5]
2. Programming in 8085: Instruction set of 8085 microprocessor and Assembly language

program, Instruction execution and timing diagram, Addressing modes of 8085, Peripheral
I/O and Memory mapped I/O, Stack and subroutine in 8085 microprocessor system. [12]
3. Interrupt in 8085: Implementation of interrupt using INTR line and RST instructions, RST
7.5, RST6.5, RST 5.5, and TRAP, Instruction RIM and SIM. [4]
4. Peripheral (I/O) interfacing: Timing and execution of IN / OUT instruction, Device

selection and data transfer, Absolute and linear select decoding. The 8155 Multipurpose
Programmable I/O Device: Basic block diagram, Control word, 8155 timer, Square wave
generation using 8155, the 8155 I/O ports in Handshake mode. [8]
5. The 8255 Programmable Peripheral Interface: Basic block diagram, Control word,
Different modes. [3]
6. The 8259A Programmable Interrupt Controller: Block diagram, interrupt operation,

Handling multiple interrupts, Cascading of 8259A. The 8253 Programmable Interval Timer:
Block diagram and different mode. The 8279 Programmable keyboard/ Display Interface:
Basic block diagram and interfacing. [8]
TEXT BOOKS:
1.Microprocessor Architecture, Programming & Applications, Gaonkar, Ramesh,Penram
International Pub.(India)
2.Microprocessor, Ajit Pal, TMH
REFERENCE BOOKS:
1.Microprocessor Interfacing, Programming & Hardware, D.V.Hall, TMH
2.Microcomputer systems, Liu & Gibson, PHI

CODE
CS 402 Computer Organisation and 3-0-0 3 B. SEN

Architecture
Von Neumann architecture, Operational concepts, Instruction Set Architechture,

Instruction formats and addressing modes, Instruction execution process.GPR based and
Stack based organization.[5]
ALU Organisation: Combinational and Sequential ALU, ALU expansion strategies, Design
of Multipliers and Dividers, Wallace tree and Booth’s Multipliers, Floating Point Numbers
(IEEE754), Floating Point Operations. [8]
[8]
Control Unit Organisation: Internal Bus Organisation of CPU, Instruction Execution Steps,
Hardwired Control, Microprogrammed control. [8]
Main Memory Organization: Memory hierarchy, SRAM and DRAM, Internal organization of
Main Memory, Page Mode Access, Memory interleaving, Types of RAM, ROM and
secondary memory, Cache memory. [7]
I/O Organization: Addressing of I/O devices, Interrupts, DMA and DMA Controllers, I/O
interfacing schemes, Bus Arbitration Schemes. [7]
TEXT BOOKS:
1. Computer Organization by Hamacher, Vranesic and Zaky, McGraw Hill
2. Computer Architecture & Organization by J.P.Hayes, McGraw Hill
REFERENCE BOOKS:
1. Computer Organization and Architecture. by W.Stallings, Prentice Hall
2. Computer Organization & Design by Hennessey and Patterson, Morgan Kaufmann

CODE
CS 403 Discrete Structures 3-0-0 3 S. SADHU
Propositional logic: Syntax, semantics, valid, satisfiable and unsatisfiable formulas,

encoding and examining the validity of some logical arguments. [5]
Proof techniques: forward proof, proof by contradiction, contrapositive proofs, proof by
mathematical induction, proof of necessity and sufficiency. [5]
Sets, relations and functions: Operations on sets; Relations -- reflexive, symmetric,
transitive, antisymmetric, Equivalence, partial ordering relations, equivalence relations,
Partial Order, Lattice, Hasse Diagram. Function --Surjection, Injection, Bijection,
Composition of Function, Asymptotic notations: big-Oh, small-oh, Theta, Omega. [6]
Size of a set: Finite and infinite sets, countable and uncountable sets, Cantor's diagonal
argument and the power set theorem, Schroeder-Bernstein theorem. [2]
Introduction to counting: Basic counting techniques - inclusion and exclusion, pigeon-hole
principle, permutation, combination, summations. Introduction to recurrence relation and
solution of recurrence. Catalan Number - Stack Permutation, Valid parenthesization,
number of monotonic Manhattan paths. [6]
Algebraic structures and morphisms: Algebraic structures with one binary operation -
semigroups, monoids and groups, congruence relation and quotient structures. [3]
Introduction to graphs: Graphs and their basic properties - degree, path, cycle, subgraphs,
tree, isomorphism, Eulerian and Hamiltonian walks. Radius, Diameter and Center of a
graph. Planar graphs, Euler's formula, statement of kuratowskey's theorem. Complement
of a graph. Clique number, independence number, chromatic number, bipartite graph,
Degree Sequence, Shortest Path in a weighted graph, BFS, DFS, Bipartite graphs and
odd cycles, Strongly connected component, Minimum Spanning Tree; Introduction to
Matching, perfect matching. [9]
[9]
TEXT BOOKS:
1.Kenneth H. Rosen, Discrete Mathematics and its Applications, Tata McGraw-Hill.
2.C. L. Liu, Elements of Discrete Mathematics, Tata McGraw-Hill.
REFERENCE BOOKS:
1. Ralph P. Grimaldi, Discrete and Combinatorial Mathematics, Pearson Education, Asia.
2. Douglas B. West, Introduction to Graph Theory, Prentice Hall, India

CODE
CS 404 Object Oriented Programming 3-0-0 3 S. NANDI
Introduction: Object oriented programming concepts – objects-classes- methods and

messages-abstraction and encapsulation-inheritance-abstract classes-polymorphism,
Assert macro, Enumerated data type. [5]
Pointer and references in C++, Constant – Pointers, References, new & delete operator,
dynamic allocation. [5]
C++- objects-classes: constructors and destructors, constructor initializer list, :: operator.

[6]
Overloading: Function overloading, Operator overloading - friend functions. [5]
Inheritance: virtual base class, virtual functions- runtime polymorphism. [4]
Templates in C++ [5]
Exception handling: Streams and formatted I/O - file handling - Standard template library.
[4]
TEXT BOOK:
1. Thinking in C++ (B. Eckel)
2. Essential C++ (S. Lippman)
REFERENCE BOOKS:
1. Effective C++ (S. Meyers)
2. C++ Programming Language (B. Stroustrup)

CODE
CS 501 Database Management 3-1-0 4 P. K.

System (DBMS) GUHATAHKURTA
Introduction of DBMS: Database, Database Management System, Traditional File

Processing System Vs. DBMS, Three Level architecture of DBMS, Database languages,
Function of DBA, Data Independence, Data Model & Various types of data models. [3]
[10]
Entity Relationship (ER) Model: Basic concepts of ER model, various components of ER
diagram, Consistency constraints, various types of keys and its importance in database
design, Types of entity sets, ER diagram construction, special features of an ER diagram.
[4]
Relational Algebra: Basic concept of procedural query language, various operations of

relational algebra such as selection, projection, rename, set operations, Cartesian product,
different joins, extended operations (generalized projection, aggregate function etc.) and
its applications, query execution using these operations. [4]
Relational Calculus: Basic concepts, Tuple relational calculus and Domain relational
calculus, query practice. [3]
Structured Query Language (SQL): Detailed query writing procedure for DDL, DML and
DCL, complex query including nested sub-query practice with examples. [4]
Index Structures: Indexing, various types of index structures such as primary, secondary,
clustered, multi-level, dynamic multi-level(B_tree & B+_tree) concepts, problem solving on
these structures. [3]
Normalization: Basic concepts on functional dependency (FD) and multivalued FD, Rules
over FDs, various properties such as closure of a set of FDs, canonical cover etc., Need of
normalization, Different normal forms (1NF, 2NF, 3NF, BCNF, 4NF, 5NF) and associated
problems, Lossless decomposition, dependency preservation. [6]
Transaction Processing:Basic concept on transaction, state diagram of transaction, ACID

property, scheduling of transactions (serial and serializable), Conflict and view
serializability, Precedence graph and its importance. [3]
Concurrency Control: Various problems due to concurrent events, Need of concurrency

control protocols, Lock based and timestamp based protocols. [4]
Recovery: Need of recovery techniques, various types of recovery techniques such as

dumping, log based recovery, shadow paging, check pointing etc. [2]
Query Optimization: Basic concepts on query optimization, various rules of query

optimization using examples. [2]
Distributed database: Basic concept on distributed database and its importance over
centralized database, Architecture of distributed database, Properties of distributed
database – fragmentation, allocation and replication. [2]
TEXT BOOKS:
1. A. Silberschatz, H. F. Korth, S. Sudarshan, Database System Concepts,McGraw Hill
Education.
REFERENCE BOOKS:
1. Navathe,Elmasri, Fundamentals Of Database Systems, Pearson Education.
2. C. J. Date, An Introduction to Database Systems,Addison-Wesley.
[11]
CODE
CS 502 Theory of Computation 3-0-0 3 B. SEN
Introduction to theory of Automata, language theory, tokens, alphabets, NDFA and DFA,
Minimization of FA. Expressions, regular sets and regular grammar. [8]
Formal languages, grammar, production rules, sentences, concepts of type 0, type 1, type
2 and type 3 languages, properties of various types of grammars and operations on them.
[8]
Context free languages, Derivation trees, simplification of CFG, methods for null and unit
product elimination, context free grammar. [8]
Basic definition of Push down Automata (PDA), Acceptance by PDA, PDA and CFL,
constructing PDAs for given "CFG and vice-versa. [8]
Turing machine computability and Church's hypothesis, halting, problem & undesirability,
Universal Turing machine, Recursive functions. [8]
TEXT BOOKS:
1. Introduction to Automata Theory, Languages and Computation, Hopcroft, & Ullman,
AWL, New York, 2000.
2. Introduction to Languages and Theory of Computation, J.C. Martin, Tata McGraw Hill,
New Delhi, 2001.
REFERENCE BOOKS:
1. Automata Theory, Machines and Languages, R.Y. Kain, McGraw Hill International, New
York.

CODE
CS 503 COMPILER DESIGN 3-0-0 3 G. SARKER
Introduction: Translator, Compiler, Assembler, Interpreter, Structure and Phases of a

Compiler, Bootstrapping a Compiler. [5]
Lexical Analyzer: Transition Diagram of Keywords, Identifiers, Operators – Reserved Word

Strategy -- Deterministic and Non Deterministic Automata (DFA and NFA) – Conversion
from NFA to DFA. [5]
Syntax Analyzer: Types of Grammar -- Ambiguity in Grammar – Parse Tree – Syntax

Tree -- Bottom Up (Shift Reduce) Parsing – Operator Precedence Parser -- Top Down
Parsing – LL(0) Parsers – FIRST and FOLLOW – Bottom Up Parser LR(k) – Construction
of LR(1) Parser form a Grammar -- Shift Reduce Conflict -- LR(1) and LALR Parser –
Goto Graphs. [5]
Semantic Analyzer: Semantic Actions, Translation Fields, Values of Translation. [2]
[12]
Intermediate Code Generator: Concept of Platform Independency -- Virtual Machine –
JVM -- Three Address Code – Triple – Quadruple – Conversion of HLL Stmts. Into
different Intermediate Codes. [5]
Error Handling: Lexical and Syntactic Errors – Error Handling in LL(1) and LR(0) Parsing –
Table Driven and Panic Mode Error Recoveries – Overheads of Recovery -- Semantic
Error Concepts, Examples and Recovery. [5]
Code Optimization – Criterion of Optimization – Gain of Optimization – Program Flow

Graph – Dead Code -- Local and Global Optimization – Safety of Local Optimization --
Optimization – Basic Block – Global Optimization – Code Hoisting – Safety of Code
Hoisting Criteria. [5]
Code Generation – Concept of Target Machine – Instruction Costs – Code Generation

Algorithm – Run Time Store Management. [3]
TEXT BOOKS:
1. Principles of Compiler Design – Alfred V. Aho & Jefrey D. Ullman, Pearson Education.
REFERENCE BOOKS:
1. Compiler Design in C – Holub, Prentice Hall.

CODE
CS 504 Operating Systems 3-0-0 3 S. NANDI
Introduction: Evolution of OS, Batch, Multiprogramming and Timesharing system, Real

Time OS, User/kernel mode, Signal handling. [6]
Process management : Process-Concept, Scheduler (long term, short term, Swapper),

Process Scheduling Algorithms (Metrics, FCFS, SJF, Priority, RR, Multilevel Feedback
Queue, Fair Share). [4]
Process Synchronization : Interprocess Communication, Race conditions, Mutual

Exclusion, Algorithmic solution, Peterson’s solution, Bakery algorithm, Semaphores,
Monitors, Solution to Producer-Consumer Problem, Reader-Writer Problem, Sleeping
Barber Problem, Dining philosophers problem.Thread. [14]
Deadlocks : Resource Allocation Graph,Deadlock Detection, Deadlock Avoidance,

Deadlock Prevention, Banker's algorithm. [4]
Memory Management : Paging, Implementation of Page table (TLB), Multilevel Paging,

Virtual Memory: Demand paging, Segmentation, Swapping, Page Replacement,
Thrashing. [8]
File Management : File allocation, Contiguous, Linked, Indexed, i-node, Free space
management, Disk Scheduling. [6]
TEXT BOOKS:
[13]
1. Silberschatz, Galvin, Gagne, Operating System Principles, Wiley India Pvt Ltd.
2. Andrew S. Tanenbaum, Modern Operating Systems, Prentice-Hall.
REFERENCE BOOKS:
1. Stalling, William, Operating Systems, Maxwell McMillan International Editions.
2. Dietel H. N., An Introduction to Operating Systems, Addison Wesle.

CODE
CS 601 COMPUTER NETWORKS 3-1-0 4 P. K.

GUHATAHKURTA
Introduction of Computer Networks: Basic concepts of computer networks and data

communication, different components of a data communication system, features for a
network design, various types of communications, types of connections (point-to-point and
multipoint), physical topology and its types (mesh, star, bus, ring), types of networks (LAN,
MAN and WAN). [3]
Network Model: Basic concepts of network model, OSI and TCP/IP models, functions in
brief of different layers of OSI model, different levels of addressing. [2]
Physical layer functions: Basic concept of signals, analog and digital signals, various
modulation techniques, various line coding techniques, noise and errors, different types of
transmission media and its applications. [4]
Switching techniques: Basic concepts of a switched networks and its importance, various
switching techniques (circuit, message, datagram approach, virtual circuit networks) with
examples, compare and contrast between various types of switching techniques. [3]
Data link layer functions : Framing, Error control techniques (Parity checking method,
Checksum, Cyclic redundancy check, Hamming code) with examples, Flow control
protocols and its importance, various flow control protocols such as stop-and-wait ARQ,
sliding window (Go-Back-N ARQ and Selective repeat ARQ) protocols,HDLC protocol,
Multiple access techniques and its importance, various multiple access techniques such
as ALOHA, slotted ALOHA, CSMA, CSMA/CD, CSMA/CA, polling, reservation, token
passing, FDMA, TDMA and CDMA techniques. [10]
Network layer functions: IP address and its classification, design of a network with sub
netting concept, IP protocol, transition from IPv4 to IPv6, NAT, ARP and RARP, Routing
and forwarding concepts, classification of routing protocols, distance vector, link state and
path vector routing protocols, various multicast routing protocols, congestion control
techniques, Quality of Service (QoS) in networks and its improvements. [10]
Transport layer functions: Basic concepts of socket address, socket programing. [3]
Application layer functions: SMTP, HTTP, FTP, WWW, DNS. [3]
Network Security: Basic concepts of network security and RSA algorithm. [2]
[14]
TEXT BOOKS:
1. B. A. Forouzan, DATA COMMUNICATIONS AND NETWORKING.
REFERENCE BOOKS:
1. A. S. Tanenbaum, Computer Networks.
2. W. Stallings, Data and Computer Communications.

CODE
CS 602 Algorithm Analysis and Design 3-0-0 3 S. SADHU
Introduction and basic concepts - Algorithm, Asymptotic notations (big-Oh, big Omega,
Theta, small-oh) and their significance, introduction to RAM model of computation,
complexity (Time Complexity, Space Complexity) analysis of algorithms, worst case and
average case. Solving Recurrences – Substitution method, Recurrence tree method and
Master Method, Finding maximum and minimum; Lower bound for sorting (comparison
based sorting), Amortized complexity analysis – storage allocation, binary counting, heap
sort. [9]
Divide and conquer Problem – Multiplication of two n-bit integers, Strassen’s Matrix
Multiplication problem, Closest pair of points, linear time median finding algorithm. [4]
The Greedy Algorithm - Interval scheduling, Interval partitioning, Minimizing the Lateness
of Intervals, Fractional Knapsack Problem. [4]
Dynamic Programming - Longest Common Subsequence, Matrix Chain Multiplication, 0-1

Knapsack Problem. [3]
Backtracking Method, Branch and Bound Method. [2]
Graph Algorithm: Depth First Search, Breadth First Search, Dijkstra's Single Source
Shortest Path algorithm;All pair shortest path algorithm, Minimum Spanning Tree (Prim's
and Kruskal's algorithm). [5]
Randomized Algorithm- Las Vegas and Monte Carlo; Randomized Quick Sort algorithm
and Min Cut problem. [2]
Reducibility between problems and NP-completeness: discussion of different NP-complete

problems like satisfiability, clique, vertex cover, independent set, Hamiltonian cycle, set
cover. [5]
Approximation Algorithm- Constatnt ratio approximation algorithm for metric travelling

salesperson problem (TSP) and vertex cover problem. [3]
TEXT BOOKS:
1. T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, Introduction to Algorithms, by
Prentice Hall India
2. J. Kleinberg and Eva Tardo, Algorithm Design by Pearson Education (Indian edition)
[15]
REFERENCE BOOKS:
1. Michael T Goodrich and Roberto Tamassia, Algorithm Design: Foundations, Analysis,
and Internet Examples, Second Edition, Wiley, 2006

CODE
CS 603 ARTIFICIAL INTELLIGENCE & 3-0-0 3 G. SARKER

EXPERT SYSTEMS
Introduction to Artificial Intelligence (AI): Features of natural intelligence, Definition of

Artificial Intelligence (AI), Turing Test. [3]
Problem Representation and Characterization: State Space Representation, Production

Systems, Search, Problem Characterization. [3]
Intelligent Search Techniques: Search Classifications, Heuristic Function, Various Types

of Heuristic Search Techniques, Performance Measure of Heuristic Search with
Penetrance. [4]
Knowledge Representation Methodologies: Types of Knowledge, Propositional vs.

Predicate Logic, Resolution Proof, Logic Programming, Knowledge representation using
Rules, Declarative and Procedural Representation, Uncertainty Management in
Knowledge Representation, Certainty Factors in facts and rules, Concept of Fuzzy Logic.
[5]
Semantic Knowledge Representation: Syntactic vs. Semantic Knowledge, examples of

Semantic Knowledge, Semantic Net, Frame, OOP , Property Inheritance, Tangled
Hierarchies. [4]
Game Playing: Game Tree, Minimax Search, Search Reduction by alpha and beta
cutoffs. [2]
Planning: Introduction to Planning, Goal Stack Planning, Nonlinear, Hierarchical and
Reactive Planning. [2]
Learning: Learning and Intelligence, Learning Spectrum, Various Types of Learning

Techniques and Systems. [2]
Expert Systems (ES) and ES Shells: Definition of Expert Systems, Components of Expert
Systems. Types of ES – Manual, Semi-automatic, and Automatic ES, Techniques of
Knowledge Acquisition (KA) for ES.-- ES Shell. Advantages and disadvantages of ES
Shell over ES. [5]
Neural Networks : Symbolic vs. Neural Network AI, Hofield Network, Perceptron as a
model of neuron, Single and multiplayer Perceptron for classification and knowledge
representation, Back propagation Network, Supervised, Reinforcement and Unsupervised
Learning. [5]
TEXT BOOKS:
[16]
1. Artificial Intelligence -- Rich and Knight. -- Tata McGraw Hill.
2. Artificial Intelligence – A New Synthesis – Nilsson. -- Morgan Kaufmann Publishers.
REFERENCE BOOKS:
1. Artificial Intelligence and Expert Systems -- Paterson. PHI
2. Artificial Neural Networks – B. Yegnanarayanana. PHI

CODE
CS 604 Software Engineering 3-0-0 3 B. SEN
Concept of systems, its characteristics, the product, the process, Methods, Tools,
Software Process modules, Process technology, Project management concepts: People,
The problem, the process and the project. [6]
Software process and project metrics, Software measurement, Software project planning:
Observation on estimating, project planning objectives, software scope, resources, project
estimation, decomposition techniques. [6]
Project scheduling, basic concepts, Relationship between people and effort, defining task
set, refinement of major task, Software quality assurance: Quality concepts, Software
reviews, Software reliability. [7]
Software project analysis, analysis concepts, requirements analysis, analysis methods,

analysis modeling, elements, data modeling, data flow diagrams, and the mechanics of
structures analysis, design concepts and principles. [7]
Software testing methods, Testing fundamentals, Test case design, Software Testing
strategies, strategic issues, Unit testing, Integration testing, Validation testing, system
testing. Object-oriented paradigm, concepts, elements of an object model, Management of
Object oriented software projects. object-oriented analysis concepts. [8]
TEXT BOOKS:
1. Software Engineering: A Practitioner's Approach, 5th Ed., Roger S. Pressman, Tata
McGraw Hill, New Delhi, 2001.
2. Software Engineering Concepts, Richard Fairley, Tata McGraw Hill, New Delhi, 2002.
REFERENCE BOOKS:
1. Classical and Object Oriented Software Engineering with C++/Java , 3rd Ed., S.R.
Schach, McGraw Hill International, New York, 1998

CODE
CS 701 DIGITAL IMAGE PROCESSING 3-1-0 4 D.R. KISKU
Introduction: What is digital image processing? Origins of digital image processing,

Examples of fields that use digital image processing, fundamental steps in digital image
processing, components of digital image processing. [4]
[17]
Digital Image Fundamentals: elements of visual perception, Light and electromagnetic
spectrum, Image sensing and acquisition, Image sampling and quantization, some basic
relationship between pixels, Linear and non-linear operations. [5]
Image enhancement in spatial domain: Background, basic gray level transformation,

histogram processing, enhancement using arithmetic and logic operations, basics of
spatial filtering, smoothing spatial filters, sharpening spatial filters. [5]
Image enhancement in frequency domain: Background, Introduction to Fourier transform

and frequency domain, smoothing frequency domain filters, sharpening frequency domain
filters, homomorphic filtering, fast Fourier transform. [5]
Image restoration: A model of image degradation / restoration model, noise models,

restoration in the presence of noise only, periodic noise reduction, linear, positive-invariant
degradations, estimating the degradation functions, inverse filtering, wiener filtering,
constrained least – square filtering, geometric mean filter. [6]
Image Compression: Fundamentals, Image compression models, Elements of information

theory, lossless and lossy compressions. [4]
Morphological image processing: Dilation and Erosion, Opening and closing, Hit-and-Miss
Transformations, Some basic morphological operations. [4]
Image segmentation: Detection of discontinuities, Edge linking and boundary detection,

Thresholding, Region-based segmentation, Segmentation by Morphological Watersheds,
Use of motion in segmentation. [4]
TEXT BOOKS:
1. Digital Image Processing, by Rafael C. Gonzalez, Richard E. Woods, 3rd Edition,
Prentice Hall, 2007.
2. Fundamentals of Digital Image Processing by Anil K. Jain, 1st Edition, Prentice Hall,
1988.
REFERENCE BOOKS:
1. B. Chanda and D. Dutta Majumder, Digital Image Processing and Analysis 2nd Ed., PHI
Learning Pvt. Ltd., New Delhi, 2011.
2. Digital Image Processing, Jayaraman, Tata McGraw-Hill Education, pp. 723, 2011.
[18]
CODE
CS 702 ADVANCED COMPUTER 3-0-0 3 M. DALUI

ARCHITECTURE
UNIT - 1 FUNDAMENTALS OF COMPUTER DESIGN: Introduction; Classes of

computers; Defining computer architecture; Trends in Technology, Quantitative Principles
of computer design, Instruction set processor design, Principles of processor performance,
Instruction-level Parallelism, RISC and CISC architectures. [4]
UNIT - 2 PIPELINING: Introduction, Pipelining fundamentals, Arithmetic and instruction

pipelining, Pipeline hazards, Minimizing pipeline stalls, Branch Prediction, superscalar and
superpipelined architectures. [4]
UNIT - 3 INSTRUCTION –LEVEL PARALLELISM – 1: ILP: Concepts and challenges;

Basic Compiler Techniques for exposing ILP; Reducing Branch costs with prediction;
Overcoming Data hazards with Dynamic scheduling; Hardware-based speculation. [4]
UNIT - 4 INSTRUCTION –LEVEL PARALLELISM – 2: Exploiting ILP using multiple issue

and static scheduling; Exploiting ILP using dynamic scheduling, multiple issue and
speculation; Advanced Techniques for instruction delivery and Speculation. [4]
UNIT - 5 MULTIPROCESSORS AND THREAD –LEVEL PARALLELISM: Introduction;

Symmetric shared-memory architectures; Performance of symmetric shared– memory
multiprocessors; Distributed shared memory and directory-based coherence; Basics of
synchronization; Models of Memory Consistency. [4]
UNIT - 6 REVIEW OF MEMORY HIERARCHY: Introduction; Cache performance; Cache

Optimizations, cache coherence, cache coherence protocols – snoop based and directory
based protocols, Virtual memory. [5]
UNIT - 7 MEMORY HIERARCHY DESIGN: Introduction; Advanced optimizations of Cache

performance; Memory technology and optimizations; Protection: Virtual memory and
virtual machines. [4]
UNIT - 8 HARDWARE AND SOFTWARE FOR VLIW AND EPIC: Introduction: Exploiting
Instruction-Level Parallelism Statically; Detecting and Enhancing Loop-Level Parallelism;
Scheduling and Structuring Code for Parallelism; Hardware Support for Exposing
Parallelism: Predicated Instructions; Hardware Supportfor Compiler Speculation. [6]
TEXT BOOKS:
1. Computer Architecture, A Quantitative Approach – John L. Hennessey and David A.
Patterson; 4th edition, Morgan Kaufmann.
2. Advanced Computer Architecture Parallelism, Scalability, Programability – Kai Hwang;
Tata Mc- Graw Hill.
[19]
REFERENCE BOOKS:
1. Computer architecture and parallel processing – Kai Hwang and Fayé Alayé Briggs;
McGraw-Hill.
2. Parallel Computer Architecture, A Hardware / Software Approach – David E. Culler,
Jaswinder Pal Singh, Anoop Gupta; Morgan Kaufman.

CODE
CS 710 Soft Computing 3-0-0 3 T. PAL
Fuzzy Logic-I (Introduction)

Introduction of Soft Computing Methods,Overview of Crisp Sets, Concepts of Fuzzy sets,
Representation of fuzzy sets/Membership functions, Basic operations on fuzzy sets,
Properties of fuzzy sets, Fuzzy and Crisp relations, Operations on Fuzzy Relations: Max-
Min Decomposition. [6]
Fuzzy Logic –II (Fuzzy Rules & Approximate Reasoning)

Fuzzy if-then rules: M-A and TSK Rules, Fuzzifications and Defuzzifications, Fuzzy
Inferencing /Approximate Reasoning, Applications: Pattern Recognition, Image Processing
and Controller. [4]
Neural Networks-1 (Introduction & Architecture)

Introduction of neural networks: Neuron, Nerve structure and synapse, Artificial Neuron
and its model, activation functions, Neural network architecture: single layer and multilayer
feed forward networks, recurrent networks. Learning methods; perception and
convergence rule. [4]
Neural Networks-II (Back propagation networks)

Architecture: perceptron model: single layer and multilayer perceptron, back propagation
learning, factors affecting back propagation training, RBF networks, Hopfield network, self-
organizing feature maps, Applications ofANN. [8]
Genetic Algorithm (GA) –I (Introduction)

Evolutionary Computing, Basic concepts and working principle of simple GA (SGA),
Genetic Operators: Selection, Crossover and Mutation, flow chart of SGA, Encoding &
Decoding, Population Initialization, Objective/fitness Function, Applications: TSP. [6]
Genetic Algorithm (GA) –II (Multi-objective Genetic Algorithm (MOGA))

Conflicting objectives, Objective space and variable space, Domination, Pareto front,
Pareto Set, NSGA-II: Non-domination Sorting, Crowding distance operator. [5]
Introduction to Hybrid Systems

Integration of neural networks, fuzzy logic and genetic algorithms. [2]
TEXT BOOKS:
1. S. Rajsekharanand and VijayalakshmiPai, “Neural Networks, Fuzzy Logic and Genetic
Algorithm: Synthesis and Applications”, Prentice Hall of India.
2. Kumar Satish, “Neural Networks”, Tata Mc. Graw Hill.
[20]
REFERENCE BOOKS:
1. B. Yegnanarayana , “Artificial Neural Networks”
2. David E. Goldberg, “Genetic Algorithms in Search, Optimization, and Machine
Learning”, Addison-Wesley Publishing Company.

CODE
CS 711 Computational Geometry 3-0-0 3 S. SADHU
Computational Geometry Introduction: Historical perspectives, Geometric preliminaries,

Convex Hull, Algorithms to find the Convex Hull of a point set in 2D plane: Graham’s Scan
Algorithm, Divide and Conquer algorithm, Jarvis’s March Algorithm, Timothy Chan’s
Algorithm; Lower bound analysis for Convex Hull Algorithm, Application Domains. [6]
Line Segment Intersection: Line Segment Intersection, The Doubly-Connected Edge List,
Computing the Overlay of Two Subdivisions, Boolean Operations. [3]
Polygon Triangulation: Guarding and Triangulations, Art Gallery Theorem, Monotone

Polygon, Partitioning a Polygon into Monotone Pieces, Triangulating a Monotone Polygon.
[4]
Computing the Minimum Enclosing Disk of a point set & its application. [2]
Orthogonal Range Searching : 1-Dimensional Range Searching, Kd Trees, Range Trees,

Higher-Dimensional Range Trees, Fractional Cascading. [5]
Point Location: Point Location and Trapezoidal Maps, A Randomized Incremental

Algorithm to compute a Trapezoidal Map and a Search structure. [4]
Voronoi Diagram and Delaunay Triangulation: Definition and Basic Properties of Voronoi
Diagram, Computing the Voronoi Diagram: Fortune Sweep Algorithm, Divide and Conquer
Algorithm. Closest pair Problems. Triangulations of Planar Point Sets, The Delaunay
Triangulation, Computing the Delaunay Triangulation. [6]
Geometric Data Structure: Interval Trees, Priority Search Trees, Segment Trees . [4]
TEXT BOOKS:
1. Franco P. Preparata and Michael Ian Shamos, Computational Geometry- An
Introduction, Springer Verlag
2. Mark de Berg, Marc van Kreveld, Mark Overmars, Otfried Cheong, Computational
Geometry
REFERENCE BOOKS:
1. Joseph O' Rourke, Computational Geometry in C, Cambridge University Press
2. Lecture notes on Computational geometry by David Mount
[21]
CODE
CS 712 Mobile Computing 3-0-0 3 S.

BHATTACHRJYA
Introduction: Various issues in mobile computing. [1]
Overview of wireless telephony: Cellular concept. [2]
GSM: Air- interface, channel structure. [2]
Location management: HLR-VLR, hierarchical, handoffs, channel allocation in cellular

systems, CDMA, GPRS. Wireless Networking. [5]
Wireless LAN Overview: MAC issues, IEEE 802.11, Blue Tooth, Wireless multiple access
protocols, TCP over wireless, Mobile IP. [6]
WAP: Architecture, protocol stack, application environment, and applications. Mobile

Agents computing, security and fault tolerance, transaction processing in mobile
computing environment.[6]
Ad Hoc networks, localization, MAC issues: PAMAS, MACA, MACA/BI, BTMA, and
Reduced handshake based MAC protocols. [3]
Routing protocols, global state routing (GSR), Destination sequenced distance vector
routing (DSDV), Dynamic source routing (DSR), Ad Hoc on demand distance vector
routing (AODV), Temporary ordered routing algorithm (TORA), Associativity routing
protocols (ABR), LAR, ZRP, CSGR, WRP.QoS in Ad Hoc Networks and its applications.
[10]
TEXT BOOKS:
1. J. Schiller, Mobile Communications, Addison Wesley.
REFERENCE BOOKS:
1. P.K.Pattnaik and R.Mall, Fundamentals of Mobile Computing, PHI.
2. C. Perkins, Mobile IP, Addison Wesley.

CODE
CS 713 Complex Network Theory 3-0-0 3 S. NANDI
Basic Concepts related to Social Networks

Small world effect, transitivity and clustering, degree distribution, scale free networks,
maximum degree; network resilience; mixing patterns; degree correlations; community
structures; network navigation. [5]
Centrality measures, Node Poularity, Page Rank algorithm, Spectral Graph Theory. [5]
[22]
Community Structure Analysis
Basic concepts of network communities, various community finding approaches like
Girvan-Newman Algorithm, Spectral Bisection Algorithm, Radicchi Edge Clustering
Algorithm (for binary as well as weighted graphs), Wu-Hubermann Algorithm, and Random
Walk based Algorithm. [7]
Random Graphs
Poisson random graphs, generating functions, emergence of giant component, power-law
degree distribution, bipartite graph. [8]
Random walk on Graphs

Limitatios of page rank, pange rank++, HITS, Chinese Whispers, Affinity Propagation
algorithm. [7]
Processes taking place on Networks

Percolation theory and network resilience, Epidemiological processes. [4]
TEXT BOOKS:
1. Guido Caldarelli, Scale-Free Networks, Oxford University Press, Oxford (2007)
2. S. N. Dorogovtsev and J. F. F. Mendes, Evolution of Networks, Oxford University Press,
Oxford (2003)
REFERENCE BOOKS:
1. M. E. J. Newman, The structure and function of complex networks, SIAM Review 45,
167-256 (2003).
2. R. Albert and A. L. Barabasi Statistical mechanics of complex networks. Rev. Mod.
Phys., Vol. 74, No. 1, January 2002.

CODE
CS 714 Distributed Systems. 3-0-0 3 S. ROY
1. Introdution to Distributed Systems. Motivations. Design Issues. [3]
2. Clocks in a Distributed System. Synchronization Issues. Logical Clocks. Causal

relationships. Vector Clocks. [2]
3. Distributed State Detection. Global State. Consistent Cut. Global State recording
algorithm.Termination Detection. Credit based algorithm. Diffusion Computation
based algorithm. [3]
4. Distributed Mutual Exclusion. Token based and non-token based algorithms. [2]
5. Deadlocks in Distributed Systems. Resource allocation Models. Deadlock

Prevention. Deadlock Avoidance – Safe states. Deadlock detection and
Correction. Phantom Deadlocks. Centralized, Distributed and Hierarchical
deadlock detection algorithms. [5]
6. Fault Tolerance. Classes of Faults. Byzantine faults and Agreement
[23]
Protocols.Distributed Commit Protocols. 2-phase commit. 3-phase commit.Election
Algorithms. Bully algorithm. Ring topology algorithm.Fault recovery. Backward and
Forward recovery. Log based recovery. Checkpoints. Shadow paging.Data
Replication. Quorum Algorithms. [10]
7. Distributed File systems. Mechanisms. Stateful and Stateless servers. Scalability.

Naming and Name Servers. [5]
8. Distributed Scheduling. Load Balancing. Load Estimation. Stability. Process

Migration.Remote Procedure Calls. Transparency. Binding. [5]
TEXT BOOKS:
1. Advanced Concepts in Operating Systems. Singhal and Sivaratri. McGraw Hill.
REFERENCE BOOKS:
1. Operating Systems : A Concept Based Approach. Dhamdhere. McGraw Hill.
2. Distributed Operating Systems : Concepts and Design. P.K.Sinha. Prentice Hall.

CODE
CS 715 Cryptography & Network 3-0-0 3 B. SEN

Security
Introduction: Basic objectives of cryptography, secret-key and public-key cryptography,

cryptanalysis, attack models, classical cryptography. Block ciphers: Modes of operation,
DES and its variants(triple DES), RCS, IDEA, Blowfish, AES. [6]
Stream ciphers: Stream ciphers based on linear feedback shift registers, SEAL,
unconditional security. Public-key parameters: Modular arithmetic, gcd, primality testing,
Chinese remainder theorem, modular square roots, finite fields. [6]
Hash Function: Properties of hash functions, MD2, MD5 and SHA-1, keyed hash
functions, attacks on hash functions. [5]
Public-key encryption: RSA, Rabin and EIGamal schemes, side channel attacks. Key
exchange: Diffie-Hellman and MQV algorithms, Chinese remainder theorem, Intractable
problems: Integer factorization problem, RSA problem, modular square root problem,
discrete logarithm problem, Diffie-Hellman problem, known algorithms for solving the
intractable problems. [8]
Digital signatures: RSA, DAS and NR signature schemes, blind and undeniable
signatures. Entity authentication: Passwords, challenge-response algorithms, zero-
knowledge protocols. Standards: IEEE, RSA and ISO standards. [5]
Network issues: Certification, public-key infrastructure (PKI), secured socket layer (SSL),
Kerberos. Advanced topics: Elliptic and hyper-elliptic curve cryptography, number field
sieve, lattices and their applications in cryptography, hidden monomial cryptosystems,
cryptographically secure random number generators. [6]
TEXT BOOKS:
1. Cryptography and Network security by William Stallings – Pearson Education Publisher
2. Cryptography and Network security by Forouzan - Tata McGraw-Hill Education
[24]
REFERENCE BOOKS:
1. Cryptography and Network security by Atul Kahate - Tata McGraw-Hill Education

CODE
CS 720 Principles of Programming 3-0-0 3 B. SEN

Languages
Introduction: Overview of different programming paradigms e.g. imperative, object

oriented, functional, logic and concurrent programming. [5]
Syntax and semantics of programming languages:A quick overview of syntax specification

and semiformal semantic specification using attribute grammar. [3]
Imperative and OO Languages: Names, their scope, life and binding. Control-flow, control
abstraction; in subprogram and exception handling. Primitive and constructed data types,
data abstraction, inheritance, type checking. [5]
Polymorphism. Functional Languages: Typed-calculus, higher order functions and types,

evaluation strategies, type checking, implementation, case study. [4]
Logic Programming Languages: Computing with relation, first-order logic, SLD-resolution,

unification, sequencing of control, negation, implementation, case study. [5]
Concurrency: Communication and synchronization, shared memory and message

passing, safety and liveness properties, multithreaded programs. [8]
Formal Semantics: Operational, denotational and axiomatic semantics of toy languages,

languages with higher order constructs and types, recursive type, subtype, semantics of
nondeterminism and concurrency. [5]
TEXT BOOKS:
1. Glynn Winskel, A Formal Semantics of Programming Languages: An Introduction, MIT
Press.
REFERENCE BOOKS:
1. John C. Mitchell, Foundations for Programming Languages, MIT Press.

CODE
CS 721 CAD for VLSI 3-0-0 3 S. ROY
VLSI Design cycle. Design styles. System packaging styles. Fabrication of VLSI devices.
Design rules-overview. [2]
Scheduling in High Level Synthesis. ASAP and ALAP schedules. Time constrained and
Resource constrained scheduling. ILP Method. Force directed heuristic method. Iterative
refinement method. List scheduling. Simulated annealing approach. Relaxing Constraints.
[25]
[5]
Allocation and Binding. Datapath Architectures and Allocation tasks. Greedy approach.
Clique Partitioning Approach. Left-Edge algorithm. Weighted Bipartite Matching approach.
Iterative refinement approach. [5]
Partitioning. Clustering techniques. Group Migration algorithms. KL Algorithm. FM

Algorithm. Min-Cut partitioning. Simulated annealing algorithms. [3]
Floorplanning and Pin Assignment. Constraint based Floorplanning. Rectangular

Dualization. Hierarchical Tree based methods. Simulated Evolution approaches. Timing
Driven floorplanning. Design Style specific pin assignment problems. Channel pin
assignment. [5]
Placement. Simulation based placement algorithms. Partitioning based placement

algorithms. [3]
Global Routing. Maze Routing algorithms. Line probe algorithms. Shortest Path based
algorithms. Steiner’s Tree based algorithms. [4]
Detailed Routing. Channel Routing Algorithms. Switchbox Routing. Over-the-cell routing.

Clock and Power Routing. [4]
TEXT BOOKS:
1. Algorithms for VLSI Physical Design Automation. N.A.Sherwani. Kluwer Academic
Publishers.
2. High-Level Synthesis: Introduction to Chip and System Design. Gajskiet. al. . Kluwer
Academic Publishers.
REFERENCE BOOKS:
1. VLSI Physical Design Automation. Sadiq M. Sait and Habib Youssef. Kluwer Academic
Publishers.
2. Algorithms for VLSI Design Automation. Sabih H. Gerez. Wiley India

CODE
CS 722 Advanced Graph Theory 3-0-0 3 S.

BHATTACHRJYA
Preliminaries: Graphs, isomorphism, automorphism, components, sub-graphs, degree,

operations on graphs, degree sequences, radius, diameter, bipartite graph. [8]
Connected graphs and shortest paths: Walks, trails, paths, connected graphs, distance,
cut-vertices, cut-edges, blocks, connectivity, weighted graphs, Menger’s theorem. [6]
Trees: Characterizations, number of trees, minimum spanning trees, Distance between

spanning tree of a connected graph, eccentricity, Centre(s) of trees and connected graph,
diameter of tree and connected graph, enumeration of trees, counting tree, labelled graph.
[26]
[2]
Planarity: Planar graph, Kuratowski’s theorem, Euler’s formula, Detection of planarity,

duality, Homomorphism, five color problem, four color problem. [4]
Eulerian graphs: Characterization, Arbitrarily traceable graph, Fleury’s algorithm. [4]
Hamilton graphs: Necessary conditions and sufficient conditions. [4]
Independent sets, Matching: Basic equations, matching in bipartite graphs, perfect

matching, maximal matching, minimum matching, Hall’s theorem. [4]
Factorization :Factor, k-factor, Tutte’s theorem. [2]
Vertex coloring: Chromatic number and cliques, greedy coloring algorithm, Brook’s
theorem, chromatic partition, Uniquely colourable graph. [4]
Edge coloring: Gupta-Vizing theorem, color edge, equitable edge-coloring. [2]
Directed graphs: Out-degree, in-degree, connectivity, orientation, Eulerian directed

graphs, Hamilton directed graphs, tournaments. [4]
TEXT BOOKS:
1. Graph Theory by N. Deo
2. Advanced Graph Theory by R. Deistel
REFERENCE BOOKS:
1. An Introduction to Graph Theory by S. Pirzaha
2. Introduction to Graph Theory by R.J.Wilson

CODE
CS 723 Internet Technologies 3-0-0 3 S. SADHU
Introduction: Design and Evolution of Internet :Internet as a whole - Routers, Switches,

Bridges, Proxy and their interconnections, The Design of DARPA Internet Architecture ,
Evolution of Internet - Service Provisioning , Design Requirements for Future
Internet/Next-generation Internet Architecture. [5]
Internet - Addressing and Routing: Internet Addressing - IPv4 and Ipv6, Internet Proxy,
Autonomous Systems (AS), Intra-AS Routing – OSPF, Inter-AS Routing – BGP. [5]
Transport Layer Protocols: TCP and its variants, UDP, Quality of Service (QoS)
Differentiated and Integrated, Real Time Transmission Protocol (RTP). [5]
Internet Applications: Data Services - HTTP, FTP, Telnet, Email, Chat, Multimedia
Services - VoIP, VoD. [5]
World Wide Web: Web Scripting - HTML and CGI, JavaScript, DHTM, XML, Multilingual
Internet. [5]
[27]
Internet Security: Symmetric and Asymmetric Key Encryption, Digital Signatures,
Authentication, HTTPS, SSH/SSL/TLS, Firewall. [5]
Next Generation Internet Architecture : Mobile Internet, Content Delivery Network (CDN),
Named Data Networking (NDN), Software Defined Networking (SDN), Internet-of-Things
(IoT), Context Aware Computing. [5]
TEXT BOOKS:
1. Internet and World Wide Web How to Program- by H. M. Dietel and P. J. Dietel
REFERENCE BOOKS:
1. TCP/IP Tutorial and Technical Overview, (IBM Redbook) - Download From
http://www.redbooks.ibm.com/abstracts/gg243376.html
2. TCP/IP Guide, Charles M. Kozierok, Available Online - http://www.tcpipguide.com/

CODE
CS 724 Parallel Computing 3-0-0 3 M. DALUI
Introduction: Implicit parallelism, Memory system performance, control structure,

communication model, physical organization, Routing mechanisms for interconnection
networks. [5]
Parallel algorithm design: Preliminaries, decomposition techniques, tasks and interactions,

mapping techniques for load balancing, parallel algorithm models. [5]
Analytical modeling of parallel programs: sources of overhead, performance metrics, the

effect of granularity on performance, scalability of parallel systems, minimum execution
time, minimum cost-optimal execution time, asymptotic analysis of parallel programs. [5]
Programming using message passing paradigm: Principles, building blocks, MPI,

Topologies and embedding, Overlapping communication and computation, collective
communication operations, Groups and communicators Programming shared address
space platforms: Threads, POSIX threads, Synchronization primitives, attributes of
threads, mutex and condition variables, Composite synchronization constructs, OpenMP
Threading Building blocks. [5]
An Overview of Memory Allocators, An overview of Intel Threading building blocks. Dense

Matrix Algorithms: matrix vector multiplication, matrix-matrix multiplication, solving system
of linear equations. [5]
Sorting: Sorting networks, Bubble sort, Quick sort, Bucket sort and CO1 Design and
analyze the parallel algorithms for real world problems and implement them on available
parallel computer systems. [4]
Design algorithms suited for Multicore processor systems using OpenCL, OpenMP,
Threading techniques. [3]
[28]
Graph algorithms: Minimum spanning tree, single source shortest paths, all-pairs shortest
paths, Transitive closure, connected components, algorithms for sparse graphs. [3]
TEXT BOOKS:
1. Ananth Grama, Anshul Gupta, George Karypis, Vipin Kumar : Introduction to Parallel
Computing, Second Edition Pearson Education – 2007
2. Michael J. Quinn (2004), Parallel Programming in C with MPI and OpenMP McGraw-Hill
REFERENCE BOOKS

CODE
CS 725 DATA MINING AND DATA 3-0-0 3 G. SARKER

WAREHOUSING
Data Warehousing: Multidimensional Data Model, Dimension Modelling, OLAP

Operations, Slicing and Dicing, Warehouse Schema, Star Schema, Snowflake Schema,
Advantages and Disadvantages of Snowflake Schema, Data Warehousing Architecture,
Virtual Data Warehouse, Advantages and Disadvantages of Virtual Data Warehouse,
Metadata, Types of Metadata, OLAP Engine, Different Options for OLAP Engine, Data
Extraction, Data Cleaning, Loading, Refreshing. [4]
Data Mining: Different Definitions of Data Mining, KDD vs. Data Mining, Stages of KDD ,
DBMS vs. DM, AI vs. DM, Classifications of Data Mining, Stages of KDD, DM Techniques
, Discovery Driven Tasks, Classification, Frequent Episodes, Discovery of Association
Rules , Clustering, Deviation Detection, Mining Problems, Applications of DM, Other
Mining Problems. [4]
Association Rules: Item set, Support, Confidence, Problem Decomposition, Frequent Item
Set, Maximal Frequent Set, Border Set, Applications of Data Mining, Spotting Fraudulent
Behaviour, Astronomy etc., Association Rules, Informal a priori Algorithm for Learning
Association Rules, Finding Frequent Sets and Association Rules, Formal a priori Algorithm
for Association Rule. [4]
Classification – Pattern: Labelled Pattern, Approaches of Classification, Evaluation of

Classifiers, Normalized Confusion Matrix, Accuracy, Precision, Recall and F – score,
Cross Validation Technique, Classification Techniques. [3]
Decision Trees: Inductive Learning, ID3 Program, Algorithm for Building Decision Trees ,
Advantages of Decision Trees for Classification Purpose, Development of Decision Trees
for Different Training Data Sets, Rule Extraction from Pattern Set, Covering the instances,
Extraction of rules, Instance Space, Covering Algorithm. [4]
Bayesian Belief Nets (DAG): K nearest Neighbour, ANN, Learning in ANN, Perceptron as
a model of neuron, Single and multiplayer Perceptron for classification and knowledge
representation, Back propagation Network, Supervised, Reinforcement and Unsupervised
Learning. [3]
Classification (Complex): Support Vector Machine (SVM), Generalization Error, SVM to

find out the best classification, Margin. [2]
[29]
Clustering: Partitioned and Hierarchical Clustering, k means Clustering, Fast k Means
Clustering, Fuzzy K means Clustering, Hierarchical Clustering, Agglomerative and Divisive
Hierarchical Clustering, Single Linkage, Complete Linkage and Average Linkage
Clustering. [4]
Clustering (Complex): Outlier Detection, Outlier vs. Cluster, Types of Outliers, Outlier
Detection Methodologies, Supervised, Unsupervised and Semi supervised detection ,
Statistical Approaches, Parametric and Non Parametric Methods, Proximity Based
Methods, Clustering Based Methods. [4]
Temporal and Spatial Data Mining: Temporal Data Mining, Tasks involved, Temporal
Association Rules, Sequence Mining, Episode Discovery, Spatial Mining, Tasks involved ,
Spatial Clustering. [2]
Web Mining: Web Mining Techniques, Web Content Mining, Web Structure Mining, Web
Usage Mining, Text Mining. [2]
TEXT BOOKS:
1. Data Mining Techniques – Arun K Pujari – Universities Press
2. Data Mining – Vikram Pudi, P. Radha Krishna – Oxford University Press
REFERENCE BOOKS:
1. Data Mining – J. Han, M. Kamber, J. Pei -- Elesvier
2. Data Mining – Hand, Mannila and Smith – PHI

CODE
CS 810 Computer Graphics 3-0-0 3 G. SANYAL
Introduction, Different types of input/output devices, Raster, Raster Scan Display. [5]
Line drawing algorithm, Circle and Ellipse drawing algorithm, other types of line and curve
Drawing algorithm. [5]
2D and 3D transformations, Rotation, Translation, Scaling, Affine, Shear Transform

Reflection. [5]
Projections- Perspective and Parallel projection, Vanishing point, Composite transform. [5]
Clipping algorithms, Visibility, Intersection of a given object and 3D line. [5]
Curves, Beizer, B-Spline, Hermetite curves. [5]
Different filling algorithms, Boundary detection algorithm, Painters algorithm. [5]
TEXT BOOKS:
1. Computer Graphics by Harn and Baker
2. Computer Graphics F Folley
[30]
REFERENCE BOOKS:
1. Interactive Graphics – F W Newman.

CODE
CS 811 BIOMETRICS 3-0-0 3 D. R. KISKU
Introduction of Biometric traits and its aim, image processing basics, basic image
operations,filtering, enhancement, sharpening, edge detection, smoothening,
enhancement,thresholding, localization. Fourier series, DFT, inverse of DFT. [8]
Biometric system, identification and verification. FAR/FRR, system design

issues.Positive/negative identification. Biometric system security, authentication protocols,
matchingscore distribution, ROC curve, DET curve, FAR/FRR curve. Expected overall
error, EER,biometric myths and misrepresentations. [8]
Selection of suitable biometric. Biometric attributes, Zephyr charts, types of multi

biometrics.Verification on multimodal system, normalization strategy, Fusion methods,
Multimodalidentification. [8]
Biometric system security, Biometric system vulnerabilities, circumvention, covert

acquisition,quality control, template generation, interoperability, data storage. Recognition
systems:Face, Signature, Fingerprint,Ear, Iris etc. [10]
TEXT BOOKS:
1. Guide to Biometrics,By: Ruud M.Bolle,SharathPankanti, Nalini K. Ratha,Andrew
W.Senior, Jonathan H. Connell,Springer 2009
2. J. Wayman, A. K. Jain, D. Maltoni, and D. Maio, Biometric Systems: Technology,
Design and Performance Evaluation, Springer-Verlag, 2005
REFERENCE BOOKS:
1. D. R. Kisku, P. Gupta and J. K. Sing (Eds.), "Advances in Biometrics for Secure Human
Authentication and Recognition", CRC Press, Taylor and Francis, pp. 352, 1st Edition,
December 2013
2. M. Nixon and A.Aguodo, Feature Extraction & Image Processing for Computer Vision,
3rd Edition, 2012

CODE
CS 812 Information Coding Theory 3-0-0 3 G SANYAL
Introduction to security and privacy, Number theory, Formal analysis and design of
algorithms and protocols, Provably security, Cryptosystems. Privacy, Foundations of
privacy. [5]
Definitions and early uses, Privacy regulations, Noiseless differential privacy, Privacy
preserving, Data mining techniques. Measuring compliance with security and privacy
regulations and standards. [5]
[31]
Security and Privacy Metrics. Physical security, IT security, Personal Security, Operational
security. Security and privacy in social networks, Measurement of user behavior in social
networks. [10]
Different techniques of Information Hiding- Steganography, Watermarking,

steganoanalysis. [5]
An effective user user-driven framework for selection of social networks, security aspect.
[5]
Firewalls and its Implementations. [5]
TEXT BOOKS:
1. J. Thomas Shaw, “Information Security Privacy”, ABA, 2012.
2. Matthew Bailey, “Complete Guide to Internet Privacy, Anonymity and Security”, Nerel
Online, 2011.
REFERENCE BOOKS:
1. D. S. Herrmann, “A complete guide to security and privacy metrics”, Auerbach Publisher
(Taylor and Francis Group), 2007
2. A. Abraham, “Computational Social Networks: security and privacy”, Springer, 2012

CODE
CS 813 OPTICAL NETWORKS 3-0-0 3 T. DE
Introduction: Optical fiber principles, Optical transmission system, Wavelength Division

Multiplexing(WDM), Optical Network Architectures, Different issues in wavelength routed
networks. [6]
Routing and Wavelength Assignment (RWA) algorithms: Route Selection algorithms –

Fixed Routing, Fixed Alternate Routing, Exhaust Routing, Least Congested Path Routing,
Limited alternate Routing. Wavelength selection algorithms. Joint wavelength-Route
selection algorithm. [4]
Virtual Topology Design: Physical and Virtual topology, Traffic routing over virtual
topology, Limitations on virtual topology, Virtual topology problem formulation, Virtual
topology design heuristics. [5]
Wavelength Convertible Networks: Need for Wavelength Converters, Wavelength

convertible Switch Architecture, Routing in Convertible Networks, Performance Evaluation
of Convertible networks, Network with Sparse Wavelength Conversion, Converter
Placement problem. [5]
Wavelength Rerouting Algorithm: Benefits of wavelength rerouting, Issues in wavelength

rerouting, Rerouting algorithms. [4]
Traffic Grooming: Benefits of traffic grooming, Node architecture, Problem formulation,
[32]
Traffic grooming algorithms for Ring and Mesh WDM networks. [4]
Optical Multicast Routing: Multicast routing problem, architecture of Light spliting node and
MI node, Network with full splitting and sparse splitting, Multicast routing and wavelength
assignment based on lightpath, light-tree. [4]
TEXT BOOKS:
1. WDM OPTICAL NETWORKS Concepts, Design and algorithms -- C. Siva Ram Murthy
and Mohan Gurusamy (PHI)
2. OPTICAL COMMUNICATION NETWORKS -- Biswanath Mukherjee (Mc Graw-Hill)
REFERENCE BOOKS:
1. OPTICAL NETWORKS Third Generation Transport Systems -- Uyless Black (Pearson
Education)
2. OPTICAL NETWORKING & WDM -- Walter Goralski (Tata Mc Graw-Hill)

CODE
CS 814 Computer Vision 3-0-0 3 G. SANYAL
The image model and acquisition, image shape, sampling, intensity images, color images,
range images, image capture, scanners. Statistical and spatial operations. [5]
Gray level transformations, histogram equalization, multi-image operations. Spatially

dependent transformations, templates and convolution, window operations, directional
smoothing, other smoothing techniques. [10]
Segmentation and Edge detection, region operations, Basic edge detection, second order
detection, crack edge detection, edge following, gradient operators, compass & Laplace
operators. [5]
Representation and Description, Object Recognition, 3-D vision and Geometry, Optical
flow. [10]
3D Motion planning, Image feature selection and classifications using machine learning
Algorithm. [5]
TEXT BOOKS:
1. D. A. Forsyth, J. Ponce, Computer Vision: A Modern Approach, PHI Learning 2009.
2. Milan Soanka, Vaclav Hlavac and Roger Boyle, Digital Image Processing and Computer
Vision, Cengage Learning.
REFERENCE BOOKS:
1. R.C. Gonzalez and R.E. Woods, Digital Image Processing, Pearson Education
[33]
CODE
CS 815 Dependable Computing 3-0-0 3 M. DALUI
Overview of Dependability Notion of dependability, its definition, attributes (availability,

reliability, safety, security, maintainability) and measurements as well as related concepts
such as errors, faults and hazard. [6]
Fault Avoidance and Fault Elimination Role of specification (the Z language), programming
standards, inspection and testing. [5]
Fault Tolerance, Fault detection, masking, containment, location, reconfiguration and

recovery, redundancy.[7]
Secure Issues in E-commerce, E-commerce security breaches, including Internet Fraud

and Espionage, Secure Electronic Transactions (SET), the iKP protocols. [6]
Advanced Topics, Dependability evaluation techniques and tools: fault trees, Markov
chains; fault tolerance in distributed systems; Information Redundancy. [6]
Risk Analysis, Disaster Recovery, Emergency Management; Security Policies,

Procedures, Frameworks. [5]
TEXT BOOKS:
1. Fundamentals of Dependable John KnightChapman & Hall/CRC
REFERENCE BOOKS:
1. Fault Tolerance: Principles and Practice: Peter A. Lee, Thomas Anderson Springer
Volume 3 (Dependable Computing and Fault-Tolerant Systems)

CODE
CS 820 Testing and Verification of 3-0-0 3 S. ROY

VLSI Circuits
Introduction to VLSI testing and verification. Logic and Event Driven Simulation. Delay
Models. [3]
Fault Modeling. Single Stuck-at Fault model. Fault Collapsing. Fault Equivalence. Fault
Domination. Checkpoint Theorem. [3]
Fault Simulation. Serial, Parallel, Deductive and Concurrent. [2]
Test Generation. Boolean Difference Method. D-Algorithm. PODEM. FAN. [5]
Testability Analysis. [2]
Design for Testability. Adhoc approaches. Scan based Design. Random Scan. Scan FF
design. LSSD. Scan-Hold FF. [5]
[34]
Built-in Self Test. Pseudo-Random Pattern Generation. LFSR. [4]
PLA Testing. Memory testing. [4]
Formal verification. System Model. Temporal logics.Model Checking. BDD. Symbolic

Model Checking. Bounded Model Checking. [4]
TEXT BOOKS:
1. Essentials of Electronic Testing for Digital, Memory and Mixed Signal VLSI Circuits.
Bushnell and Agrawal. Kluwer Academic Publishers.
2. Digital Systems Testing and Testable Design. Abramovici et.al. Jaico Publications.
REFERENCE BOOKS:
1. Model Checking. Clarke et. al. MIT Press.
2. VLSI Test Principles and Architectures. LT Wang et.al. Morgan Kaufman.

CODE
CS 821 PATTERN RECOGNITION 3-0-0 3 G SARKER
Pattern and Pattern Class: Design of a Pattern Recognition System, Syntactic and
Decision Theoretic Approach, Bayesian Decision Theory, Continuous Features, Error,
Risk and Loss. [5]
Parametric and Non Parametric Methods: Histogram Method – Kernel Based Methods – K
- Nearest Neighbor Method -- Probabilistic Neural Network base on Parzon Window –
PNN Learning. [4]
Basics of ANN: Instar, Outstar, Groups of Instar and Outstar, Different types of Memories.
[1]
PR Tasks: PR Problems, Different PR Tasks by FF, FB and Competitive Learning

Network, Pattern Clustering, Feature Mapping Problem, Different Feature Mapping
Network, Self Organizing Network. [5]
FF ANN: Pattern Association Network, Hebb’s Law, Pattern Classification Network. [2]
FB ANN: Pattern Association, Pattern Storage, Pattern Environment Storage, Auto

association , Hopfield Network, Capacity and Energy of a Hopfield Network, State
Transition Diagram, Stochastic Network and Boltzmann Machine. [5]
Competitive Learning Network: Pattern Storage, Pattern Clustering Network, Minimal

Learning, Malsburg Learning and Leaky Learning. [2]
Complex PR Tasks: RBF, RBF Network for Pattern Classification, Advantages of RBF
over MLFF ANN, CPN Network. [2]
Single and Multilayer Network: Gradient Descent Procedure, Newton’s Algorithm, Fixed
[35]
Increment Learning, Variable Increment Learning, Support Vector Machine(SVM),
Multilayer Neural Networks, Unsupervised Learning. [ 5]
Temporal Pattern Recognition: Concepts, Problems in temporal sequence, Architecture for

temporal PR Tasks, Avalanche Structure, Jordon Network, Fully Connected Recurrent
Network, Difference between Avalanche Network and Jordon Network. [4]
Similarity Measures: Mahalanabis Distance, Properties of Metrics, Minkowski Metric,

Manhattan / City Block / L1 norm, Euclidean Distance L2 Norm, Maximum Value Distance
L∞ Norm, Hamming Distance L1 norm. [4]
TEXT BOOKS:
1. Pattern Classification – Duda, Hart & Stork – J. Wiley & Sons.
2. Artificial Neural Networks – B. Yegnanarayana – PHI
REFERENCE BOOKS:
1. Neural Networks for Pattern Recognition – C.M. Bishop – Oxford

CODE
CS 822 EMBEDDED SYSTEMS 3-0-0 3 B. SEN
Introduction to Embedded Systems - definitions and constraints; hardware and processor

requirements; special purpose processors. [8]
Input-output design and I/O communication protocols; design space exploration for
constraint satisfaction. [8]
Co-design approach; example system design; Formal approach to specification.

Specification languages; specification refinement and design; design validation. [8]
Real Time operating system issues with respect to embedded system applications; time
constraints and performance analysis. [8]
TEXT BOOKS:
1. Peter Marwedel, Embedded System Design, Kluwer.
2. Wayne Wolf, Computers as Components: Principles of Embedded Computing Systems
Design, Morgan-Kaufmann.
REFERENCE BOOKS:
1. Frank Vahid and Tony Givargis, Embedded System Design: A Unified
Hardware/Software Introduction, John Wiley

CODE
CS 823 High performance Computing 3-0-0 3 G. SANYAL
Introduction: Implicit parallelism, Memory system performance. [2]
[36]
Parallel algorithm design: Preliminaries, decomposition techniques, tasks and interactions,
load balancing, methods for reducing interaction overheads, parallel algorithm models. [4]
Basic communication operations: Meaning of all-to-all, all-reduce, scatter, gather, circular

shift and splitting routing messages in parts. [3]
Analytical modeling of parallel programs: sources of overhead, performance metrics, the

effect of granularity on performance, scalability of parallel systems, minimum execution
time, minimum costoptimal execution time, asymptotic analysis of parallel programs. [6]
Programming using message passing paradigm: Principles, building blocks, MPI,

Topologies and embedding, Overlapping communication and computation. [5]
Programming shared address space platforms: Threads, POSIX threads, Synchronization

primitives, attributes of threads, mutex and condition variables, Composite synchronization
constructs, OpenMP Threading Building blocks; An Overview of Memory Allocators, An
overview of Intel Threading building blocks; An Overview of Brief History of GPUs; An
Overview of GPU Programming; An Overview of GPU Memory Hierarchy Features;
Introduction to Heterogeneous Computing – OpenCL; The OpenCL Kernel, The OpenCL
Memory Model, The OpenCL Execution Model; OpenCL Platform and Devices; OpenCL
Execution Environment, An Overview of OpenCL API. [7]
Heterogeneous Programming in OpenCL An Overview of CUDA enabled NVIDIA GPUs,

Introduction to CUDA C, Parallel Programming in CUDA C; Dense Matrix Algorithms:
matrix vector multiplication, matrix-matrix multiplication, solving system of linear equations,
Sorting: Sorting networks, Bubble sort, Quick sort, Bucket sort and other sorting algorithms
Graph algorithms: Minimum spanning tree, single source shortest paths, all-pairs shortest
paths, Transitive closure, connected components, algorithms for sparse graphs [8]
TEXT BOOKS:
1. Ananth Grama, Anshul Gupta, George Karypis, Vipin Kumar : Introduction to Parallel
Computing, Second Edition Pearson Education, 2007
2. Benedict R Gaster, Lee Howes, David R Kaeli Perhaad Mistry Dana Schaa,
Heterogeneous Computing with OpenCL McGraw-Hill, Inc. Newyork , 2011
REFERENCE BOOKS:
1. Michael J. Quinn, Parallel Programming in C with MPI and OpenMP McGraw-Hill
International Editions, Computer Science Series, 2004
2. Jason Sanders, Edward Kandrot, CUDA By Example – An IntroJason Sanders, Edward
Kandrot, CUDA By Example – An Introduction to GeneralPurpose GPU Programming,
Addison Wesley, 2011.

CODE
CS 824 Advanced Algorithms 3-0-0 3 M DALUI
Network Flow: Flow networks, Augmenting paths, Ford-Fulkerson Algorithm, Edmonds-
[37]
Karp algorithm, Push-relabel algorithm, Maximum bipartite matching, Hopcroft-Karp
algorithm. [6]
Linear Programming: Framework, Simplex algorithm, Duality, LP rounding and vertex
cover, Randomized LP rounding. [5]
String Algorithms: Rabin-Karp and finite automaton algorithm, Knuth-Moris-Pratt algorithm.

[5]
Approximation Algorithms: Vertex-cover and TSP, TSP with 1.5-approximation, Set-cover,

Subset-sum. [5]
Randomized Algorithms: Approx weighted vertex cover, Randomized max 3-SAT,
Probabilistic Maxcut, Derandomization of Maxcut, Radomized MST, Randomized median
finding. [5]
Numerical Algorithms: Matrix multiplication, Operations on polynomials, DFT and FFT
algorithm. [5]
Geometric Algorithms: Some preliminaries, Convex Hull, Segment intersection, Closest-

pair, Voronoi-Delaunay diagrams. [6]
TEXT BOOKS:
Prentice Hall India
REFERENCE BOOKS:
1. Mark de Berg, Mark van Kreveld, Mark Overmars and Otfried Shwarzkopf (Cheong),
Computational Geometry: Algorithms and Applications, Third edition, Springer-Verlag,
2008
2. Vijay V Vazirani, Approximation Algorithms, Springer-Verlag, 2001

CODE
CS 825 Functional and Logic 3-0-0 3 S ROY

Programming
Programming paradigms: terminology, procedural and declarative aspects of

programming, expressions vs. commands. [5]
Principles of functional programming: expressions, evaluations, functions, and types. Type

definitions and built-in types: numbers, characters, strings and lists. [5]
Functional programming: functions as first class objects, data types, list, applicative list
processing, recursion, lambda functions, closures. [10]
Logic programming: clause (fact, rule, goal), declarative and procedural aspects of logic
programming, list processing, recursion, control structures in Prolog (cut, negation, inputs,
outputs, repetition). [10]
[38]
Real examples of application of functional and logic programming. [5]
TEXT BOOKS:
1. Ivan Bratko. Prolog Programming for Artificial Intelligence, third edition, Addison-
Wesley, 2001.
2. Lisp, by Guy L. Steele
REFERENCE BOOKS:
1. ANSI Common Lisp by Paul Graham. Prentice Hall, 1996
2. Lisp, by Patrick Henry Winston and Berthold Horn

CODE
CS 541 Data Structures 3-0-0 3 M. DALUI
Introduction to Data Structures:Data, Data Types, String, Abstract Data Type (ADT) and
Data structures with examples. [3]
Linear Data Structure:
Arrays: Single and multi-dimensional arrays, Row and Column major Representation of
matrices, sparse matrices. [2]
Linked List: Creation, Display, Insertion and Deletion (in front, at end, and before and after
a specific node), Summation, average, maximum, minimum, Searching, Sorting,
Concatenation of two list (Circular and non-Circular),Doubly linked list, Application of
Linked List - polynomial, sparse matrix. [5]
Stack: Stack as an ADT, Stack operation, Array Representation of Stack, Link

Representation of Stack, Applications:Recursion, Function call, Conversion from infix to
postfix notation, Evaluation of postfix expression. [6]
Queue: Queue as an ADT, Queue operation, Array Representation of Queue and its
disadvantages, Linked Representation of Queue, Circular Queue, Priority Queue and its
applications[3]
Non-linear Data Structure:
Tree: Basic trees concept, Binary tree representation, Binary tree operation, Binary tree
traversal, (Preorder, Inorder and Postorder), Copying a Tree, checking equivalency
between two Trees. [3]
Binary search tree (BST): Creation, search, insertion, and deletion. [3]
Sorting and Searching:
Sorting: Bubble sort, Selection sort, Insertion sort, Quick Sort. [7]
Searching: Sequential search, Binary search. [3]
TEXT BOOKS:
[39]
REFERENCE BOOKS:
1. Data Structure using C & C++, Angenstein&Tanenbaum, PHI.
2. An introduction to Data Structure, Trembly& Sorensen, MCHILL.

CODE
CS 542 Computer Organization 3-0-0 3 B. SEN
Introduction: Evolution of computers, Hierarchical levels of computer system design,

Organization and Architecture: Discussion on the different functional blocks. Data
Representation: Binary numbers, binary codes, fixed point representation, floating point
representation, error detection codes. Introduction to Assembly language, Memory Units,
Addressing methods: Memory location, instruction formats, instruction sequencing and
addressing modes. [7]
Fundamental concepts of the processing Unit: Fetching and Storing words, Register
Transfer, Execution of instruction, hardwired controls and Micro operation, Register
transfer language, register transfer, bus and memory transfer, arithmatic microoperations,
logic microoperations, shift microoperations , Arithmetic Logic shift Unit. [6]
Computer Organization and Design: Instruction codes, computer registers, computer

instructions, timing & control, instruction cycle, memory reference instructions, input-
output and interrupts, Microprogrammed Control Unit: Micro instruction, Microprogram
sequencing, Input – Output Organization: Different techniques of addressing I/O devices,
modes of data transfer, data transfer over synchronous and asynchronous buses, priority
interrupt, direct memory access, I/O channel. [7]
CPU structure and function: Introduction, general registers organization, stack

organization, Memory Organization: Random and serial access memories, Static &
dynamic RAMs, ROM, Memory Hierarchies: Cache memories; Mapping function,
Replacement Algorithms; Performance consideration; Virtual memory, Memory
Management. [7]
Introduction to microprogramming level micro architecture: Conventional machine level

instruction format and addressing modes. Basic concepts of pipelining: Instruction Queue,
branching, data dependency. Computer Peripherals; Examples of Intel 80X86 processors,
Power PC Family, Motorola 680X0 family. Introduction to file system FAT 16, FAT32,
NTFS. Disk formatting and partitioning. [5]
TEXT BOOKS:
1. Mano, M “Computer System and Architecture”, (3rd edition) Prentice Hall of India,
2. Stallings,W “Computer Organization & Architecture”, fifth edition, 2000 PHI.
REFERENCE BOOKS:
1. P.Pal Choudhury “ Computer Organization and Design” PHI., New Delhi 1994.
2. Hwang & Briggs “ Computer Architecture” International Edition McGraw Hill.
[40]
CODE
CS 543 DATABASE MANAGEMENT 3-0-0 3 P. K. G.

SYSTEMS


[4]
clustered, multi-level, dynamic multi-level(B_tree & B+_tree) concepts, problem solving on

property, scheduling of transactions (serial and serializable). [3]

TEXT BOOKS:
Education.
REFERENCE BOOKS:
[41]
CODE
CS 544 Object Oriented Programming 3-0-0 3 S. NANDI
Introduction: Object oriented programming concepts – objects-classes- methods and

messages-abstraction and encapsulation-inheritance- abstract classes- polymorphism,
Assert macro, Enumerated data type. [4]
Pointer and references in C++, Constant – Pointers, References, new & delete operator,
dynamic allocation. [6]
C++- objects-classes- constructors and destructors, constructor initializer list, :: operator.

[5]
Overloading : Function overloading, Operator overloading - friend functions. [8]
Inheritance – virtual base class, virtual functions- runtime polymorphism. [5]
Templates in C++ : Introduction toStandard template library. [3]
Exception handling. [2]
File handling. [2]
TEXT BOOKS:
1. Thinking in C++ (B. Eckel)
2. Essential C++ (S. Lippman)
REFERENCE BOOKS:
1. Effective C++ (S. Meyers)
2. C++ Programming Language (B. Stroustrup)

CODE
CS 545 Algorithm Design and Analysis 3-0-0 3 S SADHU
Introduction and basic concepts - Algorithm, Asymptotic notations (big-Oh, big Omega,
Theta, small-oh) and their significance, introduction to RAM model of computation,
complexity (Time Complexity, Space Complexity) analysis of algorithms. Solving
Recurrences – Substitution method, Recurrence tree method and Master Method, Finding
maximum and minimum. [9]
Searching: Binary search trees, balanced binary search trees- AVL trees. [5]
Divide and conquer Problem – Multiplication of two n-bit integers. [2]
Sorting: Comparison based sorting- quick sort, heap sort, merge sort. Decision tree model
[42]
and (worst case) lower bound on sorting. [5]
The Greedy Algorithm- Interval scheduling, Interval partitioning, Fractional Knapsack

Problem. [4]
Dynamic Programming - Matrix Chain Multiplication, 0-1 Knapsack Problem. [4]
Backtracking Method, Branch and Bound Method. [2]
Graph Algorithm : Depth First Search, Breadth First Search, Dijkstra's Single Source
Shortest Path algorithm; Minimum Spanning Tree. [5]
TEXT BOOKS:
Prentice Hall India
2. J. Kleinberg and Eva Tardo, Algorithm Design by Pearson Education (Indian edition)
REFERENCE BOOKS:

CODE
CS 841 Soft Computing 3-0-0 3 T. PAL
Fuzzy Logic-I (Introduction)

Introduction of Soft Computing Methods,Overview of Crisp Sets, Concepts of Fuzzy sets,
Representation of fuzzy sets/Membership functions, Basic operations on fuzzy sets,
Properties of fuzzy sets, Fuzzy and Crisp relations, Operations on Fuzzy Relations: Max-
Min Decomposition. [6]
Fuzzy Logic –II (Fuzzy Rules & Approximate Reasoning)

Fuzzy if-then rules: M-A and TSK Rules, Fuzzifications and Defuzzifications, Fuzzy
Inferencing /Approximate Reasoning, Applications: Pattern Recognition, Image Processing
and Controller. [4]
Neural Networks-1 (Introduction & Architecture)

Introduction of neural networks: Neuron, Nerve structure and synapse, Artificial Neuron
and its model, activation functions, Neural network architecture: single layer and multilayer
feed forward networks, recurrent networks. Learning methods; perception and
convergence rule. [4]
Neural Networks-II (Back propagation networks)

Architecture: perceptron model: single layer and multilayer perceptron, back propagation
learning, factors affecting back propagation training, RBF networks, Hopfield network, self-
organizing feature maps, Applications ofANN. [8]
Genetic Algorithm (GA) –I (Introduction)

Evolutionary Computing, Basic concepts and working principle of simple GA (SGA),
Genetic Operators: Selection, Crossover and Mutation, flow chart of SGA, Encoding &
[43]
Decoding, Population Initialization, Objective/fitness Function, Applications: TSP. [6]
Genetic Algorithm (GA) –II (Multi-objective Genetic Algorithm (MOGA))

Conflicting objectives, Objective space and variable space, Domination, Pareto front,
Pareto Set, NSGA-II: Non-domination Sorting, Crowding distance operator. [5]
Introduction to Hybrid Systems

Integration of neural networks, fuzzy logic and genetic algorithms. [2]
TEXT BOOKS:
1. S. Rajsekharanand and VijayalakshmiPai, “Neural Networks, Fuzzy Logic and Genetic
Algorithm: Synthesis and Applications”, Prentice Hall of India.
2. Kumar Satish, “Neural Networks”, Tata Mc. Graw Hill.
REFERENCE BOOKS:
1. B. Yegnanarayana , “Artificial Neural Networks”
2. David E. Goldberg, “Genetic Algorithms in Search, Optimization, and Machine
Learning”, Addison-Wesley Publishing Company

CODE
CS 842 OPERATING SYSTEM 3-0-0 3 S. NANDI
Introduction: Overview of Operating System, abstract view of computer system, basic

computer organization and architecture, operating system structure, kernel concept,
multiprogramming, multitasking, operating system objectives. [3]
Process Management: Process Concept, Process Scheduling, Operations on Processes,

Interprocess Communication, Examples of IPC Systems. [4]
Threads: Overview, Multicore Programming, Multithreading Models, Thread Libraries,

Implicit Threading. [3]
Process Synchronization: Background, The Critical-Section Problem, Peterson’s Solution,

Synchronization Hardware, Mutex Locks, Semaphores, Monitors. [3]
CPU Scheduling: Basic Concepts, Scheduling Criteria, Scheduling Algorithms, Thread

Scheduling, Multiple-Processor Scheduling, Real-Time CPU Scheduling. [4]
Deadlocks: System Model, Deadlock Characterization, Methods for Handling Deadlock,

Deadlock Prevention, Deadlock Avoidance, Deadlock Detection, Recovery. [5]
Memory Management - Main Memory: Background, Swapping, Contiguous Memory

Allocation, Segmentation, Paging, Structure of the Page Table. [4]
Virtual Memory: Background, Demand Paging, Copy-on-Write, Page Replacement,

Allocation of Frames, Thrashing, Memory-Mapped Files. [4]
Protection: Goals of Protection, Principles of Protection, Domain of Protection, Access
[44]
Matrix, Implementation of the Access Matrix, Access Control. [2]
Security: The Security Problem, Program Threats, System and Network Threats,
Cryptography as a Security Tool, User Authentication. [3]
TEXT BOOKS:
1. Operating System Concepts by Abraham Silberschatz, Peter B. Galvin, Greg Gagne,
8th Edition, Wiley, July 2008.
2. Modern Operating System by Andrew S. Tanenbaum, 3rd Edition, Pearson, December
2007.
REFERENCE BOOKS:
1. Operating Systems by DhananjayDhamdhere, 1st Edition, McGraw-Hill Education,
January 2008.
2. Operating Systems by Deitel, Deitel, and Choffnes, Prentice Hall; 3rd Edition, pp. 1272,
2003.

CODE
CS 843 COMPUTER NETWORKS 3-0-0 3 PKG
Introduction of Computer Networks: Basic concepts of computer networks and data

communication, different components of a data communication system, features for a
network design, various types of communications, types of connections (point-to-point and
multipoint), physical topology and its types (mesh, star, bus, ring), types of networks (LAN,
MAN and WAN). [3]
Network Model: Basic concepts of network model, OSI and TCP/IP models, functions in
brief of different layers of OSI model, different levels of addressing. [2]
Physical layer functions: Basic concept of signals, analog and digital signals, various
modulation techniques, various line coding techniques, noise and errors, different types of
transmission media and its applications. [2]
Switching techniques: Basic concepts of a switched networks and its importance, various
switching techniques (circuit, message, datagram approach, virtual circuit networks) with
examples, compare and contrast between various types of switching techniques. [3]
Data link layer functions: Framing, Error control techniques (Parity checking method,
Checksum, Cyclic redundancy check, Hamming code) with examples, Flow control
protocols and its importance, various flow control protocols such as stop-and-wait ARQ,
sliding window (Go-Back-N ARQ and Selective repeat ARQ) protocols,HDLC protocol,
Multiple access techniques and its importance, various multiple access techniques such
as ALOHA, slotted ALOHA, CSMA, CSMA/CD, CSMA/CA, polling, reservation, token
passing, FDMA, TDMA and CDMA techniques. [10]
Network layer functions: IP address and its classification, design of a network with sub
netting concept, IP protocol, transition from IPv4 to IPv6, NAT, ARP and RARP, Routing
and forwarding concepts, classification of routing protocols, distance vector, link state and
[45]
path vector routing protocols, various multicast routing protocols, congestion control
techniques, Quality of Service (QoS) in networks and its improvements. [10]
Transport layer functions: Basic concepts of socket address, socket programing. [3]
Application layer functions: SMTP, HTTP, FTP, WWWand DNS. [2]
TEXT BOOKS:
1. B. A. Forouzan, DATA COMMUNICATIONS AND NETWORKING.
REFERENCE BOOKS:
1. A. S. Tanenbaum, Computer Networks.
2. W. Stallings, Data and Computer Communications.

CODE
CS 844 Software Engineering 3-0-0 3 B SEN
Concept of systems, its characteristics, the product, the process, Methods, Tools,
Software Process modules, Process technology, Project management concepts: People,
The problem, the process and the project. [5]
Software process and project metrics, Software measurement, Software project planning:
Observationon estimating, project planning objectives, software scope, resources, project
estimation, decomposition techniques. [6]
Project scheduling, basic concepts, Relationship between people and effort, defining task
set, refinement of major task, Software quality assurance: Quality concepts, Software
reviews, Software reliability. [6]
Software project analysis, analysis concepts, requirements analysis, analysis methods,

analysis modeling, elements, data modeling, data flow diagrams, and the mechanics of
structures analysis, design concepts and principles. [7]
1. Software testing methods, Testing fundamentals, Test case design, Software Testing
strategies, strategic issues, Unit testing, Integration testing, Validation testing, system
testing. Object-oriented paradigm, concepts, elements of an object model, Management of
Object oriented software projects.object-oriented analysis concepts. [8]
TEXT BOOKS:
1. Software Engineering: A Practitioner's Approach, 5th Ed., Roger S. Pressman, Tata
McGraw Hill, New Delhi, 2001.
2. Software Engineering Concepts, Richard Fairley, Tata McGraw Hill, New Delhi, 2002.
REFERENCE BOOKS:
1. Classical and Object Oriented Software Engineering with C++/Java , 3rd Ed., S.R.
Schach, McGraw Hill International, New York, 1998
[46]
CODE
CS 845 Distributed Systems 3-0-0 3 S. ROY
Introdution to Distributed Systems. Motivations. Design Issues. [3]
Clocks in a Distributed System. Synchronization Issues. Logical Clocks. Causal

relationships. Vector Clocks. [2]
Distributed State Detection. Global State. Consistent Cut. Global State recording
algorithm. Termination Detection. Credit based algorithm. Diffusion Computation based
algorithm. [3]
Distributed Mutual Exclusion. Token based and non-token based algorithms. [2]
Deadlocks in Distributed Systems. Resource allocation Models. Deadlock Prevention.

Deadlock Avoidance – Safe states. Deadlock detection and Correction. Phantom
Deadlocks. Centralized, Distributed and Hierarchical deadlock detection algorithms. [5]
Fault Tolerance. Classes of Faults. Byzantine faults and Agreement Protocols.Distributed

Commit Protocols. 2-phase commit. 3-phase commit.Election Algorithms. Bully algorithm.
Ring topology algorithm.Fault recovery. Backward and Forward recovery. Log based
recovery. Checkpoints. Shadow paging.Data Replication. Quorum Algorithms. [10]
Distributed File systems. Mechanisms. Stateful and Stateless servers. Scalability. Naming
and Name Servers. [5]
Distributed Scheduling. Load Balancing. Load Estimation. Stability. Process

Migration.Remote Procedure Calls. Transparency. Binding. [3]
TEXT BOOKS:
1. Advanced Concepts in Operating Systems. Singhal and Sivaratri. McGraw Hill.
REFERENCE BOOKS:
1. Operating Systems : A Concept Based Approach. Dhamdhere. McGraw Hill.
2. Distributed Operating Systems : Concepts and Design. P.K.Sinha. Prentice Hall.

CODE
CS 331 DATA STRUCTURES 3-0-0 3 D R KISKU
Introduction: Basic terminology, elementary data organization, structure operations,

algorithm, complexity and time-space trade-off. [2]
Arrays: Array definition, representation and analysis, single and multidimensional arrays,
address calculation, application of arrays, character string in c, character string operation,
array as parameters, ordered list, sparse matrices and vectors. [3]
Stacks: Array representation and implementation of stack, operations on stacks: push
[47]
AND pop, array representation of stack, linked representation of stack, operations
associated with stacks, application of stack: conversion of infix to prefix and postfix
expressions, evaluation of postfix expression using stack. [4]
Queues: Array and linked representation and implementation of queues, operations on

queue: create, add, delete, full and empty, circular queues, d-queues and priority queues.
[3]
Linked list: Representation and implementation of singly linked lists, two-way header list,
traversing and searching of linked list, overflow and underflow, insertion and deletion
to/from linked lists, insertion and deletion algorithms, doubly linked list, linked list in array,
polynomial representation and addition, generalized linked list, garbage collection and
compaction. [5]
Trees: Basic terminology, binary trees, binary tree representation, algebraic expressions,
complete binary tree, extended binary trees, array and linked representation of binary
trees, traversing binary trees, threaded binary trees, traversing threaded binary trees,
Huffman algorithm. [3]
Searching and Hashing: Sequential search, binary search, comparison and analysis, hash
table, hash functions, collision resolution strategies, hash table implementation. [4]
Sorting: Insertion Sort, Bubble Sorting, Quick Sort, Merge Sort, Heap Sort, sorting on
different keys, practical consideration for internal sorting. [4]
Binary Search Trees: Binary Search Tree (BST), Insertion and Deletion in BST,
Complexity of Search Algorithm, Path Length, AVL Trees, B-trees. [4]
Graphs: Terminology and representations, graphs and multi-graphs, directed graphs,

sequential representations of graphs, adjacency matrices, traversal, connected component
and spanning trees, minimum cost spanning trees. [5]
TEXT BOOKS:
1. Horowitz and Sahani, “Fundamentals of data Structures”, Galgotia Publication Pvt. Ltd.,
New Delhi.
2. R. Kruse etal, “Data Structures and Program Design in C”, Pearson Education Asia,
Delhi-2002
REFERENCE BOOKS:
1. Bruno R Preiss, “Data Structures and Algorithms with Object Oriented Design Pattern in
C++”, Jhon Wiley & Sons, Inc.
2. Adam Drozdek, “Data Structures and Algorithms in C++”, Thomson Asia Pvt.
Ltd.(Singapore)
[48]
CODE
CS 332 Fundamentals of Data 3-0-0 3 M DALUI

Structures
Introduction to Data Structure - Fundamentals of algorithm, time complexity analysis and

asymptotic notations, Analysis of recursive and non‐recursive algorithms, Concept of
dynamic and static memory allocation in C, Concept of Files, Operations with files, types
of files, Concepts Data, Data Types, String, Abstract Data Type (ADT) and Data structures
with examples. [3]
Arrays – Single and multi dimensional arrays, Row and Column major Representation of
matrices,
Sparse matrices [4]
Linked List
Linked List as an ADT, Linked List Vs. Arrays, Memory Allocation & de-allocation for a
Linked List, Linked List operations and Implementation: Creation, Display, Insertion and
Deletion (in front, at end, and before and after a specific node), Summation, average,
maximum, minimum, Searching, Sorting etc., Concatenation of two list, (Circular and non
Circular) Doubly linked list: Creation, Insertion, Deletion and Display, Application of Linked
List – addition of two polynomials, very large numbers [8]
Stack
The Stack as an ADT, Stack operation, Array Representation of Stack, Link
Representation of Stack
Applications – Recursion, Function call, Conversion from infix to postfix notation,
Evaluation of postfix expression, Checking validity of a parenthesized expression. [5]
Queue
The Queue as an ADT, Queue operation, Array Representation of Queue and its
disadvantages,
Linked Representation of Queue, Circular Queue, Priority Queue and its applications. [3]
Tree - Basic concept of trees, Binary tree representation, Binary tree operation, Binary
tree, traversal (Preorder, Inorder and Postorder), Copying a Tree, checking equivalence
between two Trees [6]
Binary search tree (BST)- Creation, search and insertion in a BST. [2]
Sorting - Bubble sort, Selection sort, Insertion sort, Quick Sort, Merge Sort, Radix Sort, [6]
Searching - Sequential search, Binary search. [4]
TEXT BOOKS:
REFERENCE BOOKS:
1. Data Structure using C & C++, Angenstein & Tanenbaum, PHI.
[49]
2. An introduction to Data Structure, Trembly & Sorensen, MCHILL.

CODE
CS 333 PROGRAMMING AND DATA 3-0-0 3 T DE

STRUCTURE
Algorithm, Complexity of algorithm, Different notation: Big ohh (O), Big omega (Ω), Big
theta (Θ). Concept of data structure with example. Concept of dynamic memory
allocation through C language. [4]
Array: 1-D, 2-D, 3-D and Multi-dimensional arrays and memory representation of these
arrays, Row and Column major representation of matrices, Sparse matrices, lower
triangular, upper triangular, tri-diagonal sparse matrices. [6]
Sorting and Searching: Bubble sort, Selection sort, Insertion sort, Merge sort, Quick sort,
Radix sort. Sequential search, and binary search. [5]
Linked List:Linear, doubly, and circular linked lists. Different operation: insertion, deletion,
searching, and modification of a node. Application of linked list. [6]
Stack: Implementation of stack using array and linked list. Applications: Sub routine call,
recursion, conversion of infix to postfix expression, evaluation of postfix expression, etc.
[5]
Queue: Implementation of queue using array and linked list. Circular queue and priority
queue. [3]
Tree: Basic terminology, Binary tree and its implementation, Tree traversal techniques,
Binary search tree – creation, insertion, and deletion. [5]
TEXT BOOKS:
1. “Data Structures and Program Design In C”, 2/E by Robert L. Kruse, Bruce P. Leung.
2. “Data Structures” by S. Lipschutz.
REFERENCE BOOKS:
1. “Fundamentals of Data Structures of C” by Ellis Horowitz, Sartaj Sahni, Susan
Anderson-freed.
2. “Introduction to Algorithms” by Thomas H. Cormen, Charles E. Leiserson, Ronald L.
Rivest, Clifford Stein.

CODE
CS 631 DATABASE MANAGEMENT 3-0-0 3 PKG

SYSTEMS

[50]

[4]

clustered, multi-level, dynamic multi-level (B_tree & B+_tree) concepts, problem solving on

property, scheduling of transactions (serial and serializable). [3]

TEXT BOOKS:
Education.
REFERENCE BOOKS:
[51]
Laboratory Courses
SUBJECT SUBJECT L-T-P CREDIT

CODE
CS 51 COMPUTING LABORATORY 0-0-3 2
1. Write a c program to check given number is perfect number or not.

2. Write a c program to check given number is Armstrong number or not.
3. Write a c program to check given number is prime number or not.
4. Write a c program to check given number is strong number or not.
5. C program to check a number is odd or even.
6. Write a c program to check given number is palindrome number or not.
8. Write a c program to check given string is palindrome number or not.
7. Write a c program to solve quadratic equation.
8. Write a c program to print Fibonacci series of given range.
9. Write a c program to get factorial of given number.
10. Write a c program for Floyd’s triangle.
11. Write a c program to print Pascal triangle.
12. Write a c program to generate multiplication table.
13. Write a c program to print ASCII value of all characters.
14. Write a c program to reverse any number.
15. Write a c program to find out sum of digit of given number.
16. Write a c program to find out power of number.
17. Write a c program to add two numbers without using addition operator.
18. Write a c program to subtract two numbers without using subtraction operator.
19. Write a c program to find out L.C.M. of two numbers.
20. Write a c program to find out H.C.F. of two numbers.
21. Write a c program to find out G.C.D. of two numbers.
------------------------------------------------------
1. Write a c program for swapping of two arrays.

2. Write a c program for swapping of two string.
--------------------------------------------------------
1. Write a c program to convert decimal number to binary number.

2. Write a c program to convert decimal number to octal number.
3. Write a c program to convert decimal number to hexadecimal number.
---------------------------------------------------------
1. Write a c program to convert the string from upper case to lower case.
2. Write a c program to convert the string from lower case to upper case.
3. Write a c program to delete the all consonants from given string.
4. Write a c program to count the different types of characters in given string.
5. Write a c program to sort the characters of a string.
6. Write a c program for concatenation two strings without using string.h header file.
7. Write a c program to find the length of a string using pointer.
8. Write a c program which prints initial of any name.
9. Write a c program to print the string from given character.
10. Write a c program to reverse a string
[52]
11. Reverse a string using recursion in c
12. String concatenation in c without using strcat
13. How to compare two strings in c without using strcmp
14. String copy without using strcpy in c
15. Convert a string to ASCII in c
---------------------------------------------------------
1. Write a c program for addition of two matrices.

2. Write a c program for subtraction of two matrices
3. Write a c program for multiplication of two matrices.
1. Write a c program to find out the sum of series 1 + 2 + …. + n.
2. Write a c program to find out the sum of series 1^2 + 2^2 + …. + n^2.
3. Write a c program to find out the sum of series 1^3 + 2^3 + …. + n^3.
4. Write a c program to find out the sum of given A.P.
5. Write a c program to find out the sum of given G.P.
6. Write a c program to find out the sum of given H.P.
7. Write a c program to find out the sum of series 1 + 2 + 4 + 8 … to infinity.
-----------------------------------------------------------------
1. Write a c program to find out largest element of an array.

2. Write a c program to find out second largest element of an unsorted array.
3. Write a c program to find out second smallest element of an unsorted array.
4. Write a c program which deletes the duplicate element of an array.
5. Write a c program for delete an element at desired position in an array.
6. Write a c program for insert an element at desired position in an array.
7. C program to find largest and smallest number in an array
----------------------------------------------------------------------
1. Write a c program to find factorial of a number using recursion.

2. Write a c program to find GCD of a two numbers using recursion.
3. Write a c program to find out sum digits of a number using recursion.
4. Write a c program to find power of a number using function recursion.
5. Write a c program to reverse any number using recursion.
-----------------------------------------------------------------------
1. Write a c program for bubble sort.

2. Write a c program for linear search.
------------------------------------------------------------------------
1. Problems on structure
TEXT BOOKS:
REFERENCE BOOKS:
[53]
CODE
CS 351 DATA STRUCTURE (Lab.) 0-0-3 2
Structure and memory allocation (static and Dynamic)

Linked List
Implementations of Linked Lists (menu driven program)
Implementation of different operations on linked list – copy, concatenation, split, reverse,
counting number of nodes etc.
Representation of Sparse matrix using multilinked structure. Implementation of sparse
matrix addition and multiplication
Implementation of polynomial operations (addition, subtraction) using Linked List
Implementation of circular Linked List
Implementations of Doubly Linked List
Stack
Implementations of stack menu driven program using array and linked list
Implementation of multi-stack in one array
Implementations of Infix to Postfix Transformation and its evaluation program
Implementations of Infix to Prefix Transformation and its evaluation program
Implementation of validity checking of a parenthesized expression
Queue
Implementations of linear queue using array and linked list
Implementations of circular queue using array and linked list
Implementation of Priority queue program using array
Tree
Implementations of Binary Tree (menu driven program)
Implementation of Binary Tree Traversal techniques
Implementation of Binary Search Tree
Implementation of various operations on tree, e.g. – copying tree, counting the number of
nodes in the tree, counting only leaf nodes in the tree etc.
Sorting
Implementations of Insertion sort, Selection sort, Bubble sort, Quick sort, Merge sort and
Radix sort (menu driven program)
Searching
Implementations of Sequential and Binary Search(menu driven program)
TEXT BOOKS:
1. Data Structure Using C, Balagurusamy
2. Data Structure using C & C++, Angenstein&Tanenbaum, PHI
REFERENCE BOOKS:
1. Data Structures Using C & C++, Rajesh K. Shukla, Wiley- India
2. Data Structures Using C, ISRD Group, Second Edition, Tata McGraw-Hill
[54]
CODE
CS 451 Object Oriented Programming 0-0-3 2

laboratory
Problems on basic C++ syntax, loops, functions, assert macro, enum, etc
Number pyramids, Conversion of unindented code (storted in file) to indented code,
Determinant of a matrix, addition/multiplication/factorial of VERY LARGE (represent using
string) numbers, expression evaluation
Problems on dynamic allocation in C++

Stack, queue, linked list, hashing (using channing), graph representation and basic
processing (find number of connected components, find all pairs shortest path, etc.)
Problems to define C++ class

Stack, Queue, Linked List, Hashing, Matrix, Complex number, Tree, BST,
roblems to use function and operator overloading, Inline functions

Stack, Queue, Linked List, Hashing, Matrix, Complex number, Tree, BST,
Problems using inheritance

Deque and priority queue from queue, Doubly and circular linked listfrom linked list class,
etc..
Problems using templates

Stack, Queue, Linked List, Hashing, Matrix
TEXT BOOKS:
REFERENCE BOOKS:

CODE
CS 452 Microprocessor Laboratory 0-0-3 2
The List of Assignments to be covered in the Microprocessor and its Applications Lab:
1. Addition of two 8-bit numbers.
2. Find out 1's and 2's complement of a 8-bit number.
3. Calculate the sum of a list of N 8-bit numbers.
4. Addition of two 16-bit numbers.
5. Find out 1's and 2's complement of a 16-bit number.
6. Count the number of 1s in a 8-bit number.
7. Count the number of 1s in a 16-bit number.
Subtraction of two 8-bit numbers. (output both the sign & magnitude)
Subtraction of two 16-bit numbers. (output both the sign & magnitude)
Multiplication of two 8-bit unsigned numbers.
Multiplication of two 16-bit unsigned numbers.
Find out maximum & minimum of a list of N 8-bit numbers.
[55]
Test whether a given 8-bit number is palindrome or not.
Test whether a given 16-bit number is palindrome or not.
Sort a list of N 8-bit numbers.
Division of two 8-bit unsigned numbers.
Division of two 16-bit unsigned numbers.
Write a program to find the summation of the following series.
S= 1 + 2 +3+4+…………up to N nos.
S= 2+4+6+8+…………..up to N nos.
S= 1+2+3+5+8+……….up to N nos.
S= 2+3+5+7+11+……….up to N nos.
S= 2-4+6-8………….up to N nos.
Write a program to find the Fibonacci series
Write a program for blinking a message using monitor program. Extend it to roll the
message (Rolling display).
Design a digital clock using monitor program.
TEXT BOOKS:
1. Microprocessor Architecture, Programming & Applications, Gaonkar, Ramesh,Penram
International Pub.(India)
2. Microprocessor, B.Ram, Galgotia
REFERENCE BOOKS:
1. Microprocessors, Rafiquzzumman, Galgotia

CODE
CS 551 DATABASE MANAGEMENT 0-0-3 2

SYSTEMS LABORATORY
Study of DBMS, RDBMS and ORDBMS: Definition of DBMS, RDBMS and ORDBMS,
Features of DBMS, RDBMS and ORDBMS, advantages of each.
To study Data Definition language statements: SQL schema update statements (DDL)
such as Delete or Modify table (Alter, Create, Drop commands).
To study Data Manipulation Statements: SQL Data update statements (DML) such as
insert, delete and update statements.
Study of SELECT command with different clauses: Select, from and where clauses with
use of several keywords.
Study of SINGLE ROW functions (character, numeric, Data functions):Number Functions,
Concatenation and column alias, Single- Row Character Manipulation Functions and
Single- Row Date Functions.
Study of GROUP functions: Aggregate functions such as avg, count, max, min, Sum,
group by function.
Study of various type of SET OPERATORS: Union, Intersect, Minus.
Study of various type of Integrity Constraints: Primary key and foreign key assign.
Study of Various type of JOINS:Equality Join, Outer Join, Staff Join and Inequality Join.
To study Views and Indices:Create index statement and create view statement.
To study nested sub-query: set membership, set comparison.
PL/SQL: Make Use of PL/SQL Language Components, Make Use of PL/SQL Variables,
Handle PL/SQL Reserved Words, Make Use of Identifiers in PL/SQL, Make Use of
[56]
Anchored Data Types, Declare and Initialize Variables, Understand the Scope of a Block,
Nested Blocks, and Labels, Loop structures.
TEXT BOOKS:
1. Ivan Bayross, SQL, PL/SQL: The Programming Language of Oracle,BPB Publications.
REFERENCE BOOKS:
1. John Garmany, Easy Oracle PL/SQL Programming, RAMPAUT TECHPRESS.
2. B. Rosenzweig and E. Silvestrova, Fundamentals of Programming in PL/SQL,
PEARSON

CODE
CS 552 Compiler Design Laboratory 0-0-3 2
Programs on LEX
Write a Lex program to find number of vowels and consonants.

Write a Lex program to change Keywords to uppercase.
Write a Lex program to change words other than keywords to uppercase.
Write a Lex program to replace special characters to spaces.
Write a Lex program to remove all the single line comments.
Write a Lex program to remove all the multi-line comments.
Write a Lex program to trim tab in the beginning of line.
Write a Lex program to replace printf and scanf by writef and readf statements
respectively.
Write a Lex program to check whether an arithmetic expression is valid or not and also
identify the identifier and operator.
Write a Lex program to count the number of words, number of lines and word of length
greater than 10.
Programs on Yacc
TEXT BOOKS:
REFERENCE BOOKS:

CODE
CS 651 Computer Network Laboratory 0-0-3 2
Socket Programming for TCP client-

Iterative server
Concurrent Server
Socket programming for UDP client
Usage of select() system call
FTP implementation
Two player game (Tic Tac Toe) implementation
[57]
Implementation of simplified Chat server
RPC (Remote Procedure Call) implementation
TEXT BOOKS:
1. Richard Stevens, Unix Network Programming, Volume 1 and 2, Addison-Wesley
Professiona
2. Neil matthew and Richard Stones, Beginning Linux Programming, Wrox Publishers, 4th
Edition.
REFERENCE BOOKS:

CODE
CS 652 Software Engineering 0-0-3 2

Laboratory
Prepare the following documents for three of the experiments listed below using software
engineering methodology.
1. Program Analysis and Project Planning: Thorough study of the problem – Identify
project scope, Objectives, Infrastructure.
2. Software requirement Analysis: Describe the individual Phases / Modules of the project,
Identify deliverables.
3. Software Design: Use work products – Data dictionary, Use case diagrams and activity
diagrams, build and test class diagrams, Sequence diagrams and add interface to class
diagrams, DFD, ER diagrams
4. Software Development and Debugging using any Front end and Back end tool
5. Software Verification and Validation procedures: Implementation Program on Java and
testing using Java.
Suggested List of Applications:
1. Student Marks Analysing System

2. Online Ticket Reservation System
3. Payroll System
4. Course Registration System
5. Expert Systems
6. ATM Systems
7. Stock Maintenance
TEXT BOOKS:
REFERENCE BOOKS:
[58]
CODE
CS 751 ARTIFICIAL INTELLIGENCE 0-0-3 2

LAB
Write a LISP Program to search, insert and delete element from a list. [6]
Write a LISP Program to modify a database dynamically. [3]
Write a program in MATLAB to implement DFS algorithm. The input to the program should
be a problem in production system representation and specified a Goal. The output should
indicate success or failure to arrive at the Goal. If the Goal is arrived at, it will indicate the
search path to have arrived at the goal. [6]
Implement problem 3 with BFS algorithm. [3]
Write a program in MATLAB to implement iterative Deepening Depth-First Search. [3]
Write a program in MATLAB to implement steepest ascent hill climbing. [3]
Write a program in MATLAB to implement AND-OR graph with AO* heuristics. Input
should be Production System Representation. [3]
Write a program in MATLAB to implement a game of 8-puzzle. The input should be any
initial board position and output should be any other board position. The output should
indicate the search path to go about the solution. The heuristic to be used is Steepest
Ascend Hill Climbing. The evolution Function/ heuristic function is the total number of
misplaced times. [6]
Write a program in MATLAB to implement the game of Rubik’s cube using Steepest
Ascend Hill Climbing. The evolution function/ heuristic function are the total number of
colour difference in each face of the original cube. The rule is to move each sub cube a
step of 90 degrees. [6]
TEXT BOOKS:
1. COMMON LISP: A Gentle Introduction to Symbolic Computation, David S. Touretzky,
Carnegie Mellon University
REFERENCE BOOKS:

CODE
CS 752 IMAGE PROCESSING LAB 0-0-3 2
ASSIGNMENT SET – I: Read and display an image, pixel replication, nearest neighbour
interpolation, shrinking the given image using row column deletion and point processing
based image enhancement using thresholding, image negative and contrast stretching. [3]
ASSIGNMENT SET – II: Point processing based image enhancement using log and
inverse log transformation, Gamma correction (power law) with different – ve and + ve
[59]
values of Gamma, point processing based image enhancement using gray level slicing
and bit plane slicing. [3]
ASSIGNMENT SET – III: Computation of histogram of a given gray scale image,

Computation of mean gray level and variance of given gray level. Obtain a histogram
equalized image of a given gray level image. Perform AND operation with the mask
image, OR operation with the mask image, addition of two gray image and multiplication of
a gray image with a constant. [3]
ASSIGNMENT SET – IV: Perform image subtraction operation, image averaging and
division of gray image by a constant. Enhancement of gray level image by smoothing
(averaging) filters of size 3×3 and 5×5, box filter, weighted averaging filter 3×3.
Enhancement of gray level image by using median filter of size 3×3 and 5×5, Sobel
gradient operator and Robert cross gradient operator. [3]
ASSIGNMENT SET – V: Enhance the gray level image by using Laplacian filter of size
3×3 with and without diagonal neighbour and high boost filter. Detect the horizontal line,
vertical line and ±450 line in a gray level image. Detect the Prewitt, Sobel and Laplacian of
Gaussian (Mexican Hat) filters in a gray level image. Convert a RGB image into gray level
image. [6]
ASSIGNMENT SET – VI: Huffman coding technique, test on two different images and
compute the compression ratios. Arithmetic coding technique, test on two different images
and compute the compression ratios. Perform DCT transform on every block of an image
having 8×8 sub blocks. Perform inverse DCT. Combine the block and display the image.
Calculate the compression ratio. Apply on two different images for m = 8, 4, 2 and 1. [6]
TEXT BOOKS:
1. Digital Image Processing, by Rafael C. Gonzalez, Richard E. Woods, 3rd Edition,
Prentice Hall, 2007.
2. Fundamentals of Digital Image Processing by Anil K. Jain, 1st Edition, Prentice Hall,
1988.
REFERENCE BOOKS:
1. B. Chanda and D. Dutta Majumder, Digital Image Processing and Analysis 2nd Ed., PHI
Learning Pvt. Ltd., New Delhi, 2011.
2. Digital Image Processing, Jayaraman, Tata McGraw-Hill Education, pp. 723, 2011.

CODE
CS 852 INTERNET PROGRAMMING 0-0-3 2

LAB
Introduction to internet programming. [1]
Basics of HTML –table, hyperlink, form :ordered and unordered list, text box, text area
box, check box, radio button, password field, submit and reset button. [3]
HTML frame – create frame set : use frame tags, create vertical frames, horizontal frames,
[60]
use hyperlink tag to target displaying a HTML page to another frame. [3]
Java script introduction. [1]
Form validation – validate the fields of a form, implement exception handling, program on
image rollover, prompt, alert, array, looping, validate email, phone number using regular
expression. [3]
CSS – colors, backgrounds, borders, margins, padding, height- width, text, fonts, links, list,
tables, position, image. [3]
Client server programming using JAVA – chat server programming. [2]
Introduction to JSP – declarations, expressions, scriptlets, setting up a JSP environment

with Tomcat apache server,some basic program of JSP, JSP model 1(http request, http
response, web browser, database). [3]
Building a simple JSP application withJDBC ODBC connectivity. [2]
Create a web page that contain login information, after successful login user can search
records, insert new entry, can modify existing information, delete unnecessary information.
[ 2]
Assign projects to different group of students. [12]
TEXT BOOKS:
1. Core Web Programming, 2nd Edition (Marty Hall)
REFERENCE BOOKS:

CODE
CS681 DATABASE MANAGEMENT 0-0-3 2

SYSTEMS LABORATORY
Study of DBMS, RDBMS and ORDBMS: Definition of DBMS, RDBMS and ORDBMS,
Features of DBMS, RDBMS and ORDBMS, advantages of each.
To study Data Definition language statements: SQL schema update statements (DDL)
such as Delete or Modify table (Alter, Create, Drop commands).
To study Data Manipulation Statements: SQL Data update statements (DML) such as
insert, delete and update statements.
Study of SELECT command with different clauses: Select, from and where clauses with
use of several keywords.
Study of SINGLE ROW functions (character, numeric, Data functions):Number Functions,
Concatenation and column alias, Single- Row Character Manipulation Functions and
Single- Row Date Functions.
Study of GROUP functions: Aggregate functions such as avg, count, max, min, Sum,
group by function.
Study of various type of SET OPERATORS: Union, Intersect, Minus.
Study of various type of Integrity Constraints: Primary key and foreign key assign.
Study of Various type of JOINS:Equality Join, Outer Join, Staff Join and Inequality Join.
[61]
To study Views and Indices:Create index statement and create view statement.
To study nested sub-query: set membership, set comparison.
PL/SQL: Make Use of PL/SQL Language Components, Make Use of PL/SQL Variables,
Handle PL/SQL Reserved Words, Make Use of Identifiers in PL/SQL, Make Use of
Anchored Data Types, Declare and Initialize Variables, Understand the Scope of a Block,
Nested Blocks, and Labels, Loop structures.
TEXT BOOKS:
1. Ivan Bayross, SQL, PL/SQL: The Programming Language of Oracle,BPB Publications.
REFERENCE BOOKS:
1. John Garmany, Easy Oracle PL/SQL Programming, RAMPAUT TECHPRESS.
2. B. Rosenzweig and E. Silvestrova, Fundamentals of Programming in PL/SQL,
PEARSON.

CODE
CS 381 DATA STRUCTURE LAB 0-0-3 2
Implementation of using C language (use dynamic memory allocation)
Multiplication of two matrices.

Find out the Saddle point of a dynamically allocated matrix
Upper triangular sparse matrix in a space-efficient manner
Lower triangular sparse matrix in a space-efficient manner
Tri-diagonal sparse matrix in a space-efficient manner
General sparse matrix in a space-efficient manner
Buble sort, Insertion sort, Selection sort, Quick sort, Merge sort
Linear and Binary search.
Creation of Linear Linked List, Insertion of an element in different position in Linear Linked
List, Deletion of an element from different position in Linear Linked List.
Creation of Doubly Linked List, Insertion of an element in different position in Doubly
Linked List, Deletion of an element from different position in Doubly Linked List.
Creation of Circular Linked List, Insertion of an element in different position in Circular
Linked List, Deletion of an element from different position in Circular Linked List.
Stack using Array and Linked List.
Application of stack, like conversion of infix to postfix expression, evaluation of postfix
expression.
Queue using Array
Create Binary tree.
TEXT BOOKS:
2. “Data Structures Using C” by Reema Thareja.
[62]
REFERENCE BOOKS:
Anderson-freed.
2. “Data Structures in C” by Aaron M. Tenenbaum.

CODE
CS 382 PROGRAMMING AND DATA 0-0-3 2

STRUCTURE LAB
Implementation of using C language (use dynamic memory allocation)
Multiplication of two matrices.

Find out the Saddle point of a dynamically allocated matrix
Upper triangular sparse matrix in a space-efficient manner
Lower triangular sparse matrix in a space-efficient manner
Tri-diagonal sparse matrix in a space-efficient manner
General sparse matrix in a space-efficient manner
Buble sort, Insertion sort, Selection sort, Quick sort, Merge sort
Linear and Binary search.
Creation of Linear Linked List, Insertion of an element in different position in Linear Linked
List, Deletion of an element from different position in Linear Linked List.
Creation of Doubly Linked List, Insertion of an element in different position in Doubly
Linked List, Deletion of an element from different position in Doubly Linked List.
Creation of Circular Linked List, Insertion of an element in different position in Circular
Linked List, Deletion of an element from different position in Circular Linked List.
Stack using Array and Linked List.
Application of stack, like conversion of infix to postfix expression, evaluation of postfix
expression.
Queue using Array
Create Binary tree.
TEXT BOOKS:
2. “Data Structures Using C” by Reema Thareja.
REFERENCE BOOKS:
Anderson-freed.
2. “Data Structures in C” by Aaron M. Tenenbaum.
[63]
CODE
CS 383 PROGRAMMING AND DATA 0-0-3 2

STRUCTURE LAB
Structure and memory allocation (static and Dynamic)

Linked List
Implementations of Linked Lists (menu driven program)
Implementation of different operations on linked list – copy, concatenation, split, reverse,
counting number of nodes etc.
Representation of Sparse matrix using multilinked structure. Implementation of sparse
matrix addition and multiplication
Implementation of polynomial operations (addition, subtraction) using Linked List
Implementation of circular Linked List
Implementations of Doubly Linked List
Stack
Implementations of stack menu driven program using array and linked list
Implementation of multi-stack in one array
Implementations of Infix to Postfix Transformation and its evaluation program
Implementations of Infix to Prefix Transformation and its evaluation program
Implementation of validity checking of a parenthesized expression
Queue
Implementations of linear queue using array and linked list
Implementations of circular queue using array and linked list
Implementation of Priority queue program using array
Tree
Implementations of Binary Tree (menu driven program)
Implementation of Binary Tree Traversal techniques
Implementation of Binary Search Tree
Implementation of various operations on tree, e.g. – copying tree, counting the number of
nodes in the tree, counting only leaf nodes in the tree etc.
Sorting
Implementations of Insertion sort, Selection sort, Bubble sort, Quick sort, Merge sort and
Radix sort (menu driven program)
Searching
Implementations of Sequential and Binary Search(menu driven program)
TEXT BOOKS:
1. Data Structure Using C, Balagurusamy
2. Data Structure using C & C++, Angenstein&Tanenbaum, PHI
REFERENCE BOOKS:
1. Data Structures Using C & C++, Rajesh K. Shukla, Wiley- India
2. Data Structures Using C, ISRD Group, Second Edition, Tata McGraw-Hill
[64]

Wa0001

Загружено:

Сведения о документе

Оригинальное название

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

Wa0001

Загружено:

Авторское право:

Доступные форматы

NATIONAL INSTITUTE OF TECHNOLOGY DURGAPUR

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

FIRST SEMESTER (COMMON TO ALL BRANCHES)

SECOND SEMESTER (COMMON TO ALL BRANCHES)

Subject List (Semester – 1: Gr-I / Semester – 2: Gr - II)

Subject List (Semester – 1: Gr-II / Semester – 2: Gr - I)

Departmental Elective III

Open Electives –II

Sub Discipline: NON-DEPARTMENTAL CORE

Sub. Code SUBJECT L-T-P CREDI

Sub Discipline: LABORATORY & SESSIONAL COURSES

Sub. Code Subject L-T-P Credits

Sub Discipline: PROJECT, SEMINAR etc.

SUBJECT SUBJECT L-T-P CREDIT DEVELOPER

Fundamentals of Computer: History of Computer, Generation of Computer, Classification

Fundamentals and Program Structures: Basic of functions, function types, functions

SUBJECT SUBJECT L-T-P CREDIT DEVELOPER

CS 301 Data Structures 3-1-0 4 T. PAL

Linear Data Structure:

Stack: Stack as an ADT, Stack operation, Array Representation of Stack, Link

Non-linear Data Structure

Sorting and Searching

Searching: Sequential search, Binary search. [4].

SUBJECT SUBJECT L-T-P CREDIT DEVELOPER

CS 302 Digital Logic Design 3-0-0 3 B. SEN

Combinational logic circuits: Realization of Boolean functions using NAND/NOR Gates,

CS 401 Microprocessor & its 3-1-0 4 T. DE

1. The 8085 Microprocessor: Microprocessor architecture, Register set, ALU, Interface

2. Programming in 8085: Instruction set of 8085 microprocessor and Assembly language

4. Peripheral (I/O) interfacing: Timing and execution of IN / OUT instruction, Device

6. The 8259A Programmable Interrupt Controller: Block diagram, interrupt operation,

SUBJECT SUBJECT L-T-P CREDIT DEVELOPER

CS 402 Computer Organisation and 3-0-0 3 B. SEN

Von Neumann architecture, Operational concepts, Instruction Set Architechture,

SUBJECT SUBJECT L-T-P CREDIT DEVELOPER

CS 403 Discrete Structures 3-0-0 3 S. SADHU

Propositional logic: Syntax, semantics, valid, satisfiable and unsatisfiable formulas,

SUBJECT SUBJECT L-T-P CREDIT DEVELOPER

CS 404 Object Oriented Programming 3-0-0 3 S. NANDI

Introduction: Object oriented programming concepts – objects-classes- methods and

C++- objects-classes: constructors and destructors, constructor initializer list, :: operator.

Overloading: Function overloading, Operator overloading - friend functions. [5]

Inheritance: virtual base class, virtual functions- runtime polymorphism. [4]

Templates in C++ [5]

SUBJECT SUBJECT L-T-P CREDIT DEVELOPER

CS 501 Database Management 3-1-0 4 P. K.

Introduction of DBMS: Database, Database Management System, Traditional File

Relational Algebra: Basic concept of procedural query language, various operations of

Transaction Processing:Basic concept on transaction, state diagram of transaction, ACID

Concurrency Control: Various problems due to concurrent events, Need of concurrency

Recovery: Need of recovery techniques, various types of recovery techniques such as

Query Optimization: Basic concepts on query optimization, various rules of query

CS 502 Theory of Computation 3-0-0 3 B. SEN

SUBJECT SUBJECT L-T-P CREDIT DEVELOPER

CS 503 COMPILER DESIGN 3-0-0 3 G. SARKER

Introduction: Translator, Compiler, Assembler, Interpreter, Structure and Phases of a

Lexical Analyzer: Transition Diagram of Keywords, Identifiers, Operators – Reserved Word

Syntax Analyzer: Types of Grammar -- Ambiguity in Grammar – Parse Tree – Syntax

Code Optimization – Criterion of Optimization – Gain of Optimization – Program Flow

Code Generation – Concept of Target Machine – Instruction Costs – Code Generation

SUBJECT SUBJECT L-T-P CREDIT DEVELOPER

CS 504 Operating Systems 3-0-0 3 S. NANDI

Introduction: Evolution of OS, Batch, Multiprogramming and Timesharing system, Real