Department of Computer Science & Engineering

M. Tech. Curriculum

FIRST SEMESTER

Sl. No Sub. Code Subject L-T-P Credits

1 CS1001 Mathematical Concepts in Computer Science 3-1-0 4

2 CS1003 Software Design and Validation 3-1-0 4

3 CS1004 Advance Topics I n Algorithm 3-1-0 4

4 Elective-I 3-1-0 4

5 Elective-II 3-1-0 4

6 CS1051 Network and System Laboratory 0-0-4 2

7 CS1052 Software Engineering Laboratory 0-0-4 2

TOTAL 24

SECOND SEMESTER

Sl. No Sub. Code Subject L-T-P Credits

1 CS2001 Advance Database Management System 3-1-0 4

2 CS2002 Distributed System 3-1-0 4

3 CS2003 Advance Computer Architecture 3-1-0 4

4 Elective-III 3-1-0 4

5 Elective-IV 3-1-0 4

6 CS2051 Simulation and Modeling Laboratory 0-0-4 2

7 CS2052 Seminar-I(Non-Project) 0-0-2 1

8 CS2053 Project-I 0-0-2 1

TOTAL 24

THIRD SEMESTER

Sl. No Sub. Code Subject L-T-P Credits

1 CS3051 Project-II 11

2 CS3052 Project Seminar-I 2

TOTAL 13

FOURTH SEMESTER

Sl. No Sub. Code Subject L-T-P Credits

1 CS4051 Project-III 11

2 CS4052 Project Seminar-II & Viva-Voce 3

TOTAL 14

Total Program Credit 75

SUMMARY OF COURSES

Sub Discipline: DEPARTMENTAL CORE

SUBJECT CODE

SUBJECT L-T-P CREDIT

CS1001 Mathematical Concepts in Computer Science 3-1-0 4

CS1003 Software Design and Validation 3-1-0 4

CS1004 Advance Topics in Algorithm 3-1-0 4

CS2001 Advance Database Management System 3-1-0 4

CS2002 Distributed System 3-1-0 4

CS2003 Advance Computer Architecture 3-1-0 4

Sub Discipline: DEPARTMENTAL ELECTIVES

SUBJECT CODE

Subject L-T-P Credits

CS9011 CAD for VLSI 3-1-0 4

CS9012 Parallel & Distributed Computing 3-1-0 4

CS9013 Wireless Networks & Mobile Computing 3-1-0 4

CS9014 Theory of Computation 3-1-0 4

CS9015 Web Design and Web Mining 3-1-0 4

CS9016 Computational Geometry 3-1-0 4

CS9017 Information & Coding Theory 3-1-0 4

CS9018 Cryptology 3-1-0 4

CS9019 Network Security 3-1-0 4

CS9020 Data Security and Application 3-1-0 4

CS9021 Soft Computing 3-1-0 4

CS9022 Pattern Recognition 3-1-0 4

CS9023 Data Mining 3-1-0 4

CS9024 Computer Vision 3-1-0 4

CS9025 Optical Networks 3-1-0 4

CS9026 Peer to peer Networks 3-1-0 4

CS9027 Adhoc Networks 3-1-0 4

CS9028 Sensor Networks 3-1-0 4

CS9029 Embedded System 3-1-0 4

CS9030 High Performance Computing 3-1-0 4

CS9031 Complex network Theory 3-1-0 4

CS9032 Testing and verification Of VLSI Circuits 3-1-0 4

CS9033 Advance Artificial Intelligence 3-1-0 4

CS9034 Software Testing 3-1-0 4

CS9035 Principles of Programming Languages 3-1-0 4

CS9036 Fault Tolerant System 3-1-0 4

CS9037 Simulation and Modeling 3-1-0 4

CS9038 Internet Technologies 3-1-0 4

CS9039 Computer Graphics and Application 3-1-0 4

CS9040 Advance Graph Theory 3-1-0 4

Sub Discipline: LABORATORY & SESSIONAL COURSES

SUBJECT CODE

Subject L-T-P Credits

CS1051 Network and System Laboratory 0-0-4 2

CS1052 Software Engineering Laboratory 0-0-4 2

CS2051 Simulation and Modeling Laboratory 0-0-4 2

Sub Discipline: PROJECT, SEMINAR etc.

SUBJECT CODE

Subject L-T-P Credits

CS2052 Seminar-I(Non-Project) 0-0-2 1

CS2053 Project-I 0-0-2 1

CS3051 Project-II 11

CS3052 Project Seminar-I 2

CS4051 Project-III 11

CS4052 Project Seminar-II & Viva-Voce 3

DETAILED SYLLABI OF COURSES

SUBJECT CODE

SUBJECT L-T-P CREDIT DEVELOPER

CS-1001 Mathematical Concepts in Computer Science

3-1-0 4 Mr. Sanjib Sadhu

Logic Formulas: Propositional Logic in Computer Programs, Equivalence and Validity, The Algebra of Propositions, SAT problems, Predicate formulas. [4]

Recurrences and Solution of recurrences: Line intersection problem in a plane, Josephus problem and its solution. Mathematical Induction- Strong Induction, Colouring problem for the regions generated by the intersection of infinite lines on a plane. [4] Proof Techniques: proof by cases, proof by contradiction, contrapositive proofs, proof of necessity and sufficiency; Well ordering principle. [3] Set Theory, Relations- reflexive, symmetric, transitive, antisymmetric, Equivalence, partial ordering relations, equivalence relations, Partial Order, Lattice, Partial Order, Lattice, Hasse Diagram, Functions- Surjection, Injection, Bijection, Composition of Function, Asymptotic notations: big-Oh, small-oh, Theta, Omega [4] Size of a set: Finite and infinite sets, countable and uncountable sets, Cantor's diagonal argument and the power

set theorem, Schroeder-Bernstein theorem. [3]

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, Convex polygon triangulation

[6]

Generating Functions: Infinite Series, Counting with Generating Functions, Partial Fractions, Solving Linear Recurrences, Formal Power Series [4] Linear Programming : Simplex algorithm, Duality, LP rounding and vertex cover, randomized LP rounding [4]

Graph Theory : basic definitions, complement of a graph, clique, independent set, bipartite graph, chromatic number, graph isomorphism, subgraph, induced subgraph, path, cycle, walk, Petersen graph, connected component, Degree Sequence, Graphic sequence, Adjacency matrix and number of walks, Shortest Path in a weighted graph, BFS, DFS, Bipartite graphs and odd cycles, Strongly connected component, Eulerain trail, Directed graph, Tree, Radius, Diameter, Center of a graph MST; Edge subdivision, Planarity, K(3,3) and K(5), Kuratowski's theorem (statement), Euler's theorem, Chromatic number, Minimum Vertex Cover and Maximum Independent Set, Hamiltonian path and cycle, Introduction to Matching, perfect matching [10]

Text books :

1. C. L. Liu, Elements of Discrete Mathematics, Tata McGraw Hill 2. Norman L. Biggs, Discrete Mathematics, Oxford 3. Douglas B. West, Introduction to Graph Theory, Prentice Hall, India

Reference book : 1. Ronald L. Graham, Donald E. Knuth and O. Patashnik, Concrete Mathematics.

SUBJECT CODE

SUBJECT L-T-P CREDIT DEVELOPER

CS 1003 Software design and Validation

3-0-0 3 Dr. Bibhash 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: 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. [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] Software testing methods, Testing fundamentals, Test case design, Software Testing strategies, strategic issues, Unit testing, Integration testing, Validation testing, and 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, 20023. Douglas B. West, Introduction to Graph Theory, Prentice Hall, India

Reference book:

1. Classical and Object Oriented Software Engineering with C++/Java , 3rd Ed., S.R. Schach, McGraw Hill International, New York, 1998

SUBJECT CODE

SUBJECT L-T-P CREDIT DEVELOPER

CS-1004 Advanced Topics in Algorithms 3-1-0 4 Dr. Mamata Dalui

Introduction to Algorithm – Algorithm, Data structure, program, Algorithmic problem, solution to

algorithmic problem, Representation of algorithm, Motivation for parallel algorithm, Models of Computations -

Flynn’s classification of parallel architecture etc. [3]

Algorithmic complexity – Asymptotic notations, Analysis, solution to recurrence relations. [2]

Introductions to Parallel algorithms and Energy complexity of parallel algorithms – Sequential Quick

sort, Parallel implementation of Quick sort, Derivation of energy complexities of parallel algorithms, Analysis

of parallel algorithms. [8]

Selection and Searching Problem –Order statistics, Sequential selection, Parallel selection on EREW SM

SIMD machine, Parallel search – implementation of K-ary search and its analysis. [9]

Advance Data Structures - Red-Black tree, Skip lists, Augmented Data structure – OS tree and its analysis,

Interval trees – Interval search and analysis. [6]

Matrix Multiplication - Strassen’s Matrix Multiplication Algorithm, Matrix Chain Multiplication Algorithm,

Multithreaded Matrix Multiplication. [4]

Graph algorithms – Parallel formulation for finding connected components of a graph, finding Maximum

Independent Set of a graph – parallel implementation. [4]

NP-Complete problems - Deterministic and non-deterministic polynomial time Algorithms, NP

Completeness, Cook’s theorem, Some NP complete problems like clique, Graph coloring, Hamiltonian

circuits etc.-Approximate Algorithms. [4]

Text books :

1. The Design & Analysis of A. V. Aho, J. E. Hopcroft Addison Wesley Computer Algorithms & J. D. Ullman 2. Design & Analysis of S. G. Akl Addison Wesley Parallel Algorithms

Reference books : 1. Desigining Efficient Algorithms M.J. Quinn McGraw Hill For Parallel Computers 2. Computer Algorithms Sara Basse Addison Wesley

SUBJECT CODE

SUBJECT L-T-P CREDIT DEVELOPER

CS2001 ADVANCED DATABASE 3-1-0 4 Mr. P.K. Guhathakurta

MANAGEMENT SYSTEMS

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. [4]

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. [4] Concurrency Control: Various problems due to concurrent events, Need of concurrency control protocols, Lock based and timestamp based protocols, graph based and validation based protocols. [6] 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.

[4] 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, Distributed Database Design, Semantic Integrity Control, Distributed Query Processing and Optimization, Reliability. [14]

Text books :

1. A. Silberschatz, H. F. Korth, S. Sudarshan, Database System Concepts, McGraw Hill Education.

2. S. K. Rahimi and F. S. Haug, Distributed Database Management Systems: A Practical Approach, WILEY.

Reference books :

1. M. Tamer Oezsu, P. Valduriez, Principles of Distributed Database Systems, Second Edition'' Prentice Hall.

2. Navathe,Elmasri, Fundamentals Of Database Systems, Pearson Education.

SUBJECT CODE

SUBJECT L-T-P CREDIT DEVELOPER

CS 2002

Distributed Systems. 3-0-0 3 Dr. Suchismita 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. [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. 3. Distributed Operating Systems. A.Tanenbaum. Pearson Education. 4. Distributed Systems : Concepts and Design. Coulouris et.al. Pearson Education.

SUBJECT CODE

SUBJECT L-T-P CREDIT DEVELOPER

CS-2003

ADVANCED COMPUTER ARCHITECTURE

3-0-0 3 Prof. Gautam Sanyal

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.

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.

SUBJECT CODE

SUBJECT L-T-P CREDIT DEVELOPER

CS9011

CAD for VLSI 3-1-0 4 Dr. Suchismita 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. [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

SUBJECT SUBJECT L-T-P CREDIT DEVELOPER

CODE

CS 9012 Parallel & Distributed Computing 3-1-0 4 Dr. Suchismita Roy

1. Introduction to Parallel Programming Paradigms [3]

2. Parallel Computers architectures. Shared memory systems and cache coherence. Distributed-memory

systems. Interconnection networks and routing [5]

3. OpenMP Programming. PRAM model of computation [4]

Shared Memory and Message-Passing Computing and Programming(MPI). [4]

4. Multithread Programming (PTread). [4]

5. Principles of parallel algorithm design. Decomposition techniques. Mapping & scheduling computation.

Templates [4]

6. Non-numerical Algorithms. Merging and Sorting. Graph Algorithms. Dynamic Programming.

[5]

7. Numeric Algorithms. Dense Matrix algorithms. Sparse Matrix algorithms. [3]

8. Image Processing Algorithms [3]

9. Complexity and performance issues. Performance measurement and analysis of parallel programs

[5]

Text books :

1. Parallel Programming – Techniques and applications Using Networked Workstations and Parallel

Computers, Barry Wilkinson and Michael Allen, Prentice Hall, 1999.

2. Multi-Core Programming - Increasing Performance through Software Multi-Threading, Shameem Akhter

and Jason Roberts, Intel Press 2006.

3. Parallel Programming in C with MPI and OpenMP, Michael J. Quinn, McGraw Hill 2003.

Reference books :

1. Documentation (MPI, Pthread, OpenMP).

2. Designing and Building Parallel Programs, Ian Foster, Addison Wesley, 1995.

3. Introduction to Parallel Computing by Ananth Grama, George Karypis,Vipin Kumar, and Anshul Gupta.

SUBJECT CODE

SUBJECT L-T-P CREDIT DEVELOPER

CS 9013 Wireless Networks& Mobile Computing

3-1-0 4 Dr. Sanghita Bhattacharya

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.

SUBJECT CODE

SUBJECT L-T-P CREDIT DEVELOPER

CS 9014 Theory of Computation 3-1-0 4 Dr. Bibhash 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.

SUBJECT CODE

SUBJECT L-T-P CREDIT DEVELOPER

CS 9016 Computational Geometry 3-1-0 4 Mr. Sanjib 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: Algorithms and Applications, Third Edition, Springer Verlag

Reference books : 1. Joseph O' Rourke, Computational Geometry in C, Cambridge University Press 2. Lecture notes on Computational geometry by David Mount

SUBJECT CODE

SUBJECT L-T-P CREDIT DEVELOPER

CS 9017 Information & Coding Theory 3-1-0 4 Prof. Gautam 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] 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 aspects [5] Firewalls and it’s 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

SUBJECT CODE

SUBJECT L-T-P CREDIT DEVELOPER

CS 9018 Cryptology

3-1-0 4 Dr. Sanghita Bhattacharya

Introduction: Basic objectives of cryptography, secret-key and public-key cryptography, cryptanalysis, attack models, classical cryptography. [6] Stream ciphers: Stream ciphers based on linear feedback shift registers, unconditional security. [2]

Public-key parameters: Modular arithmetic, gcd, primality testing, Chinese remainder theorem, modular square roots, finite fields. [4]

Block ciphers :Modes of operation, DES and its variants (triple DES), AES. [8]

Hash Function: Properties of hash functions, MD2, MD5 and SHA-1, keyed hash functions, attacks on hash functions. [4]

Intractable problems: Integer factorization problem, RSA problem, modular square root problem, discrete logarithm problem, Diffie-Hellman problem, known algorithms for solving the intractable problems. [2]

Public-key encryption: RSA, Key exchange: Diffie-Hellman algorithms, [4]

Digital signatures: RSA, DSS signature schemes [2]

Network issues: Certification, PKI, SSL, VPN, Firewall [4]

Advanced topics: Elliptic and hyper-elliptic curve cryptography [2]

Text books :

1. Cryptography and Network Security by William Stallings 2. Cryptography and Network Security by Forouzan & D Mukherjee

Reference books : 1. Cryptography and Network Security by AtulKahate

SUBJECT CODE

SUBJECT L-T-P CREDIT DEVELOPER

CS 9019 Network Security 3-1-0 4 Dr. Subrata Nandi

Introduction: Basic objectives of cryptography, secret-key and public-key cryptography, cryptanalysis, attack models, classical cryptography. [6] Stream ciphers: Stream ciphers based on linear feedback shift registers, unconditional security. [2]

Public-key parameters: Modular arithmetic, gcd, primality testing, Chinese remainder theorem, modular square roots, finite fields. [4]

Block ciphers :Modes of operation, DES and its variants (triple DES), AES. [8]

Hash Function: Properties of hash functions, MD2, MD5 and SHA-1, keyed hash functions, attacks on hash functions. [4]

Intractable problems: Integer factorization problem, RSA problem, modular square root problem, discrete logarithm problem, Diffie-Hellman problem, known algorithms for solving the intractable problems. [2]

Public-key encryption: RSA, Key exchange: Diffie-Hellman algorithms, [4]

Digital signatures: RSA, DSS signature schemes [2]

Network issues: Certification, PKI, SSL, VPN, Firewall [4]

Advanced topics: Elliptic and hyper-elliptic curve cryptography [2]

Text books :

1. Cryptography and Network security by William Stallings – Pearson Education Publisher

2. Cryptography and Network security by Forouzan - Tata McGraw-Hill Education

Reference books :

1. Cryptography and Network security by Atul Kahate - Tata McGraw-Hill Education

SUBJECT CODE

SUBJECT L-T-P CREDIT DEVELOPER

CS 9021 Soft Computing 3-1-0 4 Dr. Tandra 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.

Reference books :

1. B. Yegnanarayana , “Artificial Neural Networks” 2. David E. Goldberg, “Genetic Algorithms in Search, Optimization, and Machine Learning”, Addison-

Wesley Publishing Company.

3. George Klir and Bo Yuan, “Fuzzy sets and Fuzzy logic”, Prentice Hall of India.

SUBJECT CODE

SUBJECT L-T-P CREDIT DEVELOPER

CS 9022 PATTERN RECOGNITION 3-1-0 4 Dr. Goutam 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 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

SUBJECT CODE

SUBJECT L-T-P CREDIT DEVELOPER

CS 9023 DATA MINING 3-1-0 4 Dr. Goutam Sarker

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] 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

SUBJECT CODE

SUBJECT L-T-P CREDIT DEVELOPER

CS 9024 Computer Vision 3-1-0 4 Prof Gautam 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

.

SUBJECT CODE

SUBJECT L-T-P CREDIT DEVELOPER

CS 9025 OPTICAL NETWORKS

3-1-0 4 Dr. Tanmay De

Introduction: Optical fiber principles, Optical transmission system, Wavelength Division Multiplexing(WDM), Optical Network Architectures, Different issues in wavelength routed networks. [06]

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. Fairness and admission control algorithms. Distributed control protocols. [08] Virtual Topology Design: Physical and Virtual topology, Traffic routing over virtual topology, Limitations on virtual topology, Virtual topology problem formulation, Virtual topology design heuristics. [05] 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. [05] Wavelength Rerouting Algorithm: Benefits of wavelength rerouting, Issues in wavelength rerouting, Rerouting algorithms. [05]

Traffic Grooming: Benefits of traffic grooming, Node architecture, Problem formulation, Traffic grooming algorithms for Mesh WDM networks. [05]

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. Multicast traffic grooming. [06]

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)

SUBJECT CODE

SUBJECT L-T-P CREDIT DEVELOPER

CS 9029 EMBEDDED SYSTEMS 3-1-0 4 Dr. Bibhash 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

SUBJECT CODE

SUBJECT L-T-P CREDIT DEVELOPER

CS9030

High performance Computing 3-1-0 4 Prof. Gautam Sanyal

Introduction: Implicit parallelism, Memory system performance [2] 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.

SUBJECT CODE

SUBJECT L-T-P CREDIT DEVELOPER

CSE 9031

Complex Network Theory 3-1-0 4 Dr. Subrata 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 [6] Introduction to the Network Tools and Softwares Pajek, UCINet, GraphViz and others. [2] 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, generalized random graphs, the configuration model, generating functions, power-law degree distribution, directed graph, bipartite graph, degree correlations. [10] Random walk on Graphs Limitatios of page rank, pange rank++, HITS, Chinese Whispers, Affinity Propagation algorithm [9] Models of Network Growth Price’s model, Barabasi & Albert’s model, other growth models, vertex copying models, Bipartite Network [3] Processes taking place on Networks Percolation theory and network resilience, Epidemiological processes. [2]

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.

SUBJECT CODE

SUBJECT L-T-P CREDIT DEVELOPER

CS9032

Testing and Verification of VLSI Circuits

3-1-0 4 Dr. Suchismita Roy

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] 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. 3. Logic in Computer Science. Huth and Ryan. CambridgeUniversity Press.

Reference books :

1. Model Checking. Clarke et. al. MIT Press. 2. VLSI Test Principles and Architectures. LT Wang et.al. Morgan Kaufman.

SUBJECT CODE

SUBJECT L-T-P CREDIT DEVELOPER

CS 9033

ADVANCE ARTIFICIAL INTELLIGENCE

3-1-0 4 Dr. Goutam Sarker

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 :

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

SUBJECT CODE

SUBJECT L-T-P CREDIT DEVELOPER

CS 9034

Software Testing 3-1-0 4 Dr. Bibhash Sen

Fundamental Of Software Testing: Definition Of Testing, Approaches to Testing ,Popular Definition Of testing, workbench, Principle Of Software Testing, salient features of Good testing, Test planning, Test team efficiency, Challenges in Testing, Defect, Error, or Mistake in Software. [5] Software Verification and validation: Introduction, verification, verification Work Bench, Methods of verification, Types of Review on the Basis of stage/phase, Examples of Entities involved in verification , Reviews in Testing Lifecycle, Coverage in verification(Test Designing), Concerns of verification, validation, validation Work Bench, Level Of validation, Coverage in Validation, Acceptance Testing, Management Verification and validation , software Development verification [8] Defect Management: Introduction, Defect classification, Defect Management Process, Defect Life Cycle, Defect Template, Defect Management process(Fixing and Root cause of defect), Estimate Expected impact of Defect, Why defect Management Needs Risk Discussion?, Technique Of finding Defects, Reporting a Defect [7] Levels Of Testing: Introduction, proposal Testing, Requirement Testing, Design Testing, Code Review, Black box testing, White box testing, Module Testing, Integration Testing, Sandwich Testing, Critical path First, Subsystem Testing, System Testing, Mutation Testing, Testing Stages [7] Special Tests (Part I): Introduction, Complexity Testing, Graphical User Interface Testing, Requirement Testing(Specification Testing),Regression Testing, Smoke Testing [7] Testing Tools: Introduction, Features of Test Tool, Static Testing tools, Dynamic Testing Tools, Advantages Of Using Tools, Disadvantages Of Using Tools, When to Use Automated Test Tools [6] Test Planning: Introduction, Content of Testing Policy in General, Test Strategy, Content of Test Strategy in General, Test Planning , Test Plan, Test Estimation, Test Standard, Essential Activities in testing, Test scripts, Test management Software, Test Log Document, Test File, Test Progress Monitoring [6] Test Metrics and Test Reports: Introduction, Effectiveness of Testing, Defect Density, Defect Leakage Ratio (Defect Life), Residual Defect Density (RDD), MTBF/MTTR, Implementation Measurement Reporting System in an Organization, Test Reports, [7] Test process Improvement: Introduction, The Need for Test Process Improvement, Test Process Improvement Model Stages [4]

Text books :

1. M G Limaye “Software testing “Mc Graw Hill Education (India) Private Limited, New Delhi

SUBJECT CODE

SUBJECT L-T-P CREDIT DEVELOPER

CS 9035

Principles of Programming Languages

3-1-0 4 Dr. Bibhash Sen

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 and [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.

SUBJECT CODE

SUBJECT L-T-P CREDIT DEVELOPER

CS 9038

Internet Technologies 3-1-0 4 Dr. Sanghita Bhattacharya

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]

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/

3. Request for Comments (RFC) - IETF - http://www.ietf.org/rfc.html

4. Linux Advanced Routing & Traffic Control HOWTO -http://tldp.org/HOWTO/Adv-Routing-HOWTO/index.html

SUBJECT CODE

SUBJECT L-T-P CREDIT DEVELOPER

CS 9039

Computer Graphics & Application 3-1-0 4 Prof. Gautam 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

Reference books :

1. Interactive Graphics – F W Newman.

SUBJECT CODE

SUBJECT L-T-P CREDIT DEVELOPER

CS 9039

Advanced Graph Theory 3-1-0 4 Dr. Sanghita Bhattacharya

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 [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

LABORATORY COURSES

SUBJECT CODE

SUBJECT L-T-P CREDIT DEVELOPER

CS1051

Network and Systems Laboratory 0-0-4 2 Dr. Subrata Nandi

1.Addition, multiplication, factorial of very large numbers (represent numbers using strings).

2.Converting an unindented code to indented code.

3. Hashing using multiple threads and multiple processes.

4. Problems using semaphores.

5.TCP/UDP Socket Programming

a.Multicast & Broadcast Sockets

b.Implementation of a Prototype Multithreaded Server [3]

6.Sending an Image/Video file from client machine to a group of machines using Multicast programming [3]

7.Implementation of

a.Data Link Layer Flow Control Mechanism (Stop & Wait, Sliding Window)

b.Data Link Layer Error Detection Mechanism (Cyclic Redundancy Check)

c.Data Link Layer Error Control Mechanism (Selective Repeat, Go Back N) [4]

8.Concept of Raw Socket Programming

a.Implementation of Ping Tool. [3]

8. Implementation of a multithreaded reservation system (use semaphores).

Text books :

Reference books :

SUBJECT CODE

SUBJECT L-T-P CREDIT DEVELOPER

CS 1052

Software Engineering Laboratory 0-0-3 2 Dr. Bibhash Sen

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 Analyzing 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 :

SUBJECT CODE

SUBJECT L-T-P CREDIT DEVELOPER

CS 2051

Simulation and Modeling Laboratory

0-0-3 2 Dr. Tandra Pal

Introduction to modeling; modeling concepts and definitions, Introduction to MATLAB, scripts, MATLAB arrays, array math, MATLAB programming mechanisms (conditionals, loops, etc.), MATLAB i/0, Advanced graphing in MATLAB; curve fitting, Develop MATLAB skills to explore modeling concepts. Linear models, Nonlinear functions; modeling examples, Stochastic models, Final project overview and Requirements, Accuracy and precision in modeling; verification and validation; Project plan, Project implementation; Project presentations

Text books :

Reference books :