DELHI TECHNOLOGICAL UNIVERSITY

SCHEME OF EXAMINATION
AND
COURSE OF READING
FOR

M.Tech (COMPUTER SCIENCE AND

ENGINEERING)

Syllabus applicable to the students seeking admission to

M.Tech (Computer Science and Engineering) Course
 M.Tech (Computer Science and Engineering)
SCHEME

Internal External Total Credits Sem.

Paper Subject Title of the Course Marks. Marks Marks Total
No. Code
No.
GR: A
1 CO 501 Advanced Database Management 50 100 150 3
Systems
2 CO 502 Parallel Computer Architecture 50 100 150 3
3 CO 503 Data Structures and Algorithms 50 100 150 3
4 CO 504 Software Lab 30 70 100 2 1000
GR: B (20
5 CO 551 Distributed System 50 100 150 3 credits
6 CO 552 Computer Networks 50 100 150 3 )
7 CO 553 Network Programming and 30 70 100 2
Simulation Lab
8 CO 554 Self-study – Seminar-I 50 - 50 1
GR: C
9 CO 601 Information and Network Security 50 100 150 3
10 CO 602 Elective-I 50 100 150 3
11 CO 603 Elective-II 50 100 150 3
12 CO 604 Information and Network Security 30 70 100 2 1000
Laboratory
GR: D (20
12 CO 651 Elective-III 50 100 150 3
13 CO 652 Elective-IV 50 100 150 3 credits
14 CO 653 Lab Based on Elective III or IV 30 70 100 2 )
15 CO 654 Minor Project-I 50 - 50 1
GR: E
16 CO 701 Elective-V 50 100 150 3
17 CO 702 Elective-VI 50 100 150 3 1000
18 CO 703 Self-study Seminar –II 100 - 100 1 (15
19 CO 704 Minor Project-II - 300 300 4 credits
20 CO 705 Major Project-I - 300 300 4 )

GR: F
21 CO 801 Major Project-II - 1000 1000 15 1000
(15
credits
)
 LIST OF ELECTIVES

Electives I (Group C): Any one subject can be chosen from the following:

1. Object Oriented Software Engineering.

2. Artificial Intelligence and Expert Systems.

3. Real-Time Systems.

4. Design of Embedded Systems.

5. Digital Signal Processing.

6. Robotics Engineering.

Electives II (Group C): Any one subject can be chosen from the following:

1. Bioinformatics.
2. Wireless & Mobile Communication

3. Fault Tolerant and testable Systems.

4. Advanced Computer Graphics.

5. Reliable System Design

Electives III (Group D): Any one subject can be chosen from the following:

1. Optimization Techniques
2. Distributed Algorithms.

3. Modeling & Simulation.

4. Quantum Computing.

5. Enterprise Computing in JAVA.

Electives IV (Group D): Any one subject can be chosen from the following:

1. Optical Networks
2. Cluster & Grid Computing.
 3. Software Testing.

4. Computer Vision.

5. Nano Technology

Electives V (Group E): Any one subject can be chosen from the following:

1. Data warehousing and Data Mining.

2. Pattern Recognition.

3. Natural Language Processing.

4. Soft Computing

5. Semantic Web.

6. Digital Image Processing

Electives VI (Group E): Any one subject can be chosen from the following:

1. Geo-Informatics
2. Advances in Internet & Web Technology.

3. Advances in Multimedia Technology.

4. VLSI Design.

5. VLSI Design and CAD of VLSI

6. Software Project Management

 CO 501 ADVANCED DATABASE MANAGEMENT SYSTEMS

Lectures :- 3 Hrs per week Theory :- 150

Marks

UNIT I:
Relational Databases: Integrity Constraints revisited, Extended ER diagram, Relational
Algebra & Calculus, Functional, Muiltivalued and Join Dependency, Normal Forms, Rules
about functional dependencies.

UNIT II:
Advanced Transaction Processing: Nested and Multilevel Transactions, Compensating
Transactions and Saga, Long Duration Transactions, Weak Levels of Consistency,
Transaction Work Flows, Transaction Processing Monitors, Schedules, Serializability-
conflict and view.

UNIT III:
Query Processing: General strategies for query processing, transformations, expected size,
statistics in estimation, query improvement, view processing, query processor.

UNIT IV:
Query Optimization: Indexing and Query Optimization, Limitations of Relational Data
Model, Null Values and Partial Information.

UNIT V:
Parallel and Distributed Databases: Distributed Data Storage – Fragmentation &
Replication, Location and Fragment Transparency Distributed Query Processing and
Optimization, Distributed Transaction Modeling and concurrency Control, Distributed
Deadlock, Commit Protocols, Design of Parallel Databases, Parallel Query Evaluation.

UNIT VI:
Active Database and Real Time Databases: Triggers in SQL, Event Constraint and Action:
ECA Rules, Query Processing and Concurrency Control, Compensation and Databases
Recovery

Text Books:
1. Elmarsi, Navathe, Somayajulu, Gupta, “Fundamentals of Database Systems”, 4th
2. Edition, Pearson Education, 2007.
3. Garcia, Ullman, Widom, “Database Systems, The complete book”, Pearson.

Text Books:
1. Date, Kannan, Swaminathan, “An Introduction to Database Systems”, 8th Edition
Pearson Education, 2007.
2. Silberscatz, Korth, Sudarshan, “Database System Concepts”, Mcgraw Hill, 6 th
Edition, 2006

Text Books:
1. Ivar Jacobson, Grady Booch, James Rumbaugh, “The Unified Software Development
Process”, Pearson Education.

2. Yourdon, “Modern Structured Analysis”, PHI.

1. K.K Aggarwal and Yogesh Singh, “Software Engineering”, New Age Publications,
2009.

CO 502 PARALLEL COMPUTER ARCHITECTURE

Lectures :- 3 Hrs per week Theory :- 150

Marks

UNIT I:
Parallel computer models: The state of computing, Classification of parallel computers,
Multiprocessors and multicomputers, Multivector and SIMD computers.
Program and network properties: Conditions of parallelism, Data and resource
Dependences, Hardware and software parallelism, Program partitioning and scheduling,
Grain Size and latency, Program flow mechanisms, Control flow versus data flow, Data flow
Architecture, Demand driven mechanisms, Comparisons of flow mechanisms.
UNIT II:
System Interconnect Architectures: Network properties and routing, Static interconnection
Networks, Dynamic interconnection Networks, Multiprocessor system Interconnects,
Hierarchical bus systems, Crossbar switch and multiport memory, Multistage and combining
network.
UNIT III:
Advanced processors: Advanced processor technology, Instruction-set Architectures, CISC
Scalar Processors, RISC Scalar Processors, Superscalar Processors, VLIW Architectures,
Vector and Symbolic processors
UNIT IV:
Pipelining: Linear pipeline processor, nonlinear pipeline processor, Instruction pipeline
Design, Mechanisms for instruction pipelining, Dynamic instruction scheduling, Branch
Handling techniques, branch prediction, Arithmetic Pipeline Design, Computer arithmetic
principles, Static Arithmetic pipeline, Multifunctional arithmetic pipelines.

UNIT V:
Memory Hierarchy Design: Cache basics & cache performance, reducing miss rate and
miss penalty, multilevel cache hierarchies, main memory organizations, design of memory
hierarchies.
UNIT VI:
Multiprocessor architectures: Symmetric shared memory architectures, distributed shared
memory architectures, models of memory consistency, cache coherence protocols (MSI,
MESI, MOESI), scalable cache coherence, overview of directory based approaches, design
challenges of directory protocols, memory based directory protocols, cache based directory
protocols, protocol design tradeoffs, synchronization. Scalable point – point interfaces:
Alpha364 and HT protocols, high performance signaling layer.

Text Books:
1. Kai Hwang, “Advanced computer architecture”; TMH.
2. D. A. Patterson and J. L. Hennessey, “Computer organization and design”.
3. J.P.Hayes, “computer Architecture and organization”; MGH.

Text Books:

1. Harvey G.Cragon,”Memory System and Pipelined processors”, Narosa Publication.

2. V.Rajaranam & C.S.R.Murthy, “Parallel computer”; PHI.
3. R.K.Ghose, Rajan Moona & Phalguni Gupta, “Foundation of Parallel Processing”,
Narosa Publications.
4. Kai Hwang and Zu, “Scalable Parallel Computers Architecture”, MGH.
5. Stalling W, “Computer Organisation & Architecture”, and PHI.

CO 503 DATA STRUCTURES AND ALGORITHMS

Lectures:- 3 Hrs per week Theory :- 150
Marks

Unit I
Review of Elementary data structures : Arrays, Linked list, Stacks, Queues, Binary Trees,
Hashing, Sorting and Searching techniques, Sparse matrices: Properties of sparse matrices,
linked list representation of sparse matrices, Analyzing algorithms.

Unit II
Advanced Trees: Definition Operations on B Trees, Weight Balanced Trees (Huffman Trees),
2-3 Trees and Red-Black Trees. Augmenting Red-Black Trees to Dynamic Order Statics and
Interval Tree Applications. Operations on Disjoint sets and its union find problem
Implementing Sets. Dictionaries, Priority Queues and Concatenable Queues using 2-3 Trees.

Unit III
Advanced Data Structures: Binomial heaps, Fibonacci heaps, Union Find Data Structures,
Amortization, Self-adjusting and persistent data structures.

Unit IV

GRAPH THEORY ALGORITHMS: Definitions for Graphs, Algorithms for

Connectedness, Finding all Spanning Trees in a Weighted Graph and Planarity Testing
Breadth First and Depth First Search, Topological Sort, Strongly Connected Components and
Articulation Point. Single source shortest path and all pair shortest path algorithms.

UNIT V
Greedy Method: General Method, Knapsack problem, Single source shortest path. Dynamic
Programming: General method, 0/1 Knapsack problem, All pair shortest path. Backtracking:
Sum of subsets, 8-queens problem, and Hamiltonian cycles.

UNIT VI
Advanced Algorithms: Approximation algorithms for NP complete problem (Vertex cover,
traveling salesman), Planer & Plane graphs, Algorithms for matching, Flow and circular
problems

Text Books:
1. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, “Introduction to
Algorithms”, MIT Press.
2. Ellis Horowitz, Sartaj Sahni Sanguthevar Rajasekaran, “The Design and Analysis of
Computer Algorithms”.
3. Aho, Hopcraft & Ulman, The Design and Analysis of Computer algorithms”, Addison
Wesley.
4. Tannenbaum, “Data Structures”, PHI

Reference Books:
 1. R.E. Tarjan, “Data Structures and Network algorithms”, SIAM Regional Conference
series in applied mathemetics..
2. Rajeev Motwani and Prabhakar Raghavan, “Randomized Algorithms”, Cambridge
University Press.
3. Dexter C. Kozan, “The Design & Analysis of Algorithms”, Springer-Verlag.
4. Narsingh Deo-Graph Theory with Application to Engineering and Computer
Science,Prentice Hall of India.

CO 504 SOFTWARE LAB

Practical: - 2 Hrs per week Practical: - 100
Marks

Software Lab based on using latest CASE Tools. At least one Minor Project to be
developed for an application based on methodologies covered in the course.
CO 551 DISTRIBUTED SYSTEM

Lectures:- 3 Hrs per week Theory :- 150 Marks

UNIT I:
Introduction: Distributed System Models, Transparency, Scalability, Inter-process
Communication, Middleware, issues in design of Distributed systems: current & future.

UNIT II:
Communications: Layered Protocol, Distributed Objects & Remote Method Invocation,
Remote Procedure Call, Synchronization in communication, sockets, MPI, Message brokers,
Data Streams.

UNIT III:
Process and Synchronization: Processes, Threads, Code Migration, Logical clocks, vector
clocks, direct dependency clocks, matrix clocks, Serializability.

UNIT IV:
Resource Allocation: Distributed Shared Memory, Process Scheduling, Load Balancing &
Load Sharing, Mutual Exclusion, Election algorithms.

UNIT V:
Distributed File Systems: Coordination & Agreement, Distributed Transaction, Consistency
& Replication: Consistency Models, Distribution & Consistency Protocols.

UNIT VI:
Advanced Topics in Distributed Systems: Parallel Processing: Parallel & Distributed
Programming, Case Studies in detail & research directions.
Text Books:
1. P.K.Sihna, “Distributed Operating Systems: Concepts and Design”, PHI.
2. Andrew S. Taenbaum and Maarten Van Steen, “Distributed Systems: Principles and
Paradigms”, Prentice Hall.
3. R. Chow, T. Johnson. Addison, “Distributed Operating Systems and Algorithms”,
Wesley Publishing Company.

Text Books:

1. Coulouris, G, Dollimore, J., and Kindberg, T., “Distributed Systems: Concepts and
Design”, Addison-Wesley.

CO 552 COMPUTER NETWORKS

Lectures: - 3 Hrs per week Theory: - 150 Marks

UNIT I:
Introduction: Introduction to Network models-ISO-OSI and TCP/IP models. Review of
Physical layer and Data link layers, Review of Cellular Networks, LAN (IEEE 802.3, 802.5,
FDDI), Wireless 802.11, WAN (PPP, ATM, ISDN) standards, and Overview of Bridging and
VLAN (802.1Q).

UNIT II:
Network layer: Internet architecture and addressing, internetworking, IPv4, overview of
IPv6, Routing Protocols- RIP, OSPF, BGP, NAT, ARP and RARP.

UNIT III:
Transport layer: Design issues, Connection management, Transmission Control Protocol
(TCP), User Datagram Protocol (UDP), Finite state machine model, TCP congestion control

UNIT IV:
Application layer: HTTP, DNS, SMTP, DHCP, SNMP, Overlay Networks

UNIT V:
Network Security: Cryptography, Firewalls, Secure Socket Layer (SSL) and Virtual Private
Networks (VPN), IPSec.

UNIT VI:
Case study: Study of various network simulators, Network performance analysis using NS2
Text Books:
1. Behrouz A. Forouzan, “TCP/IP Protocol Suit”, TMH, 2000.
2. Tananbaum A. S., “Computer Networks”, 3rd Ed., PHI, 1999.
3. Black U, “Computer Networks-Protocols, Standards and Interfaces”, PHI, 1996.

Text Books:
4. Stallings W., “Data and Computer Communications”, 6th Ed., PHI, 2002.
5. Stallings W., “SNMP, SNMPv2, SNMPv3, RMON 1 & 2”, 3rd Ed., Addison Wesley,
1999.
6. Laurra Chappell (Ed), “Introduction to Cisco Router Configuration”, Techmedia,
1999.
7. Peterson and Davie. Computer Networks (2nd Edition), Morgan Kaufmann
Publishers, 1999.
8. Internetworking with TCP/IP Vol.1: Principles, Protocols, and Architecture (4th
Edition), Douglas Comer.

CO 553 NETWORK PROGRAMMING AND SIMULATION

LAB
Practical: - 2 Hrs per week Practical: - 100
Marks

Network Programming and Simulation Lab based on network protocols and simulations
tools like ns-2. At least one Minor Project based on methodologies covered in Computer
Networks and Distributed Systems.

CO 601 INFORMATION AND NETWORK SECURITY

Lectures: - 3 Hrs per week Theory: - 150
Marks

UNIT I:
Introduction to Data Security: General Security Principles, Communication Security,
Design of Secure System.

UNIT II:
Conventional Encryption Principles: Conventional encryption algorithms, cipher block
modes of operation, location of encryption devices, key distribution Approaches of Message
Authentication, Secure Hash Function and HMAC
UNIT III:
Public-key cryptography Principles: Recent Public key cryptography algorithms such as
RSA, DSS etc., digital signatures, digital Certificates, Certificate Authority and key
management Kerberos, X.509 Directory Authentication Service.

UNIT IV:
Latest Trends and solutions in Information Security: Web Security, Firewall Design
Principles, Trusted Systems, Intrusion Detection System. Recent trends in cryptosystem.

Text Books:
1. “Cryptography and Network Security”, William Stallings, Third Edition, Prentice Hall
International.
2. “Basic Methods of Cryptography”, Jan C A, Cambridge University Press.
3. “Information Security Intelligence: Cryptographic Principles & Applications”,
Thomas Calabrese, Thomson Learning.

Reference Books:
1. “Modern Cryptography: Theory and Practice”, Wenbo Mao, Pearson Education.
2. “Cryptography and Data Security”, Dorothy Elizabeth Robling Denning, Addison
Wesley.

First Year M.Tech.(CSE) II Semester

Group “C” Subjects

CO-602 ELECTIVE I

OBJECT ORIENTED SOFTWARE ENGINEERING

UNIT I
Introduction: Object Oriented system concepts and Principles, Object Oriented system
development, Component reuse, The common process framework for Object Oriented
processes, System Development and Methodologies, object oriented software estimation.

UNIT II
System development: System as model building, model architecture, The importance of
modeling, principle of modeling, object oriented modeling, Introduction to Object-oriented
Methodologies such as Unified Modeling Language, Overview of UML, conceptual model of
UML, architecture, software development lifecycle using Rational Unified Process

UNIT III
Object Oriented Analysis: requirement model, analysis model, Object oriented analysis
using methods of Rumbaugh.

Software Design: Software design Models, Object oriented methodologies of Booch,

design model, System development using various UML Diagrams.

UNIT IV

UML Methodology: Detailed study of various UML Diagrams, System Analysis using UML
Diagrams

UNIT V

Object Oriented Testing and metrics: Path Testing, State based testing, Class Testing,
object oriented metrics.

UNIT VI

Applications & Tools: A complete case study of Software development using above
Methodologies, Concepts of Computer-Aided Software Engineering and knowledge about
current CASE tools use in the industry.

Suggested Readings:
Text Books:

1. R . S. Pressman, “Software Engineering – A practitioner’s approach”, 5th Ed., McGraw

Hill Int. Ed., 2001.
2. I. Jacobson, M. Christerson, P. Jonsson, G. Overgaard, “Object Oriented Software
Engineering”, 2nd Edition, Pearson Education, 2007.
3. G. Booch, J Rumbaugh, I Jacobson, “The Unified Modeling Language User Guide”
11th Ed., Pearson Education, 2003.

Reference Books:
1 I. Sommerville, “Software Engineering”, Addison Wesley, 2004

ARTIFICIAL INTELLIGENCE AND EXPERT SYSTEMS

Unit 1 Introduction: The AI Problems, AI Techniques, Basic Problem solving methods, state
space search, problem characteristics, Production systems characteristics, issues in design of
Intelligent search algorithm

Unit 2 Heuristic search Techniques: Hill climbing techniques, Best First search, Problem
Reduction, Constraint Satisfaction, Means-End Analysis.

Unit 3 Knowledge Representation: Knowledge Representation issues, Knowledge

Representation using Predicate logic, Semantic Nets, Semantic Frames, Conceptual
Dependency, scripts, Knowledge representation with uncertainty.

Unit 4 Programming Languages: Fundamental and concepts of Programming languages

like Prolog or Lisp. Relationship of languages with Knowledge representation and
inferences.

Unit 5 Expert Systems: What and Why of expert systems, Structure of an Expert system
interaction with an expert system, Design of an Expert system, implementing expert system
shell Expert System Development techniques & tools with Case Study, Construction of
Programs using different data structure.

Unit 6 Advanced topics:, Applications of AI in Game Playing & Natural Language

Processing. Concepts of Fuzzy Logic. Introduction to Intelligent Agents.

Suggested Readings:-
Text Books:
1. Artificial Intelligence, E. Rich and K. Knight, TMH, 2nd ed., 1992.
2. Introduction to Expert Systems, Peter Jackson, AWP, M.A., 199.
3. Introduction to AI and Expert Systems, D.W. Patterson, PHI, 1992.

Reference Books:

1. Artificial Intelligence - an Engineering Approach, R.J. Schalkoff, McGraw Hill Int

Ed., Singapore, 1992.
2. Principles of AI, N.J. Nilsson, , Narosa Publ. House, 1990.

REAL-TIME SYSTEMS

Unit 1 Real-time systems: Real-time systems models, Types of real-time systems, Internal
structure of real-time systems, Performance measures, Examples of real-time systems and
real-world applications, Modeling & Designing real-time systems

Unit 2 Real-Time Process Management: Task scheduling for Uniprocessor systems,

handling priorities with critical section, interrupts, task allocation & scheduling for
multiprocessor systems, adaptive scheduling.
Unit 3 Programming Environment: In depth Knowledge of RTOS programming languages,
tools & techniques.

Unit 4 Real-Time System Design: Design techniques for Reliability, Fault Tolerance &
other application specific quality considerations.

Unit 5 Trends in Real-Time System Design & Development in fields such as Robotics.

Unit 6 Introduction to research topics.

Suggested Readings:-
Text Books:
1. A.C. Shaw, Real-Time Systems and Software, Wiley.
2. J.E. Cooling, Real-Time Software Systems, International Thompson Computer
Press.
3. W.A. Halang and K.M. Sacha, Real-Time Systems, World Scientific.

Reference Books:
1. Real-Time Systems Design and Analysis, P.H. Laplante, IEEE Press.
2. Real-Time Systems, J. Liu, Prentice-Hall, 2000.
3. Real-Time Computer Control, R. Bennett, Prentice-Hall.
4. Real-Time Systems, C.M. Krishna and K.G. Shin, McGraw-Hill.

DESIGN OF EMBEDDED SYSTEMS

UNIT I:
Introduction to Embedded Real time Systems: Fundamental components of ESD,
Preprocessing, Compiling, cross compiling, Linking, Locating, compiler driver, Linker script,
Program segments, Type of memory, Memory Management in Embedded real time systems,
Interrupt and ISR

UNIT II:
Introduction to Real-time theory: Scheduling theory, Rate Monotonic Scheduling,
Utilization bound theorem, RTOS, Task Management, Task management, Race condition,
Priority inversion, ISRs and scheduling, Inter-Task communication, Timers

UNIT III:
Microcontrollers: Role of processor selection in Embedded System (microprocessor vs
microcontroller), 8051 microcontroller: architecture, assembly language programming,
instruction set, addressing mode, logical operation, arithmetic operation, interrupt handling,
Timing subroutines

UNIT IV:
Serial data communication, RS-232, USB, I2C, Interfacing with ADC & sensors, Interfacing
with DAC, Interfacing with external ROM, Interfacing with 8255 IEEE 1149.1 (JTAG)
testability: Boundary Scan Architecture
Text Books:

1. Sriram V Iyer and Pankaj Gupta, “Embedded Real-time Systems Programming”,

TMH.
2. Mazidi and Mazidi, “The 8051 Microcontroller”, PHI.
3. Embedded System by Raj Kamal, TMH.

Text Books:

1. The 8051 Microcontroller by Kennth J. Ayala, Thomson DelMar Learning.

2. Microcontrollers by Deshmukh, TMH.
3. 8051 Microcontroller & Embedded systems by Rajiv Kapadia, Jaico.
4. Computer as components by wayne wolf, Harcourt India Pvt. Ltd.
5. Real time System and Analysis by Philip A. Laplante, Wiley.

DIGITAL SIGNAL PROCESSING

UNIT I:
Introduction: Signals and signal Processing, characterization & classification of signals,
typical Signal Processing operations, example of typical Signals, typical Signals Processing
applications.

UNIT II:
Time Domain Representation of Signals & Systems: Discrete Time Signals, Operations on
Sequences, Linear shift-invariant systems, Stability and Causality, Linear constant coefficient
difference equations, Frequency domain representation of discrete-time systems, symmetry
properties of the Fourier transform, Sampling of continuous-time systems.

UNIT III:
Transforms: Z-transforms, Inverse Z-transform, properties of Z-transform, & its applications
in system analysis & design. Discrete Fourier Transform (DFT) & its properties, computation
of the DFT of real sequences, Linear Convolution using the DFT.

UNIT IV:
Digital Filter Structure: Block Diagram representation, Signal Flow Graph Representation,
Equivalent Structures, Basic FIR Digital Filter Structures: Direct forms, Transposed forms,
Cascaded forms, Poly phase realization and Linear phase FIR structures. Basic IIR Filter
Structures: Direct forms, Transposed forms, Cascaded realizations and Parallel realizations.
All pass filters, Digital Sine-Cosine Generator.

UNIT V:
Digital Filter Design: Design of IIR Digital filters from analog filters, Properties of FIR
digital filters, Desgin of FIR filters using Windows, Computer aided design of FIR filters,
Comparison of IIR and FIR digital filters.

UNIT VI:
Computation of Discrete Fourier Transform: Complexity of the DFT computation by
direct method, Goertzel algorithm, Decimation – in-time FFT algorithms, Decimation-in
frequency FFT algorithms.

Text Books:
1. Alan V. Oppenheim & Ronald W. Schafer, “ Digital Signal Processing” PHI.
2. Sanjit K. Mitra, “ Digital Signal Processing: A computer based approach” TMH,
Second Edition.
3. Chi-Tsong Chen, “Digital Signal Processing, Spectral Computation and Filter Design”
Oxford University Press.

Text Books:
1. Monson H. Hayes, “ Schaum’s Outline of Digital Signal Processing”, Mcgraw Hill.
2. Richard W. Hammming, “Digital Filters”, Dover Pubns.
3. Lars Wanhammar, “ DSP Integrated Circuits”, Academic Press, First edition.
4. Simon S. Haykin, “ Adaptive Filter Theory, “ Prentice Hall, 3rd Edition.
 ROBOTICS ENGINEERING

UNIT I:
Introduction: An overview of Robotics and its applications in various applications domains
such as manufacturing, assembly and inspection and spray and paintings.

UNIT II:
Manipulators: Manipulator Kinematics, Forward and inverse kinematics, trajectory
Planning Motions, path planning, Robotics Programming Languages.

UNIT III:
Sensing: Methods, Types of Sensors & sensor calibration, Control Robot Sensing.

UNIT IV:
Computer Vision: Illumination techniques, imaging geometry, stereovision, segmentation.

UNIT V:
Applications. Current and future applications in Industry and study of research aspects in
Robotics

UNIT VI:

Advance studies

Text Books:
1. Introduction to robotics J. J. Craig, (Third ed 2003) Prentice Hall.
2. Robotic Engineering, Richard D. Klafter, Prentice Hall.
3. Robotics, Fu K S, McGraw Hill.

Reference Books:
1. An Introduction to Robot Technology, / P. Coiffet and M. Chaironze / Kogam Page
Ltd.
2. Industrial Robotics , Groover M P /Pearson Edu, 1983 .
3. Robotics and Control / Mittal R K & Nagrath I J / TMH.
4. Robot Dynamics & Control – Mark W. Spong and M. Vidyasagar / John Wiley &
Sons (ASIA) Pte Ltd.
 First Year M.Tech.(CSE) II Semester
Group “C” Subjects

CO-603 ELECTIVE II
BIOINFORMATICS

UNIT I:
Introduction: biology, physics: Biological hierarchy, Information stages, Physical processes,
Information understanding

UNIT II:
Methods of gene sequencing: Detailed discussion on Sequences searching methods.
Gene expression: Current and prospective methods of gene profiling. Data acquisition. Data
standardization. Linear approximations of data; DNA chips, Protein targeting, Data
normalization, Linear view.

UNIT III:
Statistics approaches: Probabilistic notions, Multivariate issues, Clustering, Information
handling, Experimental and computational methods of structure determination for proteins
and nucleic acids.

UNIT IV:
Ontology: Annotation of genes, their products and functions. System biology, evolution,
hierarchy, Medical informatics

UNIT V:
Software support: Software availability, Software targets, Text parsing, BioPerl. Statistics,
R-system

UNIT VI:
Recent Advances & Applications of Bio-Informatics: Recent trends in Computing with
bio-systems.

Text Books:

1. “Bioinformatics, Sequence and Genome Analysis”, David W. Mount; Cold Spring

Harbor Laboratory Press
2. “Bioinformatics: A Practical Guide to the Analysis of Genes and Proteins”, Andreas
D. Baxevanis, Second Edition.
3. “Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids”,
Richard Durbin, Sean R. Eddy, Anders Krogh, Graeme Mitchison, Cambridge
University Press.
Text Books:

1. “Fundamental Concepts of Bioinformatics”, D.E. Krane and M.L. Raymer, Person

Education.
2. “Bioinformatics Computing”, B. Bergeron, Prentice –Hall.

WIRELESS & MOBILE COMMUNICATION

Lectures :- 3 Hrs per week Theory :- 150 Marks

Unit 1 Introduction: Network Technologies and Cellular Communications, Discussion on

Bluetooth &GSM. Introduction to Mobile Computing: novel applications, limitations, and
architecture.

Unit 2 (Wireless) Medium Access Control: Motivation for a specialized MAC (Hidden and
exposed terminals, Near and far terminals), SDMA, FDMA, TDMA, CDMA.

Unit 3 Mobile Architecture: Mobile Network Layer: Mobile IP (Goals, assumptions, entities
and terminology, IP packet delivery, agent advertisement and discovery, registration,
tunneling and encapsulation, optimizations), Dynamic Host Configuration Protocol (DHCP).

Unit 4 Mobile Transport Layer: Traditional TCP, Indirect TCP, Snooping TCP, Mobile TCP,
Fast retransmit/fast recovery, Transmission /time out freezing, Selective retransmission,
Transaction oriented TCP.

Unit 5 Mobile Ad hoc Networks (MANETs): Overview, Properties of a MANET, spectrum

of MANET applications, routing and various routing algorithms, security in MANETs.

Unit 6 Protocols and Tools: Wireless Application Protocol WAP. (Introduction, protocol
architecture, and treatment of protocols of all layers), Bluetooth (User scenarios, physical
layer, MAC layer, networking, security, link management) and J2ME, Latest Technologies.

Suggested Readings:-
Text Books:
1. Mobile and Personal communication System and Services- Raj Pandya
2. Wireless Communication and Networks- William Stallings.

3. Wireless and Personal Communications Systems, Vijay Garg, Joseph Wilkes,

Prentice-Hall, Englewood Cliffs, NJ, 1996.
Reference Books:

1. Fundamentals of Wireless Communication, David Tse and Pramod Viswanath,

Cambridge University Press, 2005

FAULT TOLERANT AND TESTABLE SYSTEMS

UNIT I:
Fundamental Concepts: Definitions of fault tolerance, fault classification, fault tolerant
attributes and system structure.

UNIT II:
Fault-Tolerant Design Techniques: Information redundancy, hardware redundancy, and
time redundancy.
Dependability Evaluation Techniques: Reliability and availability models: (Combinatorial
techniques, Fault-Tree models, Markov models), Performance Models.

UNIT III:
Architecture of Fault-Tolerant Computers (case study): General-purpose systems, high-
availability systems, long-life systems, critical systems.

UNIT IV:
Software Fault Tolerance: Software faults and their manifestation, design techniques,
reliability models.

UNIT V:
Fault Tolerant Parallel/Distributed Architectures: Shared bus and shared memory
architectures, fault tolerant networks.

UNIT VI:
Recent topics in fault tolerant systems: Security, fault tolerance in wireless/mobile
networks.

Text Books:
1. Fault-Tolerant Computer System Design, D.K. Pradhan.
2. Design and Analysis of Fault-Tolerant Digital Systems, B.W.Johnson, Addison-
Wesley
3. Fault-Tolerant Computing, Theory and Techniques, Volumes I and II, D.K. Pradhan,
Prentice Hall.

Text Books:
1. Reliable Computer Systems: Design and Evaluation, D.P.Siewiorek and R.S.Swartz,
Digital Press.
2. Probability and Statistics with Reliability, Queueing and Computer Science
Application K.S.Trivedi, Prentice Hall.
 ADVANCED COMPUTER GRAPHICS

UNIT I:
Line Drawing and transformation: Basic raster graphical algorithm for 2D primitives, Line
drawing algorithm, 2D and 3D transformation

UNIT II:
Clipping: Window, View port, clipping algorithm.
Curves and Surfaces: Circle drawing algorithm, Ellipse drawing algorithm, Bezier curve, b-
spline curve, surfaces, Solid modelling.

UNIT III:
Projection: Parallel projection, Perspective projection, Computation of vanishing point

UNIT IV:
Visible surface determination: Z-buffer algorithm, Scan line algorithm, Area subdivision
algorithm, Raytracing algorithm

UNIT V:
Shading: Illumination mode, Specular reflection model, Shading models for curve surfaces,
Radiosity method, Rendering, Recursive ray tracing, Texture mapping Advanced Modelling
Techniques Procedural Models,Fractal Models,Grammar based models,particle systems.

UNIT VI:
Animation: 3D animation, morphing, simulation of key frames

Text Books:
1. Foley - Computer Graphics Principles & Practice, 2nd ed. Pearson Education.
2. Hearn & Baker - Computer Graphics C version, 2nd ed. Pearson Education.
3. Roger and Adams - Mathematical Element for Computer Graphics, 2nd ed., Tata
McGraw Hill.

Text Books:

1. David F. Rogers, “Procedural Element for computer graphics”, McGraw Hill Book
Company.
 RELIABLE SYSTEM DESIGN

UNIT I
Fundamental Concepts
Definitions of fault tolerance, fault classification, fault tolerant attributes and system structure.

UNIT II
Fault-Tolerant Design Techniques
Information redundancy, hardware redundancy, and time redundancy.

UNIT III
Dependability Evaluation Techniques
Reliability and availability models: (Combinatorial techniques, Fault-Tree models, Markov
models), Performance Models.

UNIT IV
Architecture of Fault-Tolerant Computers (case study)
General-purpose systems, high-availability systems, long-life systems, critical systems.

UNIT V
Software Fault Tolerance
Software faults and their manifestation, design techniques, reliability models.

UNIT VI
Fault Tolerant Parallel/Distributed Architectures
Shared bus and shared memory architectures, fault tolerant networks. Recent topics in fault
tolerant systems: Security, fault tolerance in wireless/mobile networks.

Suggested Readings:
Text Books:
1. Fault-Tolerant Computer System Design D.K. Pradhan, 2003.

2. Design and Analysis of Fault-Tolerant Digital Systems, B.W.Johnson, Addison-

Wesley

3. Fault-Tolerant Computing, Theory and Techniques, Volumes I and II, D.K. Pradhan,
Prentice Hall.

Reference Books:
 1. Reliable Computer Systems: Design and Evaluation, D.P.Siewiorek and R.S.Swartz,
Digital Press, 1992
2. Probability and Statistics with Reliability, Queueing and Computer Science
Application K.S.Trivedi, Prentice Hall, 1982

First Year M.Tech.(CSE) II Semester

Group “D” Subjects

CO-651 ELECTIVE III

OPTIMIZATION TECHNIQUES
UNIT I:
Introduction to Linear Programming: Prototype Example, the Linear Programming Model,
Assumptions of Linear Programming, Additional Examples, Some Classic Case Studies.
Graphical method, The Simplex Method: The Essence of the Simplex Method, Setting up the
Simplex Method, The Algebra of the Simplex Method, The Simplex Method in Tabular Form,
Tie Breaking in the Simplex Method, Adapting to Other Model Forms, Post optimality
Analysis.

UNIT II:
Duality Theory And Sensitivity Analysis: The Essence of Duality Theory, Economic
Interpretation of Duality, Primal-Dual relationships, Adapting to Other Primal Forms, The
Role of Duality Theory in Sensitivity Analysis. Other Algorithms for Linear Programming:
The Dual Simplex Method, Parametric Linear Programming, the Upper Bound Techniques,
An Interior-Point Algorithm.

UNIT III:
Dynamic Programming: A prototype example for Dynamic Programming, Characteristics
of Dynamic Programming Problems, Deterministic Dynamic Programming, Probabilistic
Dynamic Programming.

UNIT IV:
Integer Programming: Prototype Example, Some BIP Applications, Innovative Uses of
Binary Variables in Model Formulation, Some Formulation examples, Some Perspectives on
Solving Integer Programming Problems, The Branch-and-Bound Technique and Its
application to Binary Integer Programming, A Branch-and-Bound Algorithm for Mixed
Integer.

UNIT V
Nonlinear Programming: Sample Applications, Graphical Illustration of Nonlinear
Programming Problems, Types of Nonlinear Programming Problems, One-Variable
Unconstrained Optimization, Multivariable Unconstrained Optimization, The Karush-Kuhn-
Tucker (KKT) Conditions for Constrained Optimization, Quadratic Programming, Separable
Programming , Convex Programming.

UNIT VI:
Queuing Theory: Prototype Example, Basic Structure of queuing Models, Examples of Real
Queuing Systems, The role of the Exponential Distribution, The Birth-and-Death Process,
Queuing Models Based on the Birth-and Death Process, Queuing Models involving non
exponential distributions.

Text Books:
1. H.A.Taha – Operations Research, 8/e , Pearson Education.
2. J.K. Sharma – Operations Research, 3/e, Mcmillan , India Ltd, 2007.
3. S. Hiller & G.J. Lieberman – Operations Research, 8th Edn, TMH, New Delhi.

Text Books:
1. Kanti Swarup, Gupta Pk, Man Mohan, Operations Research, Sultan Chand & Sons

DISTRIBUTED ALGORITHMS

UNIT I:
Introduction: Types of concurrency, Characteristics of Distributed systems, Challenges
posed by distribution, Importance of theoretical methods for distributed algorithms (2
generals problem),

UNIT II:
Basic of discrete mathematics: posets and lattices. Distributive property. Approaches to
reasoning - Model driven, different types of models. Dimensions to classifying distributed
algorithms - IPC method, timing, Failure models and Problems addressed. Synchronous vs

UNIT III:
Asynchronous distributed systems Synchronous Algorithms - Ring only, Synchronous
Models, proof methods, failure types etc, Leader election in synchronous ring – LCR
algorithm, Hirshberg-Sinclair algorithm, Non-comparison algorithms - Time slice and
Variable speeds, Lower bound discussion.

UNIT IV:
Synchronous Algorithms: General Networks, Leader election in a general network -
flooding algorithm, Reducing the complexity of complete flooding, MST algorithm Dealing
with Link and process failures in consensus problems Asynchronous Shared Memory, Mutual
Exclusion, Resource Allocation Asynchronous Network Algorithms, FIFO, Broadcast vs
Multicast, Leader Election - Ring vs arbitrary network MST, Minimum Spanning Tree
Algorithms Logical time, Vector clocks, Matrix clocks, DD clocks Global Global Snapshots,
Chandy and Lamports algorithm Stable predicates or properties, Termination detection Self
stabilization.

Text Books:

1. Nancy A. Lynch, “Distributed Algorithms”, Morgan Kaufmann.

2. Nicola Santoro, “Design and Analysis of Distributed Algorithms”, Wiley-Interscience
3. Gerard Tel, “Introduction to Distributed Algorithms 2nd ed”, Cambridge University
Press.

Text Books:
1. C. Xavier and S. S. Iyengar, “Introduction to Parallel Algorithms”, Wiley-
Interscience.

MODELING & SIMULATION

UNIT I:
Basic Simulation Modeling: The Nature of Simulation Systems, Models, and Types of
Simulation, Advantages, Disadvantages, and Pitfalls of Simulation.

UNIT II:
Modeling Complex Systems: Introduction, List Processing in Simulation, Approaches to
Storing Lists in a Computer.

UNIT III:
Simulation Software: Comparison of Simulation Packages with Programming Languages
Classification of Simulation Software General-Purpose Simulation Packages
Object-Oriented Simulation.

UNIT IV:
Building Valid, Credible, and Appropriately Detailed Simulation Models: Experimental
Design, Sensitivity Analysis, and Optimization Simulation of Manufacturing Systems.

Text Books:

1. “System Modeling and Simulation - an Introduction”, Frank L. Severance; John

Wiley.
2. “Simulation Modeling and Analysis”, Law Kelton, Third Edition, Mc-Graw Hill.

QUANTUM COMPUTING
UNIT I:
Introduction to Quantum Computers: Qubits & their representation.

UNIT II:
Quantum Elements: Logic Gates, Circuits, Architectures, Algorithms.

UNIT III:
Quantum Information: Quantum Key Distribution, teleportation, Single photons, EPR
pairs.

UNIT IV:
Grid Computing: Data and Computational Grids, Grid Architectures and its relations to
various distributed technologies, Autonomic computing, Cluster Setup & its advantages,
performance models & simulations; Networking protocols & I/O, Messaging Systems,
Examples

UNIT V:
Process Scheduling, Load Sharing & Balancing, Distributed Shared memory, parallel I/O
Pervasive Computing concepts & scenarios; Hardware & software; Device Connectivity.

Text Books:

1. Introduction to Quantum Computing, Philip Kaye etal., Oxford University Press.

2. Introduction to Quantum Computers, Gennady Berman, World Scientific.
3. Quantum Computation and Quantum Information, M. Nielsen and I. Chuang,
Cambridge University Press, Cambridge.

Text Books:
1. Classical and Quantum Computation,A. Yu. Kitaev, A.H. Shen, and M.N. Vyalyi,
American Mathematical Society, Providence.
2. Problems & Solutions in Quantum Computing & Information, W.H. Steeb and Y.
HardyWorld Scientific, River Edge, NJ.

ENTERPRISE COMPUTING IN JAVA

UNIT I:
J2EE: Introduction to J2EE, Building J2EE Applications, JDBC, Servlets and Web
Applications, Java Server Pages and Model/View/Controller, J2EE Web Services Overview,
Introduction to EJB, Session EJBs, Entity EJBs, JMS and message driven Beans,
Transactions and Security, Application Servers (Case Study of any one of IBM Websphere,
BEA Weblogic, JBoss)

UNIT II:
Hibernate: Principles of Object Relational Mapping, Hibernate configuration, HQL making
objects persistent, Hibernate semantics, Session management, flushing, concurrency and
Hibernate, Optimistic and Pessimistic Locking, Object mapping Mapping simple properties,
Single and multi valued associations, Bi-directional associations, Indexed collections, Using
Hibernate Template, Querying, Session management, Transaction integration and
demarcation.

UNIT III:
Spring: Introduction of Spring Framework: Spring Architecture, Spring Framework
definition, Spring & MVC, Factory Pattern, BeanFactory, Spring Context definition,
Inversion of Control (IoC), Spring AOP, Application Context and BeanFactory, Spring ORM,
Mapping API for JDO, Hibernate, Hibernate Mapping, JDO Mapping, iBATIS, Spring
Abstract Transaction layer, Employing Spring transaction, Using EJB declarative
transactions, Integration process, integrating Spring MVC in web application, MVC in web
application, MVC Framework.

UNIT IV:
Web Services: Introduction to XML, Service-Oriented Architectures SOAP, SOAP message
structure, handling errors WSDL, UDDI, Java Web Service implementations JAX-RPC, Web
service clients in Java, Introduction to Ajax.

Text Books:

1. Jim Farley, William Crawford, O’Reilly and Associates, “Java Enterprise in a

Nutshell”.
2. Brett McLaughlin, O’Reilly, “Java and XML, 2nd Edition.
3. Elliott Rusty Harold and W. Scott Means, O’Reilly, “XML in a Nutshell”.

Text Books:
1. James Cooper, “Java Design Pattern: A Tutorial”, Addison Wesley.
2. Govind Sesadri, “Enterprise java Computing: Application and Architectures”,
Cambridge University Publications.

First Year M.Tech.(CSE) II Semester

Group “D” Subjects

CO-652 ELECTIVE IV

OPTICAL NETWORKS

UNIT-I
Optical fiber fundamentals: Solution to Maxwell’s equation in a circularly symmetric step
index optical fiber, linearly polarized modes, single mode and multimode fibers, concept of V
number, graded index fiber.
UNIT- II
Total number of guided modes (no derivation), polarization maintaining fibers, attenuation
mechanisms in fibers, dispersion in single mode and multimode fibers, dispersion shifted and
dispersion flattened fibers, attenuation and dispersion limits in fibers, Kerr nonlinearity, self
phase modulation, combined effect of dispersion and self phase modulation, nonlinear
Schrodinger equation (no derivation), fundamental soliton solution.

UNIT-III
Optical sources: LED and laser diode, principles of operation, concepts of line width, phase
noise, switching and modulation characteristics – typical LED and LD structures.

UNIT-IV
Optical detectors: P-N detector, pin detector, avalanche photodiode – Principles of
operation, concepts of responsivity, sensitivity and quantum efficiency, noise in detection,
typical receiver configurations (high impedance and transimpedance receivers).

UNIT-V
Optical amplifiers: Semiconductor amplifier, rare earth doped fiber amplifier (with special
reference to erbium doped fibers), Raman amplifier, Brillouin amplifier – principles of
operation, amplifier noise, signal to noise ratio, gain, gain bandwidth, gain and noise
dependencies, intermodulation effects, saturation induced crosstalk, wavelength range of
operation.

Text Books:
1. Leonid Kazovsky, Sergio Benedetto and Alan Willner: `Optical Fiber Communication
Systems’, Artech House.
2. John Senior: `Optical Fiber Communications’, PHI.
3. Silvello Betti, Giancarlo De Marchis and Eugenio Iannone: `Coherent Optical
Communications Systems’, John Wiley.

Text Books:
1. G.P.Agrawal: `Nonlinear Fiber Optics’, Academic Press.

CLUSTER & GRID COMPUTING

Unit 1 Cluster Computing: Introduction to concepts in Cluster based distributed computing

Hardware technologies for cluster computing and software for cluster computing, and
different Software Architecture for Cluster Computing

Unit 2 Programming: Programming Models and Paradigms, features and performance of

standard MPI variants, Derived data types, communicators.

Unit 3 Resource management and scheduling: Managing, cluster resources: single system
images, system level middleware, distributed task scheduling, monitoring and administering
system resources Parallel I/O and Parallel Virtual File System. Scheduling: Condor, Maui
Scheduler, Portable Batch System (PBS)
Unit 4 Grid Computing: Grids and Grid Technologies, Programming models and
Parallelization Techniques, Grid Security Infrastructure, Setting up Grid, deployment of Grid
software and tools, and application execution.

Unit 5 Standard application development tools and paradigms: Performance evaluation

tools, HINT, netperf, netpipe, ttcp, Iperf.message

Unit 6 Data Management: Application Case Study: Molecular Modeling for Drug Design
and Brain Activity Analysis, Resource management and scheduling.

Suggested Readings:-

Text Books:

1. William Gropp, Ewing Lusk, Thomas Sterling, Beowulf Cluster Computing

with Linux, 2nd edition, MIT Press.
2. Bart Jacob, Michael Brown, Introduction to grid computing

3. Gregory F. Pfister, In Search of Clusters: The ongoing battle in lowly parallel

computing, Second Edition, Prentice Hall Publishing Company, 1998.

SOFTWARE TESTING
UNIT 1
Introductory concepts: Verification &Validation Terminologies like Goals, Role,
Objectives, Limitations, Approaches & Applicability.

UNIT II
Software Testing: Testing Process, Limitations of Testing, Testing activities.

UNIT III
Levels of Testing: Unit Testing, Integration Testing, System Testing, Debugging, Domain
Testing, Regression Testing, Stress Testing, Slice based testing.

UNIT IV
Software Testing Techniques: Functional Testing techniques: Boundary Value Analysis,
Equivalence Class Testing, Decision Table Based Testing, Cause Effect Graphing Technique.
Structural Testing: Path testing, DD-Paths, Cyclomatic Complexity, Graph Metrics, Data
Flow Testing, Mutation testing. Object Oriented Testing: Class Testing, GUI Testing.

UNIT V
Software Testing Tools Taxonomy: Methodology to evaluate automated testing. Using
tools: Load Runner, Win runner and Rational Testing Tools, Java Testing Tools, JMetra,
JUNIT Cactus and other recent tools.
UNIT VI
Advanced Topics on Testing: Prioritizing the Test-cases, Testing Web Applications, Testing
Off-the-shelf component, testing security, testing Data-warehouse.

Text Books:
1. Paul C. Jorgenson, Software Testing A Craftsman’s approach, CRC Press, 1997.

2. Desikan, Ramesh, Software Testing: principles and Practices, Pearson Education.

3. William E. Perry,Effective Methods for Software Testing, John Wiley.

Reference Books:
1. Steven R. Rakitin, Software Verification and Validation for Practitioners and
Managers, 2nd edition, Artech House.

2. Boris Beizer, “Software Testing Techniques”, Second Volume, Second Edition, Van
Nostrand Reinhold, New York, 1990.

3. Louise Tamres, “Software Testing”, Pearson Education Asia, 2002.

4. Boris Beizer, “Software System Testing and Quality Assurance”, Van Nostrand
einhold, New York, 1984.

COMPUTER VISION

Unit 1 Introduction: Computational characteristics of human visual information processing,

General introduction to the mathematical frameworks for computer vision, Problems and
goals of computer vision.

Unit 2 Mathematical formulations of computer vision problems: Typical structures in

images, Models and representations for typical structures, Vision as a computational process

Unit 3 Marr’s computational vision paradigm: Vision as a feedforward inference process,

Regularization theory for computer vision, Feature extraction principles for computer vision,
Minimum description length criterion, Maximum entropy criterion, Redundancy reduction
criterion, Descriptive models in computer vision.

Unit 4 Classification algorithms: Bayesian decision theory, etc. Computer vision as

Bayesian Inference: Representations in a vision system. Seeing as an inference process,
Bayesian inference framework for vision.
Unit 5 Visual learning: Computational approaches to visual learning, Visual learning as
dimension and redundancy reduction., A unified framework for computer vision:
Relationships among different approaches, including equivalence conditions, limitations,
advantages and disadvantages of existing approaches, Issues in designing a generic vision
system, Vision as inference with hierarchical models.

Unit 6 Implementation issues in computer vision: Computational complexity of vision

algorithms, Optimization techniques for computer vision systems, Monte-Carlo Markov
chain techniques for high dimensional problems, Hardware implementation issues. Current
and future research directions in computer vision: Open issues in computer vision,
Challenges of developing generic computer vision systems.

Suggested Readings:-
Text Books:
1. Computer Vision by Linda Shapiro and George Stockman, Prentice-Hall 2001.
2. Computer Vision, D Ballard and C Brown, Prentice-Hall 1982.
3. 2D Object Detection and Recognition: Models, Algorithms, and Networks, Yali Amit,
MIT Press, 2002.

NANO TECHNOLOGY
Unit 1

Introduction to nanoscale systems. Length, energy, and time scales. Top-down approach to
nanolithography. Spatial resolution of optical, deep-ultraviolet, x-ray, electron beam, and ion
beam lithography.

Unit 2

Single electron transistors, coulomb blockade effects in ultra-small metallic tunnel

junctions.

Unit 3

Quantum confinement of electrons in semiconductor nanostructures: two-dimensional

confinement (quantum wells). Band gap engineering. Epitaxy.

Unit 4

Landauer-Buttiker formalism for conduction in confined geometries. One-dimensional

confinement: quantum point contacts, quantum dots. Bottom-up approach. Chemical self-
assembly, carbon nanotubes.

Unit 5
Molecular electronics. Self-assembled monolayers. Electrochemical techniques; applications
in biological and chemical detection. Atomic scale characterization techniques: scanning
tunneling microscopy, atomic force microscopy.

Unit 6

Introduction to quantum methods of information processing.

Text Books

1. Additional handouts will be provided from the following books:

David Ferry, Transport in Nanostructures, Cambridge University Press, 2000.
2. Y. Imry, Introduction to Mesoscopic Physics, Oxford University Press, 1997.

Reference Books

1.S. Datta, Electron Transport in Mesoscopic Systems, Cambridge University Press, 1995.

3. H. Grabert and M. Devoret, Single Charge Tunneling, Plenum Press, 1992.

4. Beenaker and Van Houten, Quantum Transport in Semiconductor Nanostructures,
in Solid State Physics v. 44, eds. Ehernreich and Turnbull, Academic Press, 1991.
P. Rai-Choudhury, Handbook of Microlithography, Micromachining & Microfabrication,
SPIE, 1997.

First Year M.Tech.(CSE) III Semester

Group “E” Subjects

CO-701 ELECTIVE V

DATA WAREHOUSING AND DATA MINING

UNIT I:
Data Warehousing: - Basic concepts in data warehousing, Collecting the requirements of
data warehouse, Data Warehouse Architecture, Design, Implementation& Maintenance,
OLAP in data warehouse, Data warehousing and the web, Further Development of Data Cube
Technology, From Data Warehousing to Data Mining.
Data Mining Concepts: Data mining primitives, Basics of data mining, Query language,
Designing GUI based on a data mining query language, Architectures of data mining
systems

UNIT II:
Mining Association Rules in Large Databases: Association Rule Mining, Mining Single
Dimensional Boolean Association Rules from Transactional Databases, Mining Multilevel
Association Rules from Transaction Databases, Mining Multidimensional Association Rules
from Relational Databases and Data Warehouses, From Association Mining to Correlation
Analysis, Constraint Based Association Mining.

UNIT III:
Classifications and Prediction: Issues Regarding Classification and Prediction,
Classification by Decision Tree Induction, Bayesian Classification, Classification by
Backpropagation, Classification Based on Concepts from Association Rule Mining, Other
Classification Methods, Prediction, and Classifier Accuracy.

UNIT IV:
Cluster Analysis in Data Mining: Types of Data in Cluster Analysis. A Categorization of
Major Clustering Methods, Partitioning Methods, Density Based Methods, Grid Based
Methods; Model Based Clustering Methods, Outlier Analysis.

UNIT V:
Mining Complex Types of Data: Multidimensional Analysis and Descriptive Mining of
Complex Data Objects, Mining Spatial Databases, Mining Multimedia Databases, Mining
Time Series and Sequence Data, Mining Text Databases.

UNIT VI:
Applications and trends in Data Mining: - Applications, Systems products and research
prototypes, Additional themes in data mining, Trends in Data mining, spatial mining, and
Web Mining: Web concept mining, Web structure mining, Web Usage mining.

Text Books:
1. Data Warehousing Fundamentals, P.Ponnian, John Weliey.
2. Data Mining Introductory & Advanced Topics, M.H.Dunham, Pearson Education.
3. Data Mining Concepts & Techniques, Han,Kamber, M.Kaufman.
PATTERN RECOGNITION
UNIT I:
Pattern recognition fundamentals: Basic concepts of pattern recognition, fundamental
problems in pattern recognition system, design concepts and methodologies, example of
automatic pattern recognition systems, a simple automatic pattern recognition model.

UNIT II:
Bayesian decision theory: Minimum-error-rate classification, Classifiers, Discriminant
functions, Decision surfaces, Normal density and discriminant functions, Discrete features,
Missing and noisy features, Bayesian networks (Graphical models) and inferencing.

UNIT III:
Maximum-likelihood and Bayesian parameter estimation: Maximum-Likelihood
estimation: Gaussian case, Maximum a Posteriori estimation, Bayesian estimation: Gaussian
case, Problems of dimensionality, Dimensionality reduction: Fisher discriminant analysis,
PCA Expectation-Maximization method: Missing features

UNIT IV:
Sequential Models: State Space, Hidden Markov models, Dynamic Bayesian.
Non-parametric techniques for density estimation: Parzen-window method, K-Nearest
Neighbour method

UNIT V:
Linear discriminant functions: Gradient descent procedures, Perceptron criterion function,
Minimum-squared-error procedures, Ho-Kashyap procedures, Support vector machines

UNIT VI:
Unsupervised learning and clustering: Unsupervised maximum-likelihood estimates,
Unsupervised Bayesian learning, Criterion functions for clustering, Algorithms for clustering:
K-means, Hierarchical and other methods, Cluster validation, Low-dimensional
representation and multidimensional scaling (MDS).

Text Books:
1. R.O.Duda, P.E.Hart and D.G.Stork, “Pattern Classification”, John Wiley.
2. Julus T. Tou and Rafel C. Gonzalez, Addision, “Pattern Recognition
principles”,Wesley.
3. Christopher M. Bishop, “Pattern recognition and machine learning”, Springer.

Reference Books:
4. Luc Devroye, László Györfi, Gábor Lugosi, “A probabilistic theory of pattern
recognition”, Springer.

NATURAL LANGUAGE PROCESSING

UNIT I:
Introduction: NLP tasks in syntax, semantics, and pragmatics. Applications such as
information extraction, question answering, and machine translation. The problem of
ambiguity. The role of machine learning. Brief history of the field.

UNIT II:
N-gram Language Models: The role of language models. Simple N-gram models.
Estimating parameters and smoothing. Evaluating language models.

UNIT III:
Part of Speech Tagging and Sequence Labeling: Lexical syntax. Hidden Markov Models.
Maximum Entropy Models. Conditional Random Fields.

UNIT IV:
Syntactic parsing: Grammar formalisms and treebanks. Efficient parsing for context-free
grammars (CFGs). Statistical parsing and probabilistic CFGs (PCFGs). Lexicalized PCFGs.
Semantic Analysis: Lexical semantics and word-sense disambiguation. Compositional
semantics. Semantic Role Labeling and Semantic Parsing.

UNIT V:
Information Extraction (IE): Named entity recognition and relation extraction. IE using
sequence labeling.

UNIT VI
Machine Translation (MT): Basic issues in MT. Statistical translation, word alignment,
phrase-based translation, and synchronous grammars. Case studies in Databases & Operating
Systems.

Text Books:

1. “Computational Linguistics, and Speech Recognition”, Daniel Jurafsky and James H.

Martin, PHI.
2. C. Manning and H. Schutze, “Foundations of Statistical Natural Language
Processing”
3. Akshar Bharti, Vineet Chaitanya and Rajeev Sangal, “NLP: A Paninian Perspective”,
Prentice Hall.

Reference Books:
1. James Allen, “Natural Language Understanding”, Pearson Education.

SOFT COMPUTING

UNIT I:
Neural Networks: History, overview of biological Neuro-system, Mathematical Models of
Neurons, ANN architecture, Learning rules, Learning Paradigms-Supervised, Unsupervised
and reinforcement Learning, ANN training Algorithms-perceptions, Training rules, Delta,
Back Propagation Algorithm, Multilayer Perceptron Model, Hopfield Networks, Associative
Memories, Applications of Artificial Neural Networks.

UNIT II:
Fuzzy Logic: Introduction to Fuzzy Logic, Classical and Fuzzy Sets: Overview of Classical
Sets, Membership Function, Fuzzy rule generation.

UNIT III:
Operations on Fuzzy Sets: Compliment, Intersections, Unions, Combinations of Operations,
Aggregation Operations.
UNIT IV:
Fuzzy Arithmetic: Fuzzy Numbers, Linguistic Variables, Arithmetic Operations on Intervals
& Numbers, Lattice of Fuzzy Numbers, Fuzzy Equations.

UNIT V:
Uncertainty based Information: Information & Uncertainty, Nonspecificity of Fuzzy &
Crisp Sets, Fuzziness of Fuzzy Sets.

UNIT VI
Introduction of Neuro-Fuzzy Systems: Architecture of Neuro Fuzzy Networks.

Text Books:
1. “An Introduction to Neural Networks”, Anderson J.A., PHI.
2. “Introduction to the Theory of Neural Computation”, Hertz J. Krogh, R.G. Palmer,
Addison-Wesley, California.
3. “Fuzzy Sets & Fuzzy Logic”, G.J. Klir & B. Yuan, PHI.

Reference Books:
1. “An Introduction to Genetic Algorithm”, Melanie Mitchell, PHI.

SEMANTIC WEB
UNIT I:
Introduction: The Semantic Web Roadmap, evolution of Web Documents, Semantic Search
Techniques.

UNIT II:
XML Languages: Detailed study of XML language & application to Web based
developments.

UNIT III:
Describing Web Resources: Resource Description Framework ( RDF), Taxonomies,
Ontologies, Web Ontology Language (OWL), Design process of ontology, Annotation

UNIT IV:
Advanced Topics: Semantic Applications & Power, Latest on Semantic Web, Future
Directions, W3C Consortium, Case studies in different application

Text Books:

1. “A Semantic Web Primer”, Grigoris Antoniou and Frank van Harmelen, MIT Press.
 2. “Spinning the Semantic Web - Bringing the World Wide Web to Its Full Potential”,
MIT Press, Dieter Fensel, James A. Hendler, Henry Lieberman, and Wolfgang
Wahlster (Eds.)
3. “The Semantic Web: A guide to the future of XML, Web Services and Knowledge
Management”, Michael C. Daconta, Leo J. Obrst Kevin T. Smith, Wiley Publishing.

Reference Books:
1. “Principles of Semantic Networks: Explorations in the representation of knowledge”,
John Sowa. Morgan Kaufmann.
2. Russell and Norvig, “Artificial Intelligence: A Modern Approach”, Prentice Hall.
3. Han Reichgelt, “Knowledge Representation: An AI Perspective”, Ablex Publishing.

DIGITAL IMAGE PROCESSING

UNIT I:
Introduction And Digital Image Fundamentals: Digital Image Representation,
Fundamental Steps in Image Processing, Elements of Digital image processing systems,
Sampling and quantization, some basic relationships like neighbours, connectivity, Distance
measure between pixels, Imaging Geometry.

UNIT II:
Image Transforms: Discrete Fourier Transform, Some properties of the two-dimensional
fourier transform, Fast fourier transform, Inverse FFT.
Image Enhancement: Spatial domain methods, Frequency domain methods, Enhancement
by point processing, Spatial filtering, Lowpass filtering, Highpass filtering, Homomorphic
filtering, Colour Image Processing.

UNIT IV:
Image Restoration: Degradation model, Diagnolization of Circulant and Block-Circulant
Matrices, Algebraic Approach to Restoration, Inverse filtering, Wiener filter, Constrained
Least Square Restoration, Interactive Restoration, Restoration in Spatial Domain.
Image Segmentation: Detection of Discontinuities, Edge linking and boundary detection,
Thresholding, Region Oriented Segmentation, Motion based segmentation.

UNIT V:
Image Compression: Coding, Interpixel and Psychovisual Redundancy, Image Compression
models, Error free comparison, Lossy compression, Image compression standards.

UNIT VI:
Representation and Description: Representation schemes like chain coding, Polygonal
Approximatiion, Signatures, Boundary Segments, Skeleton of region, Boundary description,
Regional descriptors, Morphology.
Recognition and Interpretation: Elements of Image Analysis, Pattern and Pattern Classes,
Decision-Theoretic Methods, Structural Methods, Interpretation.
Text Books:
1. “Digital Image Processing”, Rafael C. Gonzalez & Richard E. Woods, AWL.
2. “Fundamental of Digital Image Processing”, A.K. Jain, PHI.
3. “Computer Imaging: Digital Image Analysis and Processing”, SE Umbaugh, CRC
Press, 2005.

Text Books:
1. “Digital Image Processing Algorithms”, Pitas, I., Prentice Hall, 1993.

First Year M.Tech.(CSE) III Semester

Group “E” Subjects

CO-702 ELECTIVE VI

GEO-INFORMATICS
UNIT I:
Fundamentals: Principles of data capture, and use of aerial photographs and satellite
imagery; Handling, integration, maintenance and geometric aspects of geodata; Methods of
representing geodata, including the principles of internet application Digital Photogrammetry
and Remote Sensing: advances in airborne and spaceborne sensor systems; global
positioning; digital photogrammetry; integrated up-to-datecapturing techniques.

UNIT II:
Digital photogrammetric workstations: primary data acquisition and sensors, and the
perception of colour and depth; linear algebra and the theory of observations;
photogrammetric systems and scanners; image processing platforms; orientation of images,
and digital image enhancement; aerotriangulation and the use of GPS for control point
positioning and field completion.

UNIT III:
GIS Operation: principles of computer programming; database concepts and development
and DBMS Software tools; Creating and implementing databases; Managing and
administering databases and the use of query languages; GIS Theory, Spatial analysis
(network, raster and surface operations); Developing a GIS Application

UNIT IV:
Cartography and Geo-Visualization: The cartographic communication process, including
commercial and management aspects; map type, symbol and typographical design and use of
color; cartographic generalization and map protection; concepts and technical constraints of
the cartographic production line; topographic mapping, and the production of large-scale
maps and photo and image maps; thematic mapping, including socio-economic and physical
environmental mapping, tourist maps, statistics and data classification; the visualization of
multimedia ad web mapping applications.

REFERENCE BOOKS
1. Kali Charan Sahu, “Remote Sensing and Geographical Information Systems”,
Atlantic Publishers and distributors.
2. Joseph L. Awange, Erik W. Grafarend, Ba(c)La Palancz, Béla Paláncz, Piroska
Zaletnyik,” Algebraic Geodesy and Geoinformatics”, Springer.
3. A. Krishna Sinha ,”Geoinformatics: data to knowledge”,Geological Society of
America.

ADVANCES IN INTERNET AND WEB TECHNOLOGY

UNIT I:
Emergence of the Internet: Terminology, Accessibility: Language & Connectivity, Services
of the Internet: E-Mail, World Wide Web (WWW), Remote Access, Collaboration, File
Sharing, Internet Telephony; Use & Culture: Usenet, From gopher to WWW, Search Engines:
Wais, Archie, Web Search Engine.

UNIT II:
Web Development: Developing Web using HTML, XML, ASP. Concepts of Web
Programming: using Scripting Languages such as JavaScript, CGI, PHP etc. Database
Connectivity with MySQL and JDBC.

UNIT III:
Web Research & Practices: The World Wide Web Impact: Opportunities and Challenges,
Evolution of Search Engines, Web Search & Mining Framework: Supporting Technologies,
concepts, applications, types & tools, Quantifying the Web, Crawling Techniques: The task of
a web crawler, Crawler algorithms, Indexing techniques, Ranking in Web.

UNIT IV:
Advanced Research Topics: Duplicate Detection, Contextual Search, etc.

Text Books:
1. Internet and Web Technologies by Raj Kamal, Tata McGraw Hill edition.
2. An Introduction to Search Engines and Web Navigation, Mark Levene, Pearson
Education.
3. Mining the Web: Discovering Knowledge from Hypertext Data, Soumen Chakrabarti,
Morgan-Kaufmann Publishers.
4. Modeling the Internet and the Web,Pierre Baldi,Paolo Frasconi, Padhraic Smyth, John
Wiley and Sons Ltd.
 ADVANCES IN MULTIMEDIA TECHNOLOGY

UNIT I:
Emergence of the Internet: Terminology, Accessibility: Language & Connectivity, Services
of the Internet: E-Mail, World Wide Web (WWW), Remote Access, Collaboration, File
Sharing, Internet Telephony; Use & Culture: Usenet, From gopher to WWW, Search Engines:
Wais, Archie, Web Search Engine.

UNIT II:
Web Development: Developing Web using HTML, XML, ASP. Concepts of Web
Programming: using Scripting Languages such as JavaScript, CGI, PHP etc. Database
Connectivity with MySQL and JDBC.

UNIT III:
Web Research & Practices: The World Wide Web Impact: Opportunities and Challenges,
Evolution of Search Engines, Web Search & Mining Framework: Supporting Technologies,
concepts, applications, types & tools, Quantifying the Web, Crawling Techniques: The task of
a web crawler, Crawler algorithms, Indexing techniques, Ranking in Web.

UNIT IV:
Advanced Research Topics: Duplicate Detection, Contextual Search, etc.

Text Books:
1. Internet and Web Technologies by Raj Kamal, Tata McGraw Hill edition.
2. An Introduction to Search Engines and Web Navigation, Mark Levene, Pearson
Education.
3. Mining the Web: Discovering Knowledge from Hypertext Data, Soumen Chakrabarti,
Morgan-Kaufmann Publishers.
4. Modeling the Internet and the Web,Pierre Baldi,Paolo Frasconi, Padhraic Smyth, John
Wiley and Sons Ltd.

VLSI DESIGN
Unit I

Introduction to CMOS circuits: MOS Transistors, MOS transistor switches, CMOS Logic,
The inverter, Combinational Logic, NAND gate, NOT Gate, Compound Gates, Multiplexers,
Memory-Latches and Registers.

Unit II

Processing Technology: Silicon Semiconductor Technology- An Overview, wafer processing,

oxidation, epitaxy deposition, Ion-implantation and diffusion, The Silicon Gate Process-
Basic CMOS Technology, basic n-well CMOS process, p-well CMOS process, Twin tub
process, Silicon on insulator, CMOS process enhancement-Interconnect, circuit elements, 3-
D CMOS. Layout Design Rule: Layer Representations, CMOS n-well Rules, Design Rule of
background scribe line, Layer Assignment, SOI Rule

Unit III

Power Dissipation: Static dissipation, Dynamic dissipation, short-circuit dissipation, total

power dissipation. Programmable Logic, Programmable Logic structure, Programmable
interconnect, and Reprogrammable Gate Array: Xilinx Programmable Gate Array, Design
Methods: Behavioral Synthesis, RTL synthesis

Unit IV

Placement: placement: Mincut based placement – Iterative improvement placement simulated

annealing. Routing: Segmented channel routing – maze routing – routability and routing
resources – net delays.

Unit V

Verification and Testing: Verification Versus Testing, Verification: logic simulation design
validation – timing verification – Testing concepts: failures – mechanisms and faults – fault
coverage – ATPG methods – types of tests – FPGAs – programmability failures – design for
testability.

Unit VI

Overview of VHDL

Suggested Readings:
Text Book:

1. “Digital Integrated Circuit”, J.M. Rabaey, Chandrasan, Nicolic, Pearson

2. “CMOS Digital Integrated Circuit”, S.M. Kang & Y. Leblebici, TMH
3. “Modern VLSI Design”, Wayne Wolf, Pearson

Reference Books:
1. “Algorithm for VLSI Design & Automation”, N. Sherwani, Kluwer
2. “VHDL”, Bhaskar, PHI
3. “Digital Integrated Circuits” Demassa & Ciccone, Willey Pub.
4. “Modern VLSI Design: system on silicon” Wayne Wolf; Addison Wesley Longman
Publisher.
5. “Basic VLSI Design” Douglas A. Pucknell & Kamran Eshranghian; PHI
6. “CMOS Circuit Design, Layout & Simulation”, R.J. Baker, H.W. Lee, D.E. Boyee, PHI.

VLSI DESIGN AND CAD OF VLSI

UNIT I:
Introduction to CAD tools: Evolution of Design Automation-Basic Transistor
Fundamentals-CMOS realizations of basic gates.

UNIT II:
Modeling: Techniques, Types of CAD tools and Introduction to logic simulation

UNIT III:
Verilog: Syntax, Hierarchical modeling and Delay modeling, Verilog constructs, Memory
modeling

UNIT IV:
Logic Synthesis: Introduction synthesis of dirrerent verilog constructs

UNIT V:
Introduction to Reconfigurable computing, FPGAs, the Altra Quartus II flow

Text Books:
1. Verilog HDL, Samir Palnitkar, Second Edition, Pearson Education, 2004.
2. Verilog HDL Synthesis, J.Bhaskar, BS publications, 2001.
 SOFTWARE PROJECT MANAGEMENT

Unit 1 Introduction: Project Management concepts, Process Framework, Project Planning

Software Life Cycle Models, Artifacts of the Project Management Process.

Unit 2 Cost and Scheduling Estimation Models: Various Levels of COCOMO for Cost ,
Effort, Schedule and Productivity Estimation. Approaches to Effort, Cost Estimation, and
Schedule Estimation factors through COCOMO II, Putnam Estimation Model, Algorithmic
models.

Unit 3 Project Management Techniques: Project Organizations and Responsibilities,

Establishing Project Environment, Risk Management Process, Project Tracking and Control
Defect Tracking Concepts such as Process monitoring and audit, Reviews, Inspections and
Walkthroughs.

Unit 4 Project Closure: Project Closure Analysis, Role of Closure Analysis in a project,
Performing Closure Analysis, Closure Analysis Report

Unit 5 Software Project Management Renaissance Conventional Software Management,

Evolution of Software Economics, Improving Software Economics, The old way and the new
way, Discussion on Project Management Tools,

Unit 6 Advance Topics in Software Project Management: Discussion on future Software

Project Management Practices & Modern Project Profiles, Next Generation Software
Economics, Modern Process Transitions.

Suggested Readings:-
Text Books:
1. Watts S. Humphrey, “Managing the Software Process”, Pearson Education
2. Walker Royce, “Software Project Management”, Pearson Education.
3. Pankaj Jalote, “Software Project Management in Practice”, Pearson Education.

Reference Books:
1. Bob Hughes, “Software Project Management”, TMH.
2. Chris Kemerer, “Software Project Management Readings and Cases”.