M.Tech (Computer Science and Engineering) (Four Semesters / Full Time) Curriculum

M.
Tech (COMPUTER SCIENCE AND ENGINEERING)
(With effect from 2010)

(Four Semesters / Full Time)
CURRICULUM
SL Code Course L T P C TC
No
Semester – I
Theory
1 MA611 Mathematical Foundations of Computer 3 1 0 3
Science
2 CS601 Computer Architecture 3 1 0 3
3 CS602 Data Structures and Analysis of Algorithms 3 0 2 4
4 CS603 Operating Systems 3 0 2 4
5 CS604 Software Engineering Methodologies 3 0 0 3
6 CS605 Computer Networks and Management 3 0 2 4
Practical
1 CS606 Java Programming Lab 1 0 3 2
Total 23
Semester – II
Theory
1 CS607 Database Technology 3 0 0 3
2 CS608 Service Oriented Architecture 3 0 0 3
3 CS609 Mobile Computing 3 0 0 3
4 CS610 Grid Computing 3 0 0 3

5 Elective –I 3 0 0 3
6 Elective – II 3 0 0 3
Practical
1 CS611 DBMS Lab 1 0 3 2
2 CS612 Case study: Algorithmic Design and 1 0 3 2
Implementation
Total 22
Semester – III
Theory
1 CS701 High Speed Networks 3 0 0 3

2 CS702 Network Security 3 0 0 3
3 Elective – III 3 0 0 3
4 Elective – IV 3 0 0 3
Practical
1 CS703 Project – Phase I 0 0 12 0*

Total 12
* 6 credits are added with 12 credits of Phase II
Semester – IV
Practical
1 CS703 Project – Phase II 0 0 24 18
Total 18
Total Credits = 75
Total Number of Theory Courses : 16
Total Number of Case Studies :1
Total Number of Practical Courses : 2
LIST OF ELECTIVE COURSES
SL Code Course L T P C
No
1 CSY001 Theory of Computation 3 0 0 3

2 CSY002 Soft Computing 3 0 0 3
3 CSY003 Distributed Operating Systems 3 0 0 3
4 CSY004 Web Technology 3 0 0 3
5 CSY005 XML and Web Services 3 0 0 3
6 CSY006 Bio Informatics 3 0 0 3
7 CSY007 Multimedia Systems 3 0 0 3
8 CSY008 Software Testing 3 0 0 3
9 CSY009 Embedded Systems 3 0 0 3
10 CSY010 Software Quality Assurance 3 0 0 3
11 CSY011 Mobile Adhoc Networks 3 0 0 3
12 CSY012 Data Warehousing and Data mining 3 0 0 3
13 CSY013 Performance Evaluation of 3 0 0 3
Computer systems and Networks
14 CSY014 Agent Based Intelligent Systems 3 0 0 3
15 CSY015 Complex Networks 3 0 0 3
16 CSY016 Component Based Technology 3 0 0 3
17 CSY017 Integrated Software Project Management 3 0 0 3
18 CSY018 Digital Image Processing 3 0 0 3
19 CSY019 Research Methodology for Computer 3 0 0 3
Scientist
20 CSY020 Real Time Systems 3 0 0 3
21 CSY021 Information Security 3 0 0 3
22 CSY022 Network Processors 3 0 0 3
23 CSY023 Multicore Architecture 3 0 0 3
24 ECY081 VLSI Design Techniques 3 0 0 3
25 CSZ001 Speech Recognition 3 0 0 3
26 CSZ002 Language Technology 3 0 0 3
27 CSZ003 Graphics and Multimedia 3 0 0 3
28 CSZ004 Hacking Techniques and Digital 3 0 0 3
Forensics
SEMESTER – I
MA 611 MATHEMATICAL FOUNDATIONS OF

COMPUTER SCIENCE 3 1 0 3
UNIT I FUNDAMENTAL STRUCTURES 9

Set theory:– Relationships between sets – Operations on sets – Set identities –
Principle of inclusion and exclusion – Minsets. Relations:– Binary relations – Partial
orderings – Equivalence relations. Functions:– Properties of functions – Composition of
functions – Inverse functions – Permutation functions.
UNIT II LOGIC 9
Propositional logic – Logical connectives – Truth tables – Normal form (conjunctive

and disjunctive) – Predicate logic – Universal and existential quantifiers – Proof
techniques – Direct and indirect – Proof by contradiction – Mathematical Induction.
UNIT III COMBINATORICS 9
Basics of counting – Counting arguments – Pigeonhole principle – Permutations and

Combinations – Recursion and Recurrence relations – Generating functions.
UNIT IV ALGEBRAIC STRUCTURES 9
Introduction – Properties of an algebraic system – Morphisms –Semigroups and

monoids – Sub semigroups and submonoids – Groups – Order of a group – Order of an
element – Permutation groups – Subgroups – Cyclic groups – Morphism of groups –
Kernal of a homomorphism – Cosets and LAGRANGE’s Theorem – Normal subgroups
– Rings and Fields.
UNIT V MODELING COMPUTATION AND LANGUAGES 9
Finite state machines – Deterministic and Non–deterministic finite state machines –

Turing Machines – Formal Languages – Classes of Grammars – Type_0 – Context
Sensitive – Context Free – Regular Grammars – Ambiguity.
TOTAL = 45
TEXT BOOK
1. Judith L.Gersting, “Mathematical Structures for Computer Science”, 5 th edition,

W.H. Freeman and Company, NY, 2003.
REFERENCES
1. J.P.Tremblay and R.Manohar, “Discrete Mathematical Structures with Applications

to Computer Science”, TMH, 1997.
2. Kenneth H. Rosen, “Discrete Mathematics and its Applications”, 5 th edition, TMH,
2003.
3. R.P.Grimaldi, “Discrete and Combinatorial Mathematics”, Pearson Edition, New
Delhi 2002.
4. M.K. Venkataraman, N. Sridharan and N.Chandrasekaran, “Discrete Mathematics”,
The National Publishing Company, 2003.
CS601 COMPUTER ARCHITECTURE 3 1 0 3
UNIT I FUNDAMENTALS OF COMPUTER DESIGN 9
Measuring and reporting performance – Quantitative principles of computer

design – Classifying instruction set architecture – Memory addressing – Addressing
modes – Type and size of operands – Operations in the instruction set – Operands and
operations for media and signal processing – Instructions for control flow – Encoding an
instruction set – Example architecture – MIPS and TM32.
UNIT II INSTRUCTION LEVEL PARALLELISM 9
Pipelining and hazards – Concepts of ILP – Dynamic scheduling – Dynamic hardware

prediction – Multiple issues – Hardware based speculation – Limitations of ILP – Case
studies: lP6 Micro architecture.
UNIT III INSTRUCTION LEVEL PARALLELISM WITH

SOFTWARE APPROACHES 9
Compiler techniques for exposing ILP – Static branch prediction – Static multiple issue:
VLIW – Advanced compiler support – Hardware support for exposing parallelism –
Hardware Vs software speculation. Mechanism – IA 64 and Itanium processor.
UNIT IV MEMORY AND I/O 9
Cache performance – Reducing cache miss penalty and miss rate – Reducing hit time –
Main memory and performance – Memory technology. Types of storage devices –
Buses – RAID – Reliability, availability and dependability – I/O performance measures –
Designing I/O system.
UNIT V MULTIPROCESSORS AND THREAD LEVEL PARALLELISM 9
Symmetric and distributed shared memory architectures – Performance issues –

Synchronization – Models of memory consistency – Multithreading.
TOTAL= 45
TEXTBOOK
1. John L. Hennessey and David A. Patterson,“ Computer Architecture: A Quantitative

Approach”, 3rd edition, Morgan Kaufmann, 2003.
REFERENCES
1. D.Sima, T. Fountain and P. Kacsuk, “Advanced Computer Architectures: A Design

Space Approach”, Addison Wesley, 2000.
2. Kai Hwang, “Advanced Computer Architecture Parallelism Scalability
Programmability”, Tata McGraw Hill, 2001.
3. Vincent P. Heuring and Harry F. Jordan, “Computer System Design and
Architecture”, Addison Wesley, 2nd edition, 2004
CS602 DATA STRUCTURES AND ANALYSIS OF ALGORITHMS 3 0 2 4
UNIT I GENERAL CONCEPTS AND LINEAR DATA STRUCTURES 12
Algorithm analysis techniques – Abstract data structure – Time and space analysis of
algorithms – Big oh and theta notations – Average, best and worst case analysis –
Simple recurrence relations – Arrays, lists, stacks, queues – Array and linked structure
implementations of lists, stacks, queues – Array of nodes and dynamic pointer
implementations of linked structures.
UNIT II TREES 10
General and binary trees – Representations and traversals – General trees as binary
trees – Binary search trees – Applications – The concept of balancing and its
advantages – AVL trees – 2–3 trees – Red-black trees – Self–adjusting trees – Graphs
and digraphs – Representations – Breadth and depth first searches – Connectivity
algorithms – Shortest path – Minimal spanning tree – The union find problem –
Hamiltonian path and travelling salesperson problems – Network flow – Articulation
points and Biconnected components.
UNIT III HASHING AND SORTING 8
Hash functions – Collision resolution – Expected behavior – Elementary sorts:

Selection – Insertion – Bubble sort –Quick sort – Merge sort – Heap sort – Bucket
sorting –External sorting – Worst case and average behavior – Lower bound for sorting
using comparisons.
UNIT IV ALGORITHM DESIGN TECHNIQUES 8
Greedy methods – Application to bin packing, loading, and knapsack problems –Divide
and conquer – Knapsack and min–max problem – Dynamic programming – 0/1
knapsack problem, recursive and iterative solutions – Local Search Algorithms –
Influence of data structure on algorithm performance.
UNIT V NP vs. P 7
The spaces P and NP – Polynomial reduction – NP complete problems – Boolean
satisfiability and Cook's theorem – Bin packing – Knapsack – Hamiltonian path –TSP –
Independent set – Max clique – Graph coloring – Approximation algorithms.
TOTAL= 45
REFERENCES
1. Aho, J. Hopcroft and J. Ullman, “The Design and Analysis of Computer Algorithms”,
Addison Wesley, 1974.
2. Baase and Gelder, “Computer Algorithms: Introduction to Design and Analysis”, 3 rd
edition, Addison Wesley, 2000.
3. Gilles Brassard and Paul Bratley, “Algorithmics”, Prentice Hall, 1988.
4. Donald Knuth, “The Art of Computer Programming”, 3 volumes, various editions,
Addison Wesley, 1973–81.
5. Robert Kruse, “Data Structures and Program Design “, Prentice Hall, 1984.
6. Udi Manber, “Introduction to Algorithms”, Addison Wesley, 1989.
7. Robert Sedgewick, “Algorithms”, 2nd edition, Addison Wesley, 1988.
8. Thomas H. Cormen (CLRS), “Introduction to Algorithms”, 2 nd edition, Prentice Hall of
India, 2003.
9. Alfred V. Aho, Jeffrey D. Ullman, John E. Hopcroft,“ Data Structures and
Algorithms”, Addison Wesley, 1983.
10. Horowitz and Sahni, “Fundamentals of Computer Algorithms”, Computer Science
Press, 1984.
CS603 OPERATING SYSTEMS 3 0 2 4
UNIT I INTRODUCTION 7
Main frame systems, Desktop systems – Multiprocessor systems – Distributed systems

– Clustered systems – Real time systems – Hand held Systems, Operating systems
structures: System components – Operating system services – System calls – System
programs – System design and implementation – CPU scheduling: Basic concepts –
Scheduling algorithms.
UNIT II PROCESS MANAGEMENT 11
Process concepts – Process scheduling – Operation on process – Co–Operating

process – Inter process communication – Threads: Multithreading models – Process
synchronization: The Critical section problem – Synchronization hardware –
Semaphores – Classical problem of synchronization – Monitors – Deadlock: Deadlock
characterization – Methods for handling deadlocks – Deadlock prevention – Deadlock
avoidance – Deadlock detection – Recovery from deadlock.
UNIT III MEMORY MANAGEMENT 9

Background – Swapping – Contiguous memory allocation – Paging – Segmentation –
Segmentation with paging – Virtual memory: Demand paging – Page replacement –
Thrashing.
UNIT IV FILE SYSTEMS 9
File concepts – Access methods – Directory structure – File protection – File system
implementation: File system structure and implementation – Directory implementation –
Allocation methods free space management – Recovery – Disk structure – Disk
scheduling.
UNIT V DISTRIBUTED OPERATING SYSTEM 9
Design issues in distributed operating system – Distributed file systems – Naming and
transparency – Remote file access – Stateful versus Stateless service – Distributed
coordination – Event ordering – Mutual exclusion – Atomicity – Concurrency control–
Deadlock handling – Election algorithms – Case study – Linux.
TOTAL= 45
TEXTBOOKS
1. Silberschatz, Galvin and Gagne, “Operating System Concepts”, 6 th edition, 2003.

2. Pradeep K.Sinha, “Distributed OS Concepts and Design”, IEEE Computer Society
Press, Prentice hall of India, 1998.
REFERENCES
1. Andrew S. Tanenbaum, “Modern Operating Systems”, Prentice Hall of India, 2 nd

edition, 2001.
2. Achut S. Godbole and Kahate Atul, “Operating Systems & Systems Programming”,
Tata Mcgraw Hill, 2003.
3. Charles Crowley, “Operating systems: A Design Oriented Approach”, Tata McGraw
Hill, 1999.
CS604 SOFTWARE ENGINEERING METHODOLOGIES 3 0 0 3
UNIT I SOFTWARE PROCESS 11
A generic view of processes – Process maturity – Process models – Agile process –

Extreme programming – Software cost estimation – Risk analysis – Software project
planning & scheduling.
UNIT II REQUIREMENT ANALYSIS 6
System engineering hierarchy – Requirement engineering: Tasks, Initiating the process,

eliciting requirements, Developing use cases – Negotiating requirements – Validating
requirements – Building the analysis models: Concepts – Object Oriented Analysis –
Scenario based modeling – Data & control flow oriented model – Class based model –
Behavioral model.
UNIT III SOFTWARE DESIGN 8
Design concepts – Design models – Pattern based design – Architectural design –

Component level design – Class based and conventional components design – Real–
time system design – User interface : Analysis and design.
UNIT IV SOFTWARE TESTING 7
Software testing – Strategies – Issues – Test strategies for conventional and object
oriented software – Validation and system testing – Testing tactics: White box testing,
Basis path testing – Control structure testing – Black box testing – Object oriented
testing – Testing GUI – Testing Client/Server –Documentation testing.
UNIT V SOFTWARE QUALITY ASSURANCE 13
Software quality concepts – Quality assurance – Software technical reviews – Formal

approach to software quality assurance – Reliability – Quality standards – Software
quality assurance plan – Software maintenance – Software configuration management
– Reverse engineering and reengineering – CASE tools.
TOTAL = 45
TEXTBOOKS
1. Roger S. Pressman, “Software Engineering: A Practitioner’s Approach”, 6 th edition,

McGraw Hill, 2005.
REFERENCES
1. I.Sommerville, “Software Engineering”, 5 th edition, Addison Wesley, 1996.

2. Pankaj Jalote, “An Integrated Approach to Software Engineering”, Springer Verlag,
1997.
3. James F Peters and Witold Pedryez, “Software Engineering – An Engineering
Approach”, John Wiley and Sons, New Delhi, 2000.
CS605 COMPUTER NETWORKS AND MANAGEMENT 3 0 2 4
UNIT I COMPUTER NETWORKS AND THE INTERNET 9

Network edge – Network core – Delay, loss and throughput in Packet–switched
networks – Protocol layers and their service models – Networks under attack – History
of computer networking and the Internet.
UNIT II APPLICATION AND TRANSPORT LAYER 9
Principles of network applications – The Web and HTTP – File transfer: File transfer
protocol – DNS – Peer–to–Peer applications – Socket programming – Transport – layer
and services – Multiplexing and demultiplexing – Connectionless transport: User
datagram protocol – Principles of reliable data transfer – Connection–oriented transport:
Principles of congestion control – Congestion control mechanism.
UNIT III THE NETWORK LAYER AND THE LINK LAYER AND LOCAL
AREA NETWORKS 9
Introduction – Virtual circuit and datagram networks – Internet Protocol (IP): Routing
algorithms – Routing in the Internet – Broadcast and multicast routing – Link layer :
Services – Error–detection and correction techniques – Multiple access protocols –
Link–layer addressing – Ethernet – Link-layer switches – Point-to-Point protocol – Link
virtualization: A Network as a Link Layer.
UNIT IV WIRELESS AND MOBILE NETWORKS AND MULTIMEDIA

NETWORKING 9
Introduction – Wireless links and network characteristics – WiFi: 802.11 Wireless LANs
– Cellular internet access – Mobility management: Mobile IP – Managing mobility in
cellular networks – Impact on higher–layer protocols – Multimedia networking
applications – Streaming stored audio and video – Making the best of the Best–effort
service – Protocols for real–time interactive applications – Quality of service
guarantees.
UNIT V SECURITY IN COMPUTER NETWORKS & NETWORK

MANAGEMENT 9
Introduction – Principles of cryptography – Message integrity – End-point authentication

– Securing e–mail – Securing TCP Connections: SSL – Network layer security: Ipsec –
Securing wireless LANs – Operational security: Firewalls and intrusion detection
systems – Network management – The infrastructure for network management – The
Internet–Standard management framework – ASN.1.
TOTAL = 45
TEXT BOOKS
1. James F. Kurose and Keith W. Ross, “Computer Networking: A Top–Down
Approach”, 4th edition, Addison–Wesley, 2007.
REFERENCES
1. Larry Peterson and Bruce Davie, “Computer Networks: A System Approach”, 4th
edition, Morgan Kaufmann, 2007.
2. C. Siva Ram Murthy and B. S. Manoj, “Ad Hoc Wireless Networks: Architectures and
Protocols”, Prentice Hall, 2004.
3. William Stallings, “Wireless Communications & Networks”, 2 nd edition,
Prentice Hall, 2005.
4. Jochen Schiller, “Mobile Communications”, 2nd edition, Addison–Wesley, 2003.
CS606 JAVA PROGRAMMING LAB 1 0 3 2
1. Study of simple Java programs using threading.

2. Create simple application using Applet.
3. Create simple application using UDP, TCP Sockets.
4. Implement the concept of Java Message Services.
5. Implement the concept of Swing.
6. Implement RMI.
7. Implement server side programming.
8. Implement the concept of JDBC.
9. Implement JAR file creation and Java Scripts.
SEMESTER – II
CS607 DATA BASE TECHNOLOGY 3 0 0 3
UNIT I DATABASE MANAGEMENT 9
Relational data model – SQL – Database design – Entity-Relationship model – Relational

normalization – Embedded SQL – Dynamic SQL – JDBC – ODBC.
UNIT II ADVANCED DATABASES 10

Object databases – Conceptual object data model – XML and Web data – XML schema –
Distributed data bases – OLAP and Data mining – ROLAP and MOLAP.
UNIT III QUERY AND TRANSACTION PROCESSING 8
Query processing basics – Heuristic optimization – Cost, size estimation – Models of

transactions – Architecture – Transaction processing in a centralized and distributed system – TP
monitor.
UNIT IV IMPLEMENTING AND ISOLATION 9
Schedules – Concurrency control – Objects and semantic commutativity – Locking –Crash, abort
and media failure – Recovery – Atomic termination – Distributed deadlock – Global serialization
– Replicated databases – Distributed transactions in Real world.
UNIT V DATABASE DESIGN ISSUES 9
Security – Encryption – Digital signatures – Authorization – Authenticated RPC – Integrity –

Consistency – Database tuning – Optimization and research issues.
TOTAL = 45
REFERENCES
1. Philip M. Lewis, Arthur Bernstein and Michael Kifer, “Databases and Transaction
Processing: An Application–Oriented Approach”, Addison–Wesley, 2002.
2. R. Elmasri and S.B. Navathe, “Fundamentals of Database Systems”, 3 rd edition, Addison
Wesley, 2004.
3. Abraham Silberschatz, Henry. F. Korth and S.Sudharsan, “Database System Concepts”, 4th
edition, Tata McGraw Hill, 2004.
4. Raghu Ramakrishnan and Johannes Gehrke, “Database Management Systems”, 3rd edition,
TMH, 2003.
CS608 SERVICE ORIENTED ARCHITECTURE 3 0 0 3
UNIT I SOA AND WEB SERVICES FUNDAMENTALS 5
Fundamentals of SOA – Characteristics – Common misperception – Benefits – Pitfalls

of adopting SOA – Transition from XML to web service to SOA – Reshaping of XML and
web service through SOA – Standards for SOA – Comparison of SOA vs Past
architecture – Web services frame work – Service description – Messaging with SOA.
UNIT II SECOND GENERATION WEB SERVICES 9

Activity management and comparison – Message exchange patterns – Service activity –
Coordination – Atomic transactions – Business activities – Business protocols –
Process definitions – Process services – Orchestration and coordination –
Collaboration. Addressing – Reliable messaging – WS policy framework – Policy
assertions and alleviates policies relationship to activity management – Metadata
exchange security – WS notification and eventing.
UNIT III SERVICE ORIENTATION 9
Service oriented architecture – Components – Common principles of service –

Orientation – Interrelationship among principles – Service orientation VS object
orientation – Service layers – Different services layers – Configuration scenarios of
service layers. SOA delivery life cycle phases – Agile strategy – SOA analysis – Service
modeling – guidelines – Classifications of service models.
UNIT IV TECHNOLOGIES AND DESIGN FOR SOA 11
Service oriented design – Web service description language (WSDL) – Related XML
schema – WSDL language basis – SOAP language basis – Service interface design
tools – SOA comparison guide lines – Industry standards – XML AWSOA – WSDL and
SOA – SOAPAWAOA – SOA extension.
UNIT V 11
Service design – Guidelines – Business process design – WS – BPEL language basics

– WS – BPEL elements – WS coordination – Service oriented process design – WS
addressing language and messaging basis – WS – Meta data exchange – Security
language basis – WSOA platform – SOA support in J2EE and .NET.
TOTAL = 45
TEXT BOOK
1. Thomas Erl, “Service–Oriented Architecture: Concepts, Technology & Design”,

Prentice Hall / Pearson, 2005.
REFERENCES
1. Thomas Erl , “Service–Oriented Architecture: A Field Guide to Integrating XML and Web
Services ”, The Prentice Hall, Service–Oriented Computing Series, 2004.
2. Thomas Erl, “SOA Principles of Service Design”, Prentice Hall Service–Oriented Computing
Series, 2007.
3. Shankar Kambhampaty, “Service Oriented Architecture for Enterprise Applications”, 1 st
edition, Wiley India Private Limited, 2008.
4. Mike Rosen, Boris Lublinsky, Kevin T. Smith and Marc J. Balcer, “Applied SOA Service
Oriented Architecture And Design Strategies”, Wiley India Private Limited, 2008.
5. Eric Newcomer Greg Lomow, “Understanding SOA with Web Services”, Pearson
Education, 2nd edition, 2008.
6. Paul. C. Brown, “Implementing SOA Total Architecture in Practice”, Pearson Education,
2009.
7. Nicolai M. Josuttis, “SOA in Practice, The Art of Distributed System Design”, 2 nd edition,
2008.
CS609 MOBILE COMPUTING 3 0 0 3
Medium access control : Motivation for specialized MAC – SDMA – FDMA – TDMA –
CDMA – Comparison of access mechanisms – Tele communications : GSM – DECT–
TETRA – UMTS – IMT–200 – Satellite Systems: Basics – Routing – Localization –
Handover – Broadcast systems: Overview – Cyclic repetition of data – Digital audio
broadcasting – Digital video broadcasting.
UNIT II WIRELESS NETWORKS 9
Wireless LAN: Infrared Vs Radio transmission – Infrastructure networks – Ad hoc

networks – IEEE 802.11 – HIPERLAN – Bluetooth – Wireless ATM: Working group –
Services– Reference model – Functions – Radio access layer – Handover – Location
management – Addressing mobile quality of service – Access point control protocol.
UNIT III MOBILE NETWORK LAYER 9
Mobile IP : Goals – Assumptions and requirement – Entities – IP packet delivery– Agent

advertisement and discovery – Registration – Tunneling and encapsulation –
Optimization – Reverse tunneling – IPv6 – DHCP – Ad hoc networks.
UNIT IV MOBILE TRANSPORT LAYER 9
Traditional TCP – Indirect TCP– Snooping TCP – Mobile TCP – Fast retransmit/ Fast
recovery – Transmission/Timeout freezing – Selective retransmission – Transaction
oriented TCP.
UNIT V WAP 9
Architecture – Datagram protocol – Transport layer security – Transaction protocol –

Session protocol – Application environment – Wireless Telephony application – Latest
wireless technologies: 3G – WiMax.
TOTAL = 45
REFERENCES
1. J.Schiller, “Mobile Communication”, Addison Wesley, 2000.

2. William Stallings, “Wireless Communication and Networks”, Pearson Education,
2003.
3. Singhal, “WAP–Wireless Application Protocol”, Pearson Education, 2003.
4. Lother Merk, Martin S. Nicklaus and Thomas Stober, “Principles of Mobile
Computing”, 2nd Edition, Springer, 2003.
5. William C. Y. Lee, “Mobile Communication Design Fundamentals”, John Wiley,
1993.
CS610 GRID COMPUTING 3 0 0 3
UNIT I GRID COMPUTING 9
Introduction – Definition – Scope of grid computing.
UNIT II GRID COMPUTING INITIATIVES 9
Grid computing organizations and their roles – Grid computing analog – Grid computing
road map.
UNIT III GRID COMPUTING APPLICATIONS 9
Merging the grid sources – Architecture with the Web devices architecture.
UNIT IV TECHNOLOGIES 9
OGSA – Sample use cases – OGSA platform components – OGSI – OGSA basic
services.
UNIT V GRID COMPUTING TOOL KITS 9
Globus Toolkit – Architecture, Programming model, High level services – OGSI .Net
middleware Solutions.
TOTAL = 45
REFERENCES
1. Joshy Joseph and Craig Fellenstein, “Grid Computing”, Prentice Hall of India, 2003.
2. Ahmar Abbas, “Grid Computing: A Practical Guide to technology and Applications”,
Charles River media, 2003.
CS611 DBMS LAB 103 2
Student should carryout exercises applying the following concepts

1. Data Definition Language (DDL) commands in RDBMS.
2. Data Manipulation Language (DML) and Data Control Language (DCL)
commands in RDBMS.
3. High–level language extension with Cursors.
4. High level language extension with Triggers
5. Procedures and Functions.
6. Embedded SQL.
7. Database design using E–R model and Normalization.
8. Any other real time applications such as Payroll Processing System, Banking
System, Library Information System.
CS612 CASE STUDY: ALGORITHMIC DESIGN AND

IMPLEMENTATION 1 0 3 2
 The basic idea of this case study is to encourage problem solving, logical
thinking and analytical capability attacking real time problems. The concepts
focused are problem decomposition, problem definition, analysis, synthesis and
methodology to solve complex problems.
 The student will work on new algorithms or modify the existing algorithms
suitable to the problem that is given to him/her.
 The student will also implement the algorithmic design that he has made and
show some output after implementation.
SEMESTER – III
CS701 HIGH SPEED NETWORKS 3 0 0 3
UNIT I HIGH SPEED NETWORKS 8
Frame relay networks – Asynchronous transfer mode – ATM protocol architecture, ATM
logical connection, ATM cell – ATM service categories – AAL. High speed LAN’s: Fast
Ethernet, Gigabit Ethernet, fiber channel – Wireless LAN’s applications, requirements –
Architecture of 802.11.
UNIT II CONGESTION AND TRAFFIC MANAGEMENT 8

Queuing analysis – Queuing models – Single server queues – Effects of congestion –
Congestion control – Traffic management – Congestion control in packet switching
networks – Frame relay congestion control.
UNIT III TCP AND ATM CONGESTION CONTROL 12
TCP Flow control – TCP Congestion control – Retransmission – Timer management –

Exponential RTO backoff – KARN’s algorithm – Window management – Performance of
TCP over ATM. Traffic and Congestion control in ATM – Requirements – Attributes –
Traffic management frame work, Traffic control – ABR traffic management – ABR rate
control, RM cell formats, ABR capacity allocations – GFR traffic management.
UNIT IV INTEGRATED AND DIFFERENTIATED SERVICES 8
Integrated services architecture – Approach, Components, Services – Queuing

discipline, FQ, PS, BRFQ, GPS, WFQ – Random early detection, Differentiated
services.
UNIT V PROTOCOLS FOR QOS SUPPORT 8
RSVP – Goals and characteristics, Data flow, RSVP operations, Protocol mechanisms –
Multiprotocol label switching – Operations, Label stacking, Protocol details – RTP –
Protocol architecture, Data transfer protocol, RTCP.
TOTAL = 45
TEXTBOOK
1. William Stallings, “High Speed Networks and Internet” , Pearson Education, 2 nd

edition, 2002.
REFERENCES
1. Warland and Pravin Varaiya , “High Performance Communication Networks”,

Jean Harcourt Asia Private Limited, 2nd edition, 2001.
2. Irvan Pepelnjk, Jim Guichard and Jeff Apcar, “MPLS and VPN Architecture”, Cisco
Press, Volume 1 and 2, 2003.
CS702 NETWORK SECURITY 3 0 0 3
UNIT I SYMMETRIC CIPHERS (Techniques and Standards) – I 9
Introduction – Services, mechanisms and attacks – OSI security architecture – Model

for network security. Classical encryption techniques – Symmetric cipher model –
Substitution techniques – Transposition techniques – Rotor machines – Stenography.
Block ciphers and data encryption standard – Simplified DES – Block cipher principles –
Data encryption standard – Strength of DES – Differential and linear Crypt Analysis –
Block cipher design principles – Block cipher modes of operation.
UNIT II SYMMETRIC CIPHERS (Techniques and Standards) – II 9
Advanced encryption standard – Evaluation criteria for AES, AES Cipher. Contemporary
symmetric ciphers – Triple DES, Blowfish, RC5 – Characteristics of advanced
symmetric block ciphers – RC4 stream cipher. Confidentiality using symmetric
encryption – Placement of encryption function – Traffic confidentiality, Key Distribution,
and Random Number Generation.
UNIT III PUBLIC– KEY ENCRYPTION AND HASH FUNCTIONS 9
Public key cryptography and RSA – Principles of public key cryptosystems, RSA
Algorithm. Key management and other public key cryptosystems – Key management,
Diffie–Hellman key exchange, Elliptic curve arithmetic, Elliptic curve cryptography.
Message Authentication and Hash Functions – Authentication requirements,
Authentication functions, Message authentication codes, Hash functions and MACs.
Hash algorithms – MD5 Message Digest algorithm. Secure hash algorithm– RIPEMD
160– HMAC. Digital signatures and Authentication protocols – Digital signatures,
Authentication protocols, Digital signature standards.
UNIT IV NETWORK SECURITY PRACTICE 9
Authentication applications – Kerberos – X.509 Authentication Service. Electronic Mail

Security – Pretty Good Privacy, S/MIME. IP Security – IP Security Overview, IP Security
Architecture, Authentication header, Encapsulating security payload, Combining
security associations. Web security – Web security considerations – Secure sockets
layer and Transport layer security – Secure electronic transaction.
UNIT V SYSTEM SECURITY 9
Intruders – Intruder detection, Password management. Malicious software –Virus and

related threats – Virus Counter Measures. Firewalls – Firewall design principles–
Trusted Systems.
TOTAL = 45
REFERENCES
1. William Stallings, “Cryptography and Network Security”, 3rd edition, Prentice Hall of
India, New Delhi, 2004.
2. William Stallings, “Network Security Essentials”, 2 nd edition, Prentice Hall of India,
New Delhi, 2004.
3. Charlie Kaufman, “Network Security: Private Communication in Public World”, 2 nd
Edition, Prentice Hall of India, New Delhi, 2004.
ELECTIVES
CSY001 THEORY OF COMPUTATION 3 0 0 3
UNIT I FINITE AUTOMATA AND REGULAR LANGUAGES 9
Finite automata and Regular languages – Regular expressions and Regular languages
– Non determinism and Kleenes theorem, Equivalence of DFA and NFA, Finite
automation with e–moves, Equivalence of regular expression and NFA with e–moves –
Pumping lemma for regular sets.
UNIT II CONTEXT FREE LANGUAGES 9
Context free languages – Derivation and languages – Relationship between derivation

and derivation trees – Simplification of context free grammars – Normal forms for
context free grammars – CNF and GNF.
UNIT III PUSH DOWN AUTOMATA (PDA) 9
Acceptance by PDA – Pushdown automata and context free languages – Pumping

lemma for CFL and Deterministic pushdown automata.
UNIT IV TURING MACHINE 9
Turing machine (Definition and examples) – Programming techniques of turing machine

– Computable languages and functions – Church turing hypothesis – Universal turing
machine – P and NP problems – NP–complete.
UNIT V UNSOLVABLE PROBLEMS 9
Unsolvable problems – Rice Theorem – Post's correspondence problem – Recursive

and recursively enumerable languages.
TOTAL = 45
TEXT BOOKS
1. Hopcroft and Ullman, “Introduction to Automata, Languages and Computation”,

Narosa Publishers, 2nd edition, 2000.
2. John.C.Martin, “Introduction to languages and the Theory of Computation”, 2 nd
edition, McGraw Hill,1997.
REFERENCES
1. A.M.Natarajan, A.Tamilarasi and P.Balasubramani, “Theory of Computation”, New

Age International Publishers, 2002.
2. K.L.P.Mishra and N.Chandrasekaran, “Theory of Computation”, IEEE, Prentice Hall
of India, 2nd edition, 1998.
3. Peter Linz, “An Introduction to Formal Languages and Automata”, Narosa Publishing
House, 2001.
4. Harry R. Lewis and Christos H. Papadimitriou, “Elements of Theory of Computation”,
Prentice Hall, 2002.
CSY002 SOFT COMPUTING 3 0 0 3
UNIT I FUZZY SET THEORY 10
Introduction to neuro-fuzzy and soft computing – Fuzzy sets – Basic definition and
terminology – Set-theoretic operations – Member function formulation and
parameterization – Fuzzy rules and Fuzzy reasoning – Extension principle and Fuzzy
relations – Fuzzy If–then rules – Fuzzy reasoning – Fuzzy inference systems –
Mamdani fuzzy models – Sugeno fuzzy models – Tsukamoto fuzzy models – Input
space partitioning and fuzzy modeling.
UNIT II OPTIMIZATION 8
Derivative-based optimization – Descent methods – Method of steepest descent –

Classical Newton’s method – Step size determination – Derivative-free optimization –
Genetic algorithms – Simulated annealing – Random search – Downhill simplex search.
UNIT III NEURAL NETWORKS 10
Supervised learning neural networks – Perceptrons – Adaline – Backpropagation

Multilayer perceptrons – Radial basis function networks – Unsupervised learning and
Other neural networks – Competitive learning networks – Kohonen self – Organizing
networks – Learning vector quantization – Hebbian learning.
UNIT IV NEURO FUZZY MODELING 9
Adaptive neuro-fuzzy inference systems – Architecture – Hybrid learning algorithm –

learning methods that cross-fertilize ANFIS and RBFN – Coactive neuro – Fuzzy
modeling – Framework – Neuron functions for adaptive networks – Neuro fuzzy
spectrum.
UNIT V APPLICATION OF COMPUTATIONAL INTELLIGENCE 8

Printed character recognition – Inverse kinematics problems – Automobile fuel
efficiency prediction – Soft computing for color recipe prediction.
TOTAL= 45
REFERENCES
1. J.S.R.Jang, C.T.Sun and E.Mizutani, “Neuro-Fuzzy and Soft Computing”, PHI,

Pearson Education, 2004.
2. Timothy J.Ross, “Fuzzy Logic with Engineering Application”, McGraw Hill, 1977.
3. Davis E.Goldberg, “Genetic Algorithms: Search, Optimization and Machine
Learning”, Addison Wesley, N.Y., 1989.
4. S.Rajasekaran and G.A.V.Pai, “Neural Networks, Fuzzy Logic and Genetic
Algorithms”, PHI, 2003.
5. R.Eberhart, P.Simpson and R. Dobbins, “Computional Intelligence, PC Tools”, AP
Professional, Boston, 1996.
CSY003 DISTRIBUTED OPERATING SYSTEMS 3 0 0 3
UNIT I 9
Fundamentals: Distributed computing system – Introduction – Computer networks.

Message Passing: Introduction – Desirable features of a good message passing system
– Group communication.
UNIT II 9
Remote Procedure Calls: Introduction and implementation – Distributed shared

memory.
UNIT III 9
Synchronization – Resource management – Process management.
UNIT IV 9
Distributed file systems: Introduction, models, semantics – Naming: Introduction and

schemes.
UNIT V 9
Security: Introduction and attacks. Case Studies: Amoeba, Mach, Chorus –

Comparative study
TOTAL = 45
REFERENCES
1. Pradeep K. Sinha ,“Distributed Operating Systems Concepts and Design” , Prentice

Hall of India Private Limited, 2003.
CSY004 WEB TECHNOLOGY 3 0 0 3
Introduction – Network concepts – Web concepts – Internet addresses – Retrieving data

with URL – HTML – DHTML: Cascading style sheets – Scripting languages: Javascript
– Vbscript.
UNIT II COMMON GATEWAY INTERFACE 9

Common gateway interface: Programming CGI Scripts – HTML Forms – Custom
database query scripts – Server side includes – Server security issues – XML.
UNIT III JAVA PROGRAMMING 9

Java fundamentals: Classes – Inheritance – Packages – Interfaces – Exceptions
Handling – Multi threading – Applets.
UNIT IV SERVER SIDE PROGRAMMING 9

Server side programming – Active server pages – Java server pages – Java servlets:
Servlet container – Exceptions – Sessions and session tracking – Using servlet context
– Dynamic content generation – Servlet chaining and communications.
UNIT V APPLICATIONS 9
Simple applications – Internet commerce – Database connectivity – Online databases –
EDI Applications in business – Plug-ins – Firewalls.
TOTAL= 45
REFERENCES
1. Deitel, Deitel and Neito, “Internet And World Wide Web – How to program”, Pearson
Education Asia, 2001.
2. D.Norton and H. Schildt, “Java 2: The complete Reference”, Tata McGraw-Hill
publications, 2000.
3. Elliotte Rusty Herold, “Java Network Programming”, O’Reilly Publications, 3 rd edition,
2004.
4. Eric Ladd and Jim O’Donnell, “Using HTML 4, XML, and JAVA1.2”, Prentice hall of
India publications, 2003.
5. Jeffy Dwight, Michael Erwin and Robert Nikes, “Using CGI”, Prentice hall of India
publications, 1997.
CSY005 XML AND WEB SERVICES 3 0 0 3
Role of XML – XML and the Web – XML language basics – SOAP – Web services –
Revolutions of XML – Service oriented architecture (SOA).
UNIT II XML TECHNOLOGY 9

XML – Name spaces – Structuring with schemas and DTD – Presentation techniques –
Transformation – XML infrastructure.
UNIT III SOAP 9
Overview of SOAP – HTTP – XML– RPC – SOAP: Protocol – Message structure –

Intermediaries – Actors – Design patterns and faults – SOAP with attachments.
UNIT IV WEB SERVICES 9
Overview – Architecture – Key technologies – UDDI – WSDL – ebXML – SOAP and

Web Services In E-Com – Overview of .NET and J2EE.
UNIT V XML SECURITY 9
Security overview – Canonicalization – XML security framework – XML encryption –

XML digital signature – XKMS structure – Guidelines for signing XML documents – XML
in practice.
TOTAL= 45
REFERENCES
1. Frank. P. Coyle, “XML Web services and The Data revolution”, Pearson Education,
2002.
2. Ramesh Nagappan, Robert Skoczylas and Rima Patel Sriganesh, “ Developing Java
Web Services”, Wiley Publishing Inc., 2004.
3. Sandeep Chatterjee and James Webber, “Developing Enterprise Web Services”,
4. McGovern, “Java Web Services Architecture”, Morgan Kaufmann Publishers, 2005.
CSY006 BIO INFORMATICS 3 0 0 3
Central dogma – Killer application – Parallel universes – Watson’s definition – Top
down Vs bottom up approach – Information flow – Conversance – Communications.
UNIT II DATABASE AND NETWORKS 9
Definition – Data management – Data life cycle – Database technology – Interfaces –

Implementation – Networks: Communication models – Transmission technology –
Protocols – Bandwidth – Topology – Contents – Security – Ownership –
Implementation.
UNIT III SEARCH ENGINES AND DATA VISUALIZATION 10
Search process – Technologies – Searching and Information theory – Computational

methods – Knowledge management – Sequence visualizations – Structure
visualizations – User interfaces – Animation Vs simulation.
UNIT IV STATISTICS, DATA MINING AND PATTERN MATCHING 11
Statistical concepts – Micro arrays – Imperfect data – Basics – Quantifying –

Randomness – Data analysis – Tools selection – Alignment – Clustering – Classification
– Data mining methods – Technology – Infrastructure pattern recognition – Discovery –
Machine learning – Text mining – Pattern matching fundamentals – Dot matrix analysis
– Substitution matrix – Dynamic programming – Word method – Bayesian method –
Multiple sequence alignment tools.
UNIT V MODELING SIMULATION AND COLLABORATION 8
Drug discovery fundamentals – Protein structure – System biology tools – Collaboration

and communication – Standards – Issues – Case study.
TOTAL = 45
REFERENCES
1. Bryan Bergeron, “Bio Informatics Computing”, Prentice Hall of India, 2003.

2. T.K. Affward and D.J. Parry Smith, “Introduction to Bio Informatics”, Pearson
Education, 2001.
3. Pierre Baldi and Soren Brunak, “Bio Informatics – The Machine Learning Approach”,
2nd edition, First East West Press, 2003.
CSY007 MULTIMEDIA SYSTEMS 3 0 0 3
UNIT I INTRODUCTION AND QOS 9

Introduction – QOS Requirements and constraints – Concepts – Resources –
Establishment phase-run – Time phase – Management architectures.
UNIT II OPERATING SYSTEMS 9
Real-time processing – Scheduling – Interprocess communication – Memory and

management – Server architecture – Disk management.
UNIT III FILE SYSTEMS AND NETWORKS 9
Traditional and multimedia file systems – Caching policy – Batching – Piggy backing –
Ethernet – Gigabit Ethernet – Token ring – 100VG AnyLAN-Fiber Distributed Data
Interface (FDDI) – ATM networks – MAN – WAN.
UNIT IV COMMUNICATION 9
Transport subsystem – Protocol support for QOS – Transport of multimedia – Computer

supported cooperative work – Architecture – Session management – MBone
applications.
UNIT V SYNCHRONIZATION 9
Synchronization in multimedia systems – Presentation – Synchronization types–

Multimedia synchronization methods – Case studies – MHEG – MODE – ACME.
TOTAL= 45
REFERENCES
1. Ralf Steinmetz and Klara Nahrstedt, “Multimedia systems”, Springer, 1st edition,
2004.
2. Ralf Steinmetz and Klara Nahrstedt , “Media Coding and Content Processing”,
Prentice Hall of India, 2002.
3. Vaughan T, “Multimedia”, Tata McGraw Hill, 1999.
4. Mark J.B. and Sandra K.M., “Multimedia Applications Development using DVI
technology”, Tata McGraw Hill, 1992.
5. K.R.Rao, Zoran S. Bojkovic, Dragorad A. Milovacovic and D. A. Milovacovic,
“Multimedia Communication Systems: Techniques, Standards, and Networks”,
Prentice Hall of India, 1st edition, 2002.
6. Ze-Nian Li and Mark S. Drew, “Fundamentals of Multimedia”, Pearson Education,
2004.
CSY008 SOFTWARE TESTING 3 0 0 3
UINT I INTRODUCTION 9
Purpose of testing – A model for testing – A taxonomy of bugs – Path testing –
Predicates, path predicates and achieving paths – Path sensitizing – Path
instrumentation – Implement and application of path testing.
UNIT II TRANSACTION–FLOW TESTING 9
Transaction flows – Transaction-flow testing techniques – Data-flow testing basics –

Data-flow testing strategies – Domain and paths – Domain testing – Domain and
interface testing – Domains and testability.
UNIT III METRICS 9
Metrics – Linguistic metrics – Structural metrics – Hybrid metrics – Metrics

implementation.
UNIT IV SYNTAX TESTING 9
A grammar for formats – Test case generation – Implementation and application –

Logic based testing – Overview – Decision tables – Path expression – KV charts –
Specifications.
UNIT V IMPLEMENTATION 9
Overview – Strategies for programmers – Strategies for independent testers – Tests as

software products – Tools.
TOTAL = 45
REFERENCES
1. Boris Beiser, “Software Testing Techniques”, 2 nd edition, Dreamtech press, New
Delhi, 2003.
2. Edward Kit, “Software Testing in the Real World - Improving the Process”, Pearson
Education, 2004.
3. William E. Perry , “Effective Methods for Software Testing”, 2 nd edition, Wiley
publications, 2000.
CSY009 EMBEDDED SYSTEMS 3 0 0 3
UNIT I INTRODUCTION TO EMBEDDED SYSTEMS 9
Definition and classification – Overview of processors and hardware units in an

embedded system – Software embedded into the system – Exemplary embedded
systems – Embedded systems on a chip (SoC) and the use of VLSI designed circuits.
UNIT II DEVICES AND BUSES FOR DEVICES NETWORK 9

I/O devices – Device I/O types and examples – Synchronous – Iso-Synchronous and
asynchronous communications from serial devices – Examples of internal serial–
communication devices – UART and HDLC – Parallel port devices – Sophisticated
interfacing features in devices/ports – Timer and counting devices – ‘12C’, ‘USB’, ‘CAN’
and advanced I/O Serial high speed buses – ISA, PCI, PCI–X, cPCI and advanced
buses.
UNIT III EMBEDDED PROGRAMMING 9
Programming in assembly language (ALP) vs. High level language – C program

elements, Macros and functions – Use of pointers – NULL pointers – Use of function
calls – Multiple function calls in a cyclic order in the main function pointers – Function
queues and interrupt service routines queues pointers – Concepts of embedded
programming in C++ – Objected Oriented Programming – Embedded programming in
C++, ‘C’ program compilers – Cross compiler – Optimization of memory codes.
UNIT IV REAL TIME OPERATING SYSTEMS – PART – 1 9
OS services – Interrupt routines handling, Task scheduling models – Handling of task

scheduling and latency and deadlines as performance metrics – Inter process
communication and synchronisation – Shared data problem – Use of semaphore(s) –
Priority inversion problem and deadlock situations – Inter process communications
using signals – Semaphore flag or mutex as resource key – Message queues –
Mailboxes – Pipes – Virtual (Logical) sockets – RPCs.
UNIT V REAL TIME OPERATING SYSTEMS – PART – 2 9
Study of RTOS, VxWorks – Basic features – Task management library at the system –
Library header file – VxWorks system functions and system tasks – Inter process
(Task) communication functions – Case study of coding for sending application layer
byte streams on a TCP/IP network using RTOS Vxworks.
TOTAL = 45
REFERENCES
1. Raj Kamal, “Embedded Systems Architecture, Programming and Design”, TATA

McGraw Hill, 1st reprint , 2003.
2. David E.Simon, “An Embedded Software Primer”, Pearson Education Asia, 1 st Indian
reprint , 2000.
CSY010 SOFTWARE QUALITY ASSURANCE 3 0 0 3
UNIT I FUNDAMENTALS 9
Introduction – Background – Concepts of quality control – Quality assurance – Quality
management – Total quality management – Cost of quality – Seven tools – Holding the
gains – Six new tools.
UNIT II TOOLS & TECHNIQUES 9
Process and product metrics – Seven wastes – Statistical process control – Statistical
quality assurance – Benchmarking – Best demonstrated practices – Quality function
deployment – Business process Re-engineering – Overview of– Defects per million
opportunities – Design of experiments – FMEA – Kaizen.
UNIT III QUALITY ASSURANCE MODELS 9
Models for quality assurance – ISO-9000 Series – Process Models – CMMs – SW –

CMM, CMMI, PCMM – Malcolm Baldrige Award.
UNIT IV SOFTWARE QUALITY ASSURANCE RELATED TOPICS 9
Software Quality Assurance (SQA) function and responsibilities – Software process –

Definition and implementation – Software Engineering Process Group (S.E.P.G.) –
Software testing – Configuration management – Project management – SQA plan –
Quality goals– Internal auditing and assessments – Inspections & walkthroughs.
UNIT V ADVANCED TOPICS 9
Overview of PSP – TSP – Six Sigma and formal methods of verification – Zero defects–
Defect prevention and planning – Software reliability models.
TOTAL= 45
REFERENCES
1. John Bicheno and M.R Gopalan, “Management Guide to Quality and Productivity”,
Wiley Publications, 2nd edition, 2004.
2. Watts S. Humphery, “Managing The Software Process ", Pearson Education, 2008.
3. Philip B. Crosby, " Quality is Free: The Art of Making Quality Certain ", Mass Market,
1992.
4. Roger Pressman, “Software Engineering ", 6th edition, Tata McGraw Hill, 2005.
5. Stephen H. Kan, “Metrics and Models in Software Quality Engineering”, Pearson
Education, 2002.
CSY011 MOBILE ADHOC NETWORKS 3 0 0 3
Introduction – Fundamentals of wireless communication technology – The
Electromagnetic spectrum – Radio propagation mechanisms – Characteristics of the
wireless channel – IEEE 802.11a,b standard – Origin of Ad hoc: Packet radio networks
– Technical challenges – Architecture of PRNETs – Components of packet radios –
Adhoc wireless networks – Heterogeneity in mobile devices – Wireless sensor networks
– Traffic profiles – Types of Ad hoc mobile communications – Types of mobile host
movements – Challenges facing Ad hoc mobile networks – Ad hoc wireless internet.
UNIT II AD HOC ROUTING PROTOCOLS 9
Introduction – Issues in designing a routing protocol for Ad hoc wireless networks –

Classifications of routing protocols – Table-Driven routing protocols – Destination
Sequenced Distance Vector (DSDV) – Wireless Routing Protocol (WRP) – Cluster
Switch Gateway Routing (CSGR) – Source-Initiated On-Demand approaches – Ad hoc
On-Demand Distance Vector Routing (AODV) – Dynamic Source Routing (DSR) –
Temporally Ordered Routing Algorithm (TORA) – Signal Stability Routing (SSR) –
Location–Aided Routing (LAR) – Power-Aware Routing (PAR) – Zone Routing Protocol
(ZRP) .
UNIT III MULTICASTROUTING IN AD HOC NETWORKS 9
Introduction – Issues in designing a multicast routing protocol – Operation of multicast

routing protocols – An architecture reference model for multicast routing protocols –
Classifications of multicast routing protocols – Tree-Based multicast routing protocols –
Mesh-based multicast routing protocols – Summary of tree and mesh based protocols –
Energy–efficient multicasting – Multicasting with quality of service guarantees –
Application–dependent multicast routing – Comparisons of multicast routing protocols.
UNIT IV TRANSPORT LAYER, SECURITY PROTOCOLS 9
Introduction – Issues in designing a transport layer protocol for Ad hoc wireless

networks – Design goals of a transport layer protocol for Ad hoc wireless networks –
Classification of transport layer solutions – TCP over Ad hoc wireless networks – Other
transport layer protocols for Ad Hoc wireless networks – Security in Ad hoc wireless
networks – Network security requirements – Issues and challenges in security
provisioning – Network security attacks – Key management – Secure routing in Ad hoc
wireless networks.
UNIT V QoS AND ENERGY MANAGEMENT 9
Introduction – Issues and challenges in providing QoS in Ad hoc wireless networks –

Classifications of QoS solutions – MAC layer solutions – Network layer solutions – QoS
frameworks for Ad hoc wireless networks energy management in Ad hoc wireless
networks –Introduction – Need for energy management in Ad hoc wireless networks –
Classification of energy management schemes – Battery management schemes –
Transmission power management schemes – System power management schemes.
TOTAL= 45
REFERENCES
1. C. Siva Ram Murthy and B.S. Manoj, “Ad Hoc Wireless Networks: Architectures and
Protocols”, Pearson Prentice-Hall, 2004.
2. C.K. Toh, “Ad Hoc Mobile Wireless Networks: Protocols and Systems”, Prentice-Hall
of India ,2001.
3. Charles E. Perkins, “Ad Hoc Networking”, Addison Wesley, 2000.
CSY012 DATA WAREHOUSING AND DATA MINING 3 0 0 3
Relation to statistics, Databases – Data mining functionalities – Steps in data mining

process – Architecture of a typical data mining systems – Classification of data mining
systems – Overview of data mining techniques.
UNIT II DATA PREPROCESSING AND ASSOCIATION RULES 9
Data preprocessing – Data cleaning, Integration, Transformation, Reduction,

Discretization concept hierarchies–Concept description: Data generalization and
summarization based characterization – Mining association rules In large databases.
UNIT III PREDICTIVE MODELING 9
Classification and Prediction: Issues regarding classification and prediction –

Classification by decision tree induction – Bayesian classification – Other classification
methods – Prediction – Clusters analysis: Types of data in Cluster analysis –
Categorization of major clustering methods: Partitioning methods – Hierarchical
methods.
UNIT IV DATA WAREHOUSING 9
Data warehousing components – Multi-dimensional data model – Data warehouse

architecture – Data warehouse implementation – Mapping the data warehouse to
multiprocessor architecture – OLAP– Need – Categorization of OLAP tools.
Applications of data mining – Social impacts of data mining – Tools:An introduction to
DB Miner – Case studies – Mining WWW – Mining text database – Mining spatial
databases.
TOTAL= 45
REFERENCES
1 Jiawei Han and Micheline Kamber, "Data Mining: Concepts and Techniques",
Morgan Kaufmann Publishers, 2002.
2 Alex Berson and Stephen J. Smith, “Data Warehousing, Data Mining & OLAP”, Tata
Mcgraw Hill, 2004.
3 Usama M.Fayyad, Gregory Piatetsky–Shapiro, Padhrai Smyth and Ramasamy
Uthurusamy, "Advances In Knowledge Discovery And Data Mining", The M.I.T
Press, 1996.
4. Ralph Kimball, "The Data Warehouse Life Cycle Toolkit", John Wiley & Sons Inc.,
1998.
5. Sean Kelly, "Data Warehousing In Action", John Wiley & Sons Inc., 1997.
CSY013 PERFORMANCE EVALUATION OF COMPUTER

SYSTEMS AND NETWORKS 3 0 0 3
Need for performance evaluation – Role of performance evaluation – Performance

evaluation methods – Performance metrics and evaluation criteria – CPU and I/O
architectures – Distributed and network architectures– Secondary storage – Topologies
– Computer architecture – Fundamental concepts and performance measures.
UNIT II PROBABILITY AND STOCHASTIC PROCESSES 9
Scheduling algorithms – Workloads – Random variables – Probability distributions –

Densities – Expectation – Stochastic processes – Poisson process – Birth-Death
process – Markov process.
UNIT III QUEUING THEORY 9
Queuing systems – Networks of queues – Estimating parameters and distributions –

Computational methods – Simulation process – Time control – Systems and modeling.
UNIT IV PETRI NETS AND SYSTEM PERFORMANCE 9

Petri nets – Classical petri nets – Timed petri nets – Priority-based petri nets – Colored
petri nets – Generalized petri nets – Tool selection – Validation of results – Performance
metrics – Evaluation – Multiple server computer system analysis.
UNIT V ANALYSIS 9
OS components – System architecture – Workloads – Design – Simulation – Analysis –

Database system performance – Computer networks components – Simulation
modeling of LAN.
TOTAL = 45
REFERENCES
1. Paul J. Fortier and Howard E. Michael, “Computer Systems Performance

Evaluation and Prediction”, Elsevier Science, USA, 2003.
2. Thomas G. Robertazzi, “Computer Networks and Systems: Queing theory and
Performance Evaluation”, 3rd edition, Springer, 2000.
3. Domenico Ferrari, Giuseppe Serazzi and Alexandro Zeijher, “Measurement &
Tuning of Computer Systems ”,Prentice Hall Inc, 1983.
4. Michael F.Mories and Paul F.Roth,. “Tools and techniques, Computer
Performance Evaluation”, Van Nostrand, New York, 1982.
CSY014 AGENT BASED INTELLIGENT SYSTEMS 3 0 0 3
Definitions – Foundations – History – Intelligent agents– Problem solving –Searching –

Heuristics –Constraint satisfaction problems – Game playing.
UNIT II KNOWLEDGE REPRESENTATION AND REASONING 9
Logical agents – First order logic – First order inference – Unification – Chaining –
Resolution strategies – Knowledge representation – Objects – Actions – Events.
UNIT III PLANNING AGENTS 9
Planning problem-State space search – Partial order planning – Graphs –

Nondeterministic domains – Conditional planning – Continuous planning – Multiagent
planning.
UNIT IV AGENTS AND UNCERTAINITY 9

Acting under uncertainty – Probability notation – Bayes rule and use – Bayesian
networks – Other approaches – Time and uncertainty–Temporal models– Utility theory
– Decision network – Complex decisions.
UNIT V HIGHER LEVEL AGENTS 9
Knowledge in learning – Relevance information – Statistical learning methods –

Reinforcement learning – Communication-Formal grammar – Augmented grammars –
Future of AI.
TOTAL = 45
REFERENCES
1. Stuart Russell and Peter Norvig, “Artificial Intelligence - A Modern Approach”, 2 nd

edition, Prentice Hall of India, 2002.
2. Michael Wooldridge, “An Introduction to Multi Agent System”, John Wiley
publications, 2002.
3. Patrick Henry Winston, “Artificial Intelligence”, 3 rd edition, Addison-Wesley
publications, 1999.
4. Nils.J.Nilsson, “ Principles of Artificial Intelligence”, Narosa Publishing House, 1992.
CSY015 COMPLEX NETWORKS 3 0 0 3
UNIT I TYPES AND PROPERTIES OF NETWORK 9
Social networks – Information networks – Technological networks – Biological networks

– Small world effect – transitivity and clustering – degree distribution – scale free
networks – Maximum degree – Network resilience – Mixing patterns – Degree
correlations – Community structures – Network navigation.
UNIT II RANDOM GRAPHS 9
Poisson random graphs – Generalized random graphs – The configuration model –

power – Law degree distribution – directed graph – bipartite graph – degree
correlations.
UNIT III MODELS OF NETWORK GROWTH 9
Price's model – Barabasi and Albert's model – Other growth models – Vertex copying
models.
UNIT IV PROCESSES TAKING PLACE ON NETWORKS 9

Percolation theory and network resilience – Epidemiological processes.
Search on networks – Exhaustive network search – Guided network search – Network

navigation– Network visualization.
TOTAL = 45
REFERENCES
1. S.N.Dorogovtsev and J.F.F.Mendes, “Evolution of Networks”, Oxford University

Press,2003.
2. Narsingh Deo, “Graph Theory With Applications To Engineering And Computer
Science”, Prentice Hall of India, 2007.
CSY016 COMPONENT BASED TECHNOLOGY 3 0 0 3
Software components – Objects – Fundamental properties of component technology

– Modules – Interfaces – Callbacks – Directory services – Component architecture –
Components and middleware.
UNIT II JAVA COMPONENET TECHNOLOGIES 9
Threads – Java Beans – Events and connections – Properties – Introspection – JAR

files – Reflection – Object serialization – Enterprise Java Beans – Distributed object
models – RMI and RMI-IIOP.
UNIT III CORBA TECHNOLOGIES 9
Java and CORBA – Interface definition language – Object request broker – System
object model – Portable object adapter – CORBA services – CORBA component model
– Containers – Application server – Model driven architecture.
UNIT IV COM AND .NET TECHNOLOGIES 9
COM – Distributed COM – object reuse – interfaces and versioning – dispatch

interfaces – connectable objects – OLE containers and servers – Active X controls–
.NET components – assemblies – appdomains – contexts – reflection remoting.
UNIT V COMPONENT FRAMEWORK AND DEVELOPMENT 9

Connectors – contexts – EJB containers – CLR contexts and channels – Black box
component framework – Directory objects – Cross-development environment–
Component-Oriented programming – Component design and Implementation tools –
Testing tools – Assembly tools.
TOTAL = 45
TEXTBOOK
1. Gruntz, “Component Software: Beyond Object–Oriented Programming “, Pearson

Education publishers, 2004.
REFERENCES
1. Ed Roman, “Enterprise Java Beans”, 3rd edition, Wiley publications, 2004.
CS Y017 I NTEGRATED SOFTWARE PROJECT MANAGEMENT 3 0 0 3
UNIT I PROJECT MANAGEMENT CONCEPTS 9
Evolution of software economics – Software management process framework (phases,

artifacts, workflows, checkpoints) – Software management disciplines (planning / project
organization and responsibilities / automation / project control) – Modern project
profiles.
UNIT II SOFTWARE ESTIMATION & COSTING 9
Problems in software estimation – Algorithmic cost estimation process – Function

points, SLIM (Software Life Cycle Management) – COCOMO II (Constructive Cost
Model) – Estimating web application development – Concepts of finance – Activity
based costing and Economic Value Added (EVA) – Balanced score card.
UNIT III RISK MANAGEMENT 9
Risk definition – Risk categories – Risk assessment (identification / analysis /

prioritization) – Risk control (planning / resolution / monitoring) – Failure Mode and
Effects Analysis (FMEA).
UNIT IV METRICS 9
Need for software metrics – Classification of software metrics – Product metrics (size
metrics, complexity metrics, Halstead’s product metrics, quality metrics) and Process
metrics (empirical models, statistical models, theory–based models, composite models,
and reliability models).
UNIT V PEOPLE MANAGEMENT 9
Team management – Client relationship management – Function organization – Project

organization – Matrix organization – Staffing quality replacement –Turnover
management.
TOTAL = 45
REFERENCES
1. McConnell, S. “Software Project: Survival Guide”, Microsoft Press, 1998.

2. Royce. W, “Software Project management: A Unified Framework”, Addison Wesley,
1998.
3. Cooper. R, “The Rise of Activity-Based Costing-Part One: What is an Activity-Based
Cost System?”, Journal of Cost Management, Vol.2, No.2 ,Summer, 1988.
4. Grant J.L, “Foundations of Economic Value Added”, John Wiley & Sons, 1997.
5. Kaplan R.S and Norton D.P, “The Balanced Scorecard: Translating Strategy into
Action”, Harvard Business School Press, 1996.
6. Boehm B. W, "Software Risk Management: Principles and Practices", IEEE
Software, 1991.
7. Fenton N.E, and Pfleeger S.L, “Software Metrics: A Rigorous and Practical
Approach, Revised”, Brooks Cole, 1998.
8. Demarco .T and Lister .T, “Peopleware: Productive Projects and Teams, 2 nd edition”,
Dorset House, 1999.
9. Bob Hughes and Mike Cotterell, “Software Project Management ”, 4 th edition, Tata
McGraw Hill Publishing Company Ltd., New Delhi,2005.
CSY018 DIGITAL IMAGE PROCESSING 3 0 0 3
UNIT I DIGITAL IMAGE FUNDAMENTALS 9
Elements of digital image processing systems – Elements of visual perception –

psycho visual model, brightness, contrast, hue, saturation, mach band effect – Color
image fundamentals – RGB,HSI models, Image sampling, Quantization, dither, Two –
dimensional mathematical preliminaries.
UNIT II IMAGE TRANSFORMS 9
1D DFT– 2D transforms – DFT– DCT –Discrete sine – Walsh – Hadamard – Slant–

Haar – KLT – SVD – Wavelet Transform.
UNIT III IMAGE ENHANCEMENT AND RESTORATION 9
Histogram modification and specification techniques – Noise distributions – Spatial

averaging – Directional smoothing – Median – Geometric mean – Harmonic mean –
Contra harmonic and Yp mean filters – Homo morphic filtering – Color image
enhancement. Image restoration – Degradation model – Unconstrained and constrained
restoration – Inverse filtering – Removal of blur caused by uniform linear motion –
Wiener filtering – Geometric transformations – Spatial transformations – Gray-level
interpolation.
UNIT IV IMAGE SEGMENTATION AND RECOGNITION 9
Edge detection – Image segmentation by region growing – Region splitting and merging
– Edge linking. Image recognition – Patterns and pattern classes – Matching by
minimum distance classifier – Matching by correlation – Back propagation neural
network– Neural network applications in image processing.
UNIT V IMAGE COMPRESSION 9
Need for data compression – Huffman – Run length encoding – Shift codes – Arithmetic
coding – Vector quantization –Block truncation coding – Transform coding – DCT and
Wavelet – JPEG – MPEG standards– Concepts of context based compression.
TOTAL = 45
REFERENCES
1. Rafael C. Gonzalez and Richard E. Woods, “Digital Image Processing”, Pearson

Education, Inc., 2nd edition, 2004.
2. Anil K. Jain, “Fundamentals of Digital Image Processing”, Prentice Hall of India,
2002.
3. David Salomon, “Data Compression – The Complete Reference”, Springer Verlag
New York Inc., 2nd Edition, 2001.
4. Rafael C. Gonzalez, Richard E. Woods and Steven Eddins, “ Digital Image
Processing using MATLAB ”, Pearson Education, Inc., 2004.
5. William K.Pratt, “Digital Image Processing”, John Wiley, New York, 2002.
6. Milman Sonka, Vaclav Hlavac and Roger Boyle, “Image Processing, Analysis, and
Machine Vision”, Brooks/Cole, Vikas Publishing House, 2nd edition, 1999.
7. Sid Ahmed,M.A., “Image Processing Theory, Algorithms and Architectures”, McGraw
Hill, 1995.
CSY019 RESEARCH METHODOLOGY FOR COMPUTER SCIENTIST 3 0 0 3
UNIT I RESEARCH PROBLEM 9
The Research problem – Sources of research problem – Information, how to deal with it –
Criteria / characteristics of a good research problem – Errors in selecting a good research
problem – Types of research – Nature and use of arguments.
UNIT II PROBABILITY, STATISTICAL INFERENCE AND ANALYSIS 9

Probability – Random variables – Binomial, Poisson, Geometric, Uniform, Normal, Exponential
distributions – Moments – Moments generating functions and their properties – Function of
random variables.
Design of experiments: Analysis of variance – One way and two way classifications–
Completely randomized design – Randomized block design – Latin square design –2 2 factorial
design.
UNIT III OPERATIONS RESEARCH AND OPTIMIZATION TECHNIQUES

9
Basic of operation research : Characteristic of OR -OR and Decision making –Linear

programming – Stimulation and Graphical solution canonical and standard terms of Linear
programming problem – Algebraic solution – Simplex method – Chranes method of penalties –
Concept of duality – properties of duality –Transportation model: Definition – Formulation and
solution of transportation models. Sequencing problems – Processing each of n jobs through m
machine. – Linear programming – Introduction to supervised and unsupervised learning – Graph
theory– Basic definitions – Connected graph – Tree.
UNIT IV QUEUEING THEORY 9
Single and Multiple server Markovian queueing models – Customer impatience –Queueing
applications.
UNIT V CASE STUDIES 9
Presentation by students on their area of research.
TOTAL = 45
TEXT BOOKS
1. Nicholas Walliman, ”Your Research Project”, 2nd edition, Vistaar Publications, New Delhi ,
2005.
2. Gupta, S.C. and Kapoor, V.K., “Fundamentals of Mathematical Statistics”, Sultan Chand and
Sons, New Delhi ,2001.
3. Taha, H.A., “Operations Research: An Introduction”, 7 th edition, Pearson Education Edition,
Asia, New Delhi, 2002.
REFERENCES
1. Walpole, R.E., Myer, R.H., Myer, S.L. and Ye, K., “Probability and Statistics for engineers
and Scientists”, 7th Edition, Pearson Education, Delhi (2002).
2. Goel, B.S. and Mittal, S.K, “Operations Research”, Pragati Prakashan, Meerut (2000)
3. Freund, J.E., and Miller, I.R., “Probability and Statistics for Engineers”, Prentics Hall of
India, Fifth Edition, New Delhi, 1994.
CSY020 REAL TIME SYSTEMS 3 0 0 3
Real time systems – Embedded systems – Pervasive computing – Information access

devices – Smart cards – Embedded controllers – Hardware fundamentals.
UNIT II RTOS 9
Real time operating systems – Memory management – Processes, threads, interrupts,

events – User interface.
UNIT III REAL TIME UML 9
Requirements analysis – Object identification strategies – Object behavior – Real-Time

design patterns.
UNIT IV SOFTWARE DEVELOPMENT 9
Concurrency – Exceptions – Tools – Debugging techniques – Optimization – Case

Studies.
UNIT V CONNECTIVITY 9
Wireless connectivity – Blue tooth – Other short range protocols – Wireless application
environment – Service discovery – Middleware.
TOTAL = 45
REFERENCES
1. R.J.A. Buhr, D.L.Bailey, “An Introduction to Real-Time Systems”, Prentice–Hall

International, 1999.
2. B.P.Douglass, “Real-Time UML”, 2nd edition, Addison-Wesley, 2000.
3. D.E. Simon, “An Embedded Software Primer ", Addison-Wesley, 1999.
4. J.Schiller, “Mobile Communications ", Addison-Wesley, 2000.
5. V.Hansmann, L.Merk, M.S. Nicklous and T.Stober, “Prevasive Computing
Handbook”, Springer, 2001.
CSY021 INFORMATION SECURITY 3 0 0 3
UNIT I
Security Attacks (interruption, interception, modification and fabrication) – Security
Services (confidentiality, authentication, integrity, non–repudiation, access control and
availability) and mechanisms – A model for Internet work security – Internet Standards
and RFCs – Buffer overflow & format string vulnerabilities – TCP session hijacking –
ARP attacks– Route table modification – UDP hijacking and man-in-the-middle attacks.
Security Models: Military and civil security– vulnerability and threat models– End-end
security (COMSEC) – Link encryption (TRANSEC) – Compartments – Privacy –
Authentication– Denial of service – Non repudiation.
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 Functions and HMAC. Public key cryptography
principles – Public key cryptography algorithms – Digital signatures – Digital
Certificates.
UNIT–III
Certificate authority and key management – Kerberos– X.509 directory authentication –

Service Email privacy: Pretty Good Privacy (PGP) and S/MIME– IP security overview–
IP security architecture – Authentication Header – Encapsulating security payload –
Combining security associations and Key management web security requirements.
UNIT–IV
Secure Socket Layer (SSL) and Transport Layer Security (TLS) – Secure Electronic
Transaction (SET) – Basic concepts of SNMP– SNMPv1 community facility and
SNMPv3 – Intruders, viruses and related threats.
UNIT V
Intruders, Viruses and related threats – Firewall design principles – Trusted systems –
Intrusion detection systems – Key and certificate management – Secure binding of
public and private values: DNS certificates – Making and distributing key media:
randomization, lifetime issues– Key agreement protocols: STS protocol and IETF work
orders– Key Escrow: the Clipper chip – One-time passwords: schemes based on
S/KEY– PKI.
TOTAL = 45
TEXT BOOKS
1. William Stallings, “Network Security Essentials (Applications and Standards)”,
2. Ryan Russell, Dan Kaminsky, Rain Forest Puppy, Joe Grand, David Ahmad, Hal
Flynn Ido Dubrawsky, Steve W.Manzuik and Ryan Permeh, “Hack Proofing your
network ”, 2nd edition, Syngress, 2002.
REFERENCES
1. Eric Maiwald, “Fundamentals of Network Security”, 1st edition, McGraw-Hill Osborne

Media, 2003.
2. Charlie Kaufman, Radia Perlman and Mike Speciner, “Network Security - Private
Communication in a Public World ”, Pearson Prentice Hall of India, 2004.
3. Michael E. Whitman ,”Principles of Information Security”, Thomson Business
Information, 2009
4. Stallings,”Cryptography and network Security”, 3 rd edition, Prentice Hall of India,
2004.
5. Robert Bragg and Mark Rhodes ,“Network Security: The complete reference”, Tata
Mgraw Hill, 2004
6. Buchmann ,”Introduction to Cryptography” , Apress / Springer (india) Pvt Ltd. , 2004
7. Schneier B., “Applied Cryptography - Protocols, Algorithms and Source Code in C”,
2nd edition, John Wiley and Sons, 1995.
CSY022 NETWORK PROCESSORS 3 0 0 3
Traditional protocol processing systems: – Network processing hardware – Basic packet

processing: Algorithms and data structures – Packet processing functions– Protocol
software – Hardware architectures for protocol processing – Classification and
forwarding – Switching fabrics.
UNIT II NETWORK PROCESSOR TECHNOLOGY 9
Network processors: Motivation and purpose – Complexity of network processor design

– Network processor architectures: Architectural variety, Architectural characteristics.
Peripheral chips supporting network processors: Storage processors - Classification
Processors – Search engines – Switch fabrics – Traffic managers.
UNIT III COMMERCIAL NETWORK PROCESSORS 9
Multi-Chip pipeline – Augmented RISC processor – Embedded processor plus

coprocessors – Pipeline of homogeneous processors – Configurable instruction set
processors – Pipeline of heterogeneous processors – Extensive and diverse processors
– Flexible RISC plus Coprocessors – Scalability issues – Design tradeoffs and
consequences.
UNIT IV NETWORK PROCESSOR: ARCHITECTURE AND PROGRAMMING CASE

STUDY 9
Architecture:
Intel network processor: Multithreaded architecture overview – Features –Embedded
RISC processor – Packet processor hardware – Memory interfaces – System and
Control interface components – Bus Interface.
Programming:
Software development kit – IXP instruction set – Register formats – Micro engine
programming – Intra thread and Inter-thread communication – Thread synchronization –
Developing sample applications – Strong-Arm programming.
UNIT V IOS TECHNOLOGIES 9
CISCO IOS – Connectivity and scalability – High availability – IP routing – IP services –

IPV6 – Mobile IP – MPLS – IP Multicast – Manageability – QoS –Security – Switching –
Layer 2 VPN2.
TOTAL = 45
TEXT BOOKS
1. Douglas E. Comer, “Network Systems Design using Network Processors”, Prentice

Hall of India, 2003.
2. Panos C Lekkas, “Network Processors : Architectures, Protocols and
Paradigms(Telecom Engineering) ”, Tata McGraw–Hill Professional, 2003.
REFERENCES
1. Patrick Crowley, M A Franklin, H Hadimioglu and PZ Onufryk, “Network Processor

Design, Issues and Practices Vol – I”, Morgan Kaufman, 2002.
2. Patrick Crowley, M A Franklin, H Hadimioglu and PZ Onufryk, “Network Processor
Design, Issues and Practices Vol – II”, Morgan Kaufman, 2003.
3. Erik J. Johnson and Aaron R. Kunze, “IXP1200 Programming: The Microengine
Coding Guide for the Intel IXP1200 Network Processor Family”, Intel Press, 2002.
4. Bill Carlson, “Intel® Internet Exchange Architecture & Applications A Practical Guide
to Intel's Network Processors”, Intel Press, 2003.
CSY023 MULTI–CORE ARCHITECTURE 3 0 0 3

Multi-core processor evolution – Moore’s law – Basic system and Multicore processor
architecture – Homogeneous and heterogeneous multicore – On-chip interconnect
architecture – Uniform and nonuniform memory access – Cache and cache coherence
– Multicore processors benchmark – Multicore processors OS module – AMP – SMP –
Virtualization–MIPC– Choosing multicore OS configuration.
UNIT II SCALABILITY ISSUES AND PARALLELISM 9
Scalable design principles – Principles of processor design – Instruction level

parallelism, Thread level parallelism – Parallel computer models – Symmetric and
distributed shared memory architectures – Performance issues – Software and
hardware multithreading – SMT and CMP architectures – Design issues – Case studies
– Intel Multi-core architecture – SUN CMP architecture.
UNIT III PARALLEL PROGRAMMING & OPENMP 10
Fundamental concepts – Designing for threads – Threading and parallel programming

constructs – Synchronization – Critical sections – Deadlock – Threading APIs openMP
–Thread Vs openMP – Threading a loop – Thread overheads – Performance issues –
Library functions – Solutions to parallel programming problems – Data races, deadlocks
and livelocks – Non-Blocking algorithms – Memory and cache related issues – OpenMP
API library calls based programs.
UNIT IV MPI PROGRAMMING 9
MPI model – MPI versions – Collective communication – Data decomposition –

Communicators and topologies – Point-to-point communication – Dynamic process
management – MPI library – MPI programs using Point-to-Point communication library
calls – Dervied data types – Topologies – Group communicator – Dense matrix
computations.
UNIT V MULTITHREADED APPLICATION DEVELOPMENT 9
Algorithms – Program development – Performance visualization tools – Characteristics–

Performance tuning –Tuning and Performance of programs based on Intel TBB – Matrix
computations and Numerical computations based on C++ programming.
TOTAL = 45
TEXT BOOKS
1. Kai Hwang and Faye A. Briggs, "Computer Architecture and Parallel Processing"
McGraw–Hill International, 1984
2. Kai Hwang, "Advanced Computer Architecture", Tata McGraw–Hill, 1993
3. Shameem Akhter and Jason Roberts, “Multi–core Programming”, Intel Press, 2006.
4. Michael J Quinn, “Parallel programming in C with MPI and OpenMP”, Tata McGraw
Hill, 2003.
REFERENCES
1. John L. Hennessey and David A. Patterson, “Computer Architecture - A Quantitative

Approach”, 4th edition, Morgan Kaufmann / Elsevier Publishers, 2007.
2. David E. Culler and Jaswinder Pal Singh, “Parallel Computing Architecture: A
Hardware/ Software Approach”, Morgan Kaufmann/Elsevier Publishers, 1999.
ECY081 VLSI DESIGN TECHNIQUES 3 0 0 3
UNIT I MOS TRANSISTOR THEORY AND PROCESS TECHNOLOGY 9
NMOS and PMOS transistors – Threshold voltage – Body effect – Design equations –
Second order effects – MOS models and small signal AC characteristics – Basic CMOS
technology.
UNIT II INVERTERS AND LOGIC GATES 9
NMOS and CMOS inverters – Stick diagram – Inverter ratio – DC and transient
characteristics – Switching times – Super buffers – Driving large capacitance loads –
CMOS logic structures – Transmission gates – Static CMOS design – Dynamic CMOS
design.
UNIT III CIRCUIT CHARACTERISATION AND

PERFORMANCE ESTIMATION 9
Resistance estimation – Capacitance estimation – Inductance – Switching

characteristics– Transistor sizing – Power dissipation and design margining – Charge
sharing – Scaling.
UNIT IV VLSI SYSTEM COMPONENTS CIRCUITS AND
SYSTEM LEVEL PHYSICAL DESIGN. 9
Multiplexers – Decoders – Comparators – Priority encoders – Shift registers – Arithmetic

circuits – Ripple carry adders – Carry look ahead adders – High-speed adders –
Multipliers – Physical design – Delay modelling – Cross talk – Floor planning – Power
distribution – Clock distribution – Basics of CMOS testing.
UNIT V VERILOG HARDWARE DESCRIPTION LANGUAGE 9
Overview of digital design with Verilog HDL– Hierarchical modelling concepts– Modules
and port definitions – Gate level modelling – Data flow modelling – Behavioral modelling
–Task & functions – Test bench.
TOTAL = 45
REFERENCES
1. Neil H.E. Weste and Kamran Eshraghian, “Principles of CMOS VLSI Design”,
Pearson Education ASIA, 2nd edition, 2000.
2. John P.Uyemura, “Introduction to VLSI Circuits and Systems”, John Wiley & Sons,
Inc., 2002.
3. Samir Palnitkar, “Verilog HDL”, Pearson Education, 2 nd edition, 2004.
4. Eugene D.Fabricius, “Introduction to VLSI Design”,McGraw Hill International
Editions, 1990.
5. J.Bhasker, “A Verilog HDL Primer”, 2nd edition, , B.S.Publications, 2001.
6. Pucknell, “Basic VLSI Design”, Prentice Hall of India Publication, 1995.
7. Wayne Wolf, “Modern VLSI Design System on chip”, Pearson Education,2002.
SPECIAL ELECTIVES
CSZ001 SPEECH RECOGNITION 3 0 0 3
UNIT I 9
Fundamentals of speech recognition – Introduction – Speech production process –

Speech in time and frequency domains – Speech sounds and features. Approaches to
automatic speech recognition.
UNIT II 9
Signal processing methods – Spectral analysis models – Speech recognition filter banks
– Linear productive coding model – Autocorrelation methods – Vector quantization –
Similarity or distance measures – Vector classification – Extensions of vector
quantization - Auditory based spectral analysis models. Pattern comparison
techniques – Distortion measures – Time alignment and normalization.
UNIT III 9
Speech recognition system design – Source coding techniques – Template training

methods – Clustering performance analysis – Effects of signal analysis parameters –
Hierarchical speech clustering – Discriminative methods – Discrete time marker process
– Hidden Marker models (HMM) – Autoregressive HMM – Implementation issues of
HMM – HMM system for isolated word recognition.
UNIT IV 9
Speech recognition of connected words – Two level dynamic programming – Level

building algorithms – One pass algorithm – Grammar networks – Segmented K-mean –
Sub word speech units – HMM application – Language models – Context dependent
sub word units.
UNIT V 9
Task oriented application – Automatic speech recognition – Application –

Characterization – Broad classification of speech recognition application – Command
and control application – Implementation techniques.
TOTAL = 45
REFERENCES
1. Lawrence Rabina, Biing-Harry Jnang and B.Yeghanarayanan, “Fundamentals of

Speech recognition ”, Pearson Education, Delhi, 2009.
2. Claudia Beccheltr and Klucio Prina Ricoth, “Speech Recognition”, Wisley student
edition, India, 2004.
CSZ002 LANGUAGE TECHONOLOGY 3003
Natural language processing – Linguistic background – Spoken language input and

output technologies – Written language input – Mathematical methods – Statistical
modeling and classification finite state methods grammar for natural language
processing – Parsing – Semantic and logic Form – Ambiguity resolution – Semantic
interpretation.
UNIT II INFORMATION RETRIEVAL 9
Information retrieval architecture – Indexing – Storage – Compression techniques –

Retrieval approaches – Evaluation – Search engines – Commercial search engine –
Features – Comparison – Performance measures – Document processing – NLP based
information retrieval – Information extraction.
UNIT III TEXT MINING 9
Categorization – Extraction based categorization – Clustering – Hierarchical clustering –

Document classification and Routing – Finding and organizing answers from text search
– Use of categories and clusters for organizing retrieval results – Text categorization
and efficient summarization using lexical chains – Pattern extraction.
UNIT IV GENERIC ISSUES 9
Multilinguality – Multilingual information retrieval and speech processing – Multimodality

– Text and images – Modality integration – Transmission and storage – Speech coding
– Evaluation of systems – Human factors and user acceptability.
Machine translation – Transfer metaphor – Interlingual and statistical approaches –

Discourse processing – Dialog conversational agents – Natural language generation –
Surface realization and discourse planning.
TOTAL= 45
TEXT BOOKS
1. Daniel Jurafsky And James H.Martin , “Speech and Language Processing” , Prentice
Hall , 2008.
2. Ron Cole and J.Mariani, “Survey of the state of the art in Human SSS language
technology”, Cambridge University Press, 1997.
3. Michal W. Berry, “Survey Of Text Mining : Clustering, Classification And Retrieval”
Springer Verlag, 2003.
4. Christopher D, Manning and Hinrich Schutze, “Foundations of Statistical Natural
Language Processing”, MIT Press, 1999.
REFERENCES
1. James Allen, “Natural Language Understanding “, Benjamin / Cummings Publishing

Co, 1995.
2. Gerald J. Kowalski and Mark .T.Marubury, “Information Storage and Retrieval
Systems”, Kluwer Academic Publishers, 2000.
3. Tomek Strzalkowski, “Natural Language Information Retrieval”, Kluwer Academic
Publishers, 1999.
CSZ002 GRAPHICS AND MULTIMEDIA 3 0 0 3
AIM
To impart the fundamental concepts of Computer Graphics and Multimedia.
OBJECTIVES
 To study the graphics techniques and algorithms.
 To study the multimedia concepts and various I/O technologies.
 To enable the students to develop their creativity
UNIT I OUTPUT PRIMITIVES 9

Introduction – Line – Curve and ellipse drawing algorithms – Attributes – Two-
dimensional geometric transformations – Two-Dimensional clipping and viewing.
UNIT II THREE-DIMENSIONAL CONCEPTS 9

Three-dimensional object representations – Three-dimensional geometric and modeling
transformations – Three-dimensional viewing – Color models – Animation.
UNIT III MULTIMEDIA SYSTEMS DESIGN 9

An Introduction – Multimedia applications – Multimedia system architecture – Evolving
technologies for multimedia – Defining objects for multimedia systems – Multimedia
data interface standards – Multimedia databases.
UNIT IV MULTIMEDIA FILE HANDLING 9

Compression & decompression – Data & file format standards – Multimedia I/O
technologies –Digital voice and audio – Video image and animation – Full motion video
– Storage and retrieval technologies.
UNIT V MULTIMEDIA APPLICATION AND HYPERMEDIA 9

Multimedia authoring & User interface – Hypermedia messaging - Multimedia
communication system – Hypermedia message component – Presentation
requirements – Video on demand – Interactive video – Distributed multimedia systems.
TOTAL = 45
TEXT BOOKS
1. Donald Hearn and M.Pauline Baker, “Computer Graphics C Version”, Pearson
Education, 2003
2. Prabat K Andleigh and Kiran Thakrar, “Multimedia Systems and Design”, PHI, 2003.
REFERENCES
1. Judith Jeffcoate, “Multimedia in practice technology and Applications”, PHI, 1998.
2. Foley, Vandam, Feiner and Huges, “Computer Graphics: Principles & Practice”,
Pearson Education, 2nd edition, 2003.
CSZ004 HACKING TECHNIQUES AND DIGITAL FORENSICS 3003
UNIT I 9
Problem factors – Defense mechanisms – Handling user access – User input –
Handling attackers – Managing the application – Web application technologies – The
HTTP protocol – Web functionality – Encoding schemes.
UNIT II 9
Mapping the application – Bypassing client side control – Transmitting data via the
Client – Capturing user data , HTML forms and thick-client components – Active X
controls – Prevention – Attacking authentication – Design flaws in authentication –
Implementation flaws in authentication – Prevention – Attacking session management –
Weakness in session management generation and handling – Its prevention – Attacking
access control – Common vulnerabilities – Its prevention – Code injection – Injection
into SQL, OS commands, web scripting techniques, SOAP, XPath, SMDP, LDAP –
Attacking path traversal – Finding and exploiting path traversal vulnerabilities – Its
prevention – Attacking application logic – Logic flaws – Attacking other users – XSS –
Redirection attacks – HTTP header injection – Frame injection– Request forgery– JSON
hijacking – Session fixation – Local privacy attacks –Advanced exploiting techniques –
Its prevention.
UNIT III 9
Burp proxy – Automating bespoke attacks – Uses for bespoke automation –

Enumerating valid identifier – Fuzzing common vulnerabilities – Its prevention-
Exploiting information disclosure – Exploiting error message – Its prevention –
Attacking compiled application – Buffered overflow attacks – Integer and format string
vulnerabilities – Its prevention – Architectural attacks – Tiered architecture – Shared
hosting and Application service providers – Its prevention – Server attack – Vulnerable
application configuration and Software – Source code vulnerabilities – Different
languages– Its prevention.
UNIT IV 9
Hacker’s toolkit – Web browsers – Integrated testing suites – Vulnerability scanners –

Nikto-hydra-custom Scripts – Hacker’s methodology – Mapping application content –
Analyzing application-testing – Client side controls – Authentication mechanism –
Session management mechanism – Access controls – Input based vulnerabilities–
Logic flaws– Sharing hosting vulnerabilities– Web server vulnerabilities– Miscellaneous
checks.
UNIT V 9
Security tools and services – Time-based one-time passwords – Challenge/response

one-time password – Lamport’s one-time password algorithm – Smart cards – RADUIS
– SASl – Host-to-host authentication – PKI - Firewalls –Kinds of firewalls- Filtering
services – Firewall engineering – Tunneling and VPNs – Secure communications over
insecure networks – Kerberos authentication system – Link level encryption – Network
level encryption – Application-level Encryption - Hidden markov model.
TOTAL = 45
REFERENCES
1. Dafydd Stuttard and Marcus Pinto, “The Web Application Hacker's Handbook:
Discovering and Exploiting Security Flaws” , Wiley Publications,2007.
2. William R.Cheswick, Steven M. Bellovin and Aviel D.Rubin, “Firewalls and
Internet Security – Repelling the Wily hacker”, Pearson Education, 2008.
Ad Hoc Wireless Networks: Architectures and Protocols

 By C. Siva Ram Murthy, B.S. Manoj
 Published May 24, 2004 by Prentice Hall. Part of the Prentice Hall Communications Engineering and Emerging
Technologies Series series.
o Copyright 2004
o Dimensions: 7x9-1/4
o Pages: 880
o Edition: 1st
o Book
o ISBN-10: 0-13-147023-X
o ISBN-13: 978-0-13-147023-1
o eBook
o ISBN-10: 0-13-246574-4
o ISBN-13: 978-0-13-246574-8
Register your product to gain access to bonus material or receive a coupon.

M.Tech (Computer Science and Engineering) (Four Semesters / Full Time) Curriculum

Uploaded by

Document Informationclick to expand document information

Document Informationclick to expand document information

Copyright:

Available Formats

M.Tech (Computer Science and Engineering) (Four Semesters / Full Time) Curriculum

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

M.Tech (Computer Science and Engineering) (Four Semesters / Full Time) Curriculum

Uploaded by

Copyright:

Available Formats

M.

Tech (COMPUTER SCIENCE AND ENGINEERING)

(With effect from 2010)

4 CS610 Grid Computing 3 0 0 3

1 CS701 High Speed Networks 3 0 0 3

1 CS703 Project – Phase I 0 0 12 0*

LIST OF ELECTIVE COURSES

1 CSY001 Theory of Computation 3 0 0 3

MA 611 MATHEMATICAL FOUNDATIONS OF

UNIT I FUNDAMENTAL STRUCTURES 9

Propositional logic – Logical connectives – Truth tables – Normal form (conjunctive

UNIT III COMBINATORICS 9

Basics of counting – Counting arguments – Pigeonhole principle – Permutations and

UNIT IV ALGEBRAIC STRUCTURES 9

Introduction – Properties of an algebraic system – Morphisms –Semigroups and

UNIT V MODELING COMPUTATION AND LANGUAGES 9

Finite state machines – Deterministic and Non–deterministic finite state machines –

1. Judith L.Gersting, “Mathematical Structures for Computer Science”, 5 th edition,

1. J.P.Tremblay and R.Manohar, “Discrete Mathematical Structures with Applications

CS601 COMPUTER ARCHITECTURE 3 1 0 3

UNIT I FUNDAMENTALS OF COMPUTER DESIGN 9

Measuring and reporting performance – Quantitative principles of computer

UNIT II INSTRUCTION LEVEL PARALLELISM 9

Pipelining and hazards – Concepts of ILP – Dynamic scheduling – Dynamic hardware

UNIT III INSTRUCTION LEVEL PARALLELISM WITH

UNIT IV MEMORY AND I/O 9

UNIT V MULTIPROCESSORS AND THREAD LEVEL PARALLELISM 9

Symmetric and distributed shared memory architectures – Performance issues –

1. John L. Hennessey and David A. Patterson,“ Computer Architecture: A Quantitative

1. D.Sima, T. Fountain and P. Kacsuk, “Advanced Computer Architectures: A Design

CS602 DATA STRUCTURES AND ANALYSIS OF ALGORITHMS 3 0 2 4

UNIT I GENERAL CONCEPTS AND LINEAR DATA STRUCTURES 12

UNIT III HASHING AND SORTING 8

Hash functions – Collision resolution – Expected behavior – Elementary sorts:

UNIT IV ALGORITHM DESIGN TECHNIQUES 8

CS603 OPERATING SYSTEMS 3 0 2 4

Main frame systems, Desktop systems – Multiprocessor systems – Distributed systems

UNIT II PROCESS MANAGEMENT 11

Process concepts – Process scheduling – Operation on process – Co–Operating

UNIT III MEMORY MANAGEMENT 9

UNIT IV FILE SYSTEMS 9

UNIT V DISTRIBUTED OPERATING SYSTEM 9

1. Silberschatz, Galvin and Gagne, “Operating System Concepts”, 6 th edition, 2003.

1. Andrew S. Tanenbaum, “Modern Operating Systems”, Prentice Hall of India, 2 nd

UNIT I SOFTWARE PROCESS 11

A generic view of processes – Process maturity – Process models – Agile process –

UNIT II REQUIREMENT ANALYSIS 6

System engineering hierarchy – Requirement engineering: Tasks, Initiating the process,

UNIT III SOFTWARE DESIGN 8

Design concepts – Design models – Pattern based design – Architectural design –

UNIT IV SOFTWARE TESTING 7

UNIT V SOFTWARE QUALITY ASSURANCE 13

Software quality concepts – Quality assurance – Software technical reviews – Formal

1. Roger S. Pressman, “Software Engineering: A Practitioner’s Approach”, 6 th edition,

1. I.Sommerville, “Software Engineering”, 5 th edition, Addison Wesley, 1996.

CS605 COMPUTER NETWORKS AND MANAGEMENT 3 0 2 4

UNIT I COMPUTER NETWORKS AND THE INTERNET 9