ANNA UNIVERSITY: CHENNAI – 600 025

M.E.COMPUTER SCIENCE AND ENGINEERING

CURRICULUM 2005 - FULL TIME MODE

SEMESTER – I

Code No. Course Title L T P M

TheoryMA1617 Mathematical Foundations of Computer Science 3 1 0 100CS1601 Computer Architecture 3 1 0 100CS1602 Data Structures and Algorithms 3 0 0 100CS1603 Operating Systems 3 0 0 100CS1604 Software Engineering Methodologies 3 1 0 100Practical CS1605 Data Structures Lab 0 0 3 100CS1606 Operating System Lab 0 0 3 100

SEMESTER – II*

Code No. Course Title L T P M

TheoryData Base Technology 3 0 0 100Computer Networks 3 0 0 100Advanced System Software 3 0 0 100Object Oriented System Design 3 0 0 100Web Technology 3 0 0 100

E1*** Elective I 3 0 0 100Practical

Networking Lab 0 0 3 100Database & Web Technology Lab 0 0 3 100

*Syllabi for II Semester courses will be published later

SEMESTER – III

Code No. Course Title L T P M

TheoryE2*** Elective II 3 0 0 100E3*** Elective III 3 0 0 100E4*** Elective IV 3 0 0 100

PracticalProject Work (Phase I) 0 0 12 *

SEMESTER – IV

Code No. Course Title L T P M

Project Work (Phase II) 0 0 24 ** As per Regulations 2005

LIST OF ELECTIVES FOR M.E.COMPUTER SCIENCE AND ENGINEERING*

Code No. Course Title L T P M

Theory of Computation 3 0 0 100Soft Computing 3 0 0 100Mobile Computing 3 0 0 100Distributed Computing 3 0 0 100Multimedia Systems 3 0 0 100XML and Web Services 3 0 0 100Bio Informatics 3 0 0 100Grid Computing 3 0 0 100Network Security 3 0 0 100Embedded Systems 3 0 0 100Digital Imaging 3 0 0 100Software Quality Assurance 3 0 0 100Adhoc Networks 3 0 0 100Data Mining and Data Warehousing 3 0 0 100Performance Evaluation of Computer Systems and Networks

3 0 0 100

Agent Based Intelligent Systems 3 0 0 100Visualization Techniques 3 0 0 100Advanced Databases 3 0 0 100Software Project Management 3 0 0 100Component Based Technology 3 0 0 100

*Syllabi for elective courses will be published later

MA1617 MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 3 1 0 100

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 forms ( 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: 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

UNIT – V : DISCRETE PROBABILITY 9

Finite probability - Probability distributions - Conditional Probability – Independence -

Bayes’ theorem - Mathematical expectation.

L -45 T-15 Total -60 TEXTBOOK

1. Judith L.Gersting, “Mathematical Structures for Computer Science”, Fifth Edition, W.H. Freeman and Company, NY, 2003.

REFERNCES1. 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”, Fifth 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.

CS1601 COMPUTER ARCHITECTURE 3 1 0 100

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 Microarchitecture

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.

L- 45 T-15 Total - 60

TEXTBOOK

1. John L. Hennessey and David A. Patterson," Computer Architecture: A Quantitative Approach", Third Edition, Morgan Kaufmann, 2003.

REFERNCES1. 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 Edition 2001.3. Vincent P.Heuring, Harry F.Jordan, “ Computer System Design and Architecture”

, Addison Wesley , 2nd Edition 2004.

CS1602 DATA STRUCTURES AND ALGORITHMS 3 0 0 100

UNIT I INTRODUCTION 8

Basic concepts of OOPs – Templates – Algorithm Analysis – ADT - List (Singly, Doubly

and Circular) Implementation - Array, Pointer, Cursor Implementation

UNIT II BASIC DATA STRUCTURES 11

Stacks and Queues – ADT, Implementation and Applications - Trees – General, Binary,

Binary Search, Expression Search, AVL, Splay, B-Trees – Implementations - Tree

Traversals.

UNIT III ADVANCED DATA STRUCTURES 10

Set – Implementation – Basic operations on set – Priority Queue – Implementation -

Graphs – Directed Graphs – Shortest Path Problem - Undirected Graph - Spanning Trees

– Graph Traversals

UNIT IV MEMORY MANAGEMENT 7

Issues - Managing Equal Sized Blocks - Garbage Collection Algorithms for Equal Sized

Blocks - Storage Allocation for Objects with Mixed Sizes - Buddy Systems - Storage

Compaction

UNIT V SEARCHING, SORTING AND DESIGN TECHNIQUES 9

Searching Techniques, Sorting – Internal Sorting – Bubble Sort, Insertion Sort, Quick

Sort, Heap Sort, Bin Sort, Radix Sort – External Sorting – Merge Sort, Multi-way Merge

Sort, Polyphase Sorting - Design Techniques - Divide and Conquer - Dynamic

Programming - Greedy Algorithm – Backtracking - Local Search Algorithms

Total No. of Periods : 45

TEXTBOOKS

1. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, Pearson Education, 2002.

2. Aho, Hopcroft, Ullman, “Data Structures and Algorithms”, Pearson Education, 2002.

REFERNCES

1. Horowitz, Sahni, Rajasekaran, “Computer Algorithms”, Galgotia, 20002. Tanenbaum A.S., Langram Y, Augestien M.J., ”Data Structures using C & C++”,

Prentice Hall of India, 2002

CS1603 OPERATING SYSTEMS 3 0 0 100

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 No. of Periods: 45

TEXTBOOKS

1. Silberschatz, Galvin, Gagne “ Operating System Concepts” Sixth Edition, 2003 2. Pradeep K.Sinha, “ Distributed OS concepts and Design ”, IEEE computer

Society Press, PHI 1998.

REFERENCES

1. Andrew S. Tanenbaum , “Modern Operating Systems”, PHI , 2nd Edition 20012. 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.

CS1604 SOFTWARE ENGINEERING METHODOLOGIES 3 1 0 100

UNIT I 11

A Generic View Of Processes – Process Maturity – Process Models – Agile Process And

Models – 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 – Test Documentation.

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 & Reengineering – Use of CASE Tools

L -45 T-15 Total - 60

TEXTBOOKS

1. Roger S. Pressman., Software Engineering: A Practitioner’s Approach (Sixth

Edition), McGraw Hill, 2005.

2. I.Sommerville, Software Engineering, V Edition: Addison Wesley, 1996.

REFERNCES

1. Pankaj Jalote- An Integrated Approach to Software Engineering, Springer Verlag, 1997.

2. James F Peters and Witold Pedryez, “Software Engineering – An Engineering Approach”, John Wiley and Sons, New Delhi, 2000.

3. Fairely, “Software Engineering Concepts”, McGraw Hill, 1995

CS1605 DATA STRUCTURES LABORATORY 0 0 3 100

1. Implementation of Singly ,Doubly and Circular linked list .

2. Implementation of Multistack in a Single Array.

3. Implementation of Circular Queue.

4. Implementation of Binary Search trees.

5. Implementation of Hash table.

6. Implementation of Heaps.

7. Implementation of AVL Rotations.

8. Implementation of Breadth First Search Techniques.

9. Implementation of Depth First Search Techniques.

10. Implementation of Prim’s Algorithm.

11. Implementation of Dijkstra’s Algorithm.

12. Implementation of Kruskal’s Algorithm

13. Implementation of Searching Techniques

14.Implementation of Sorting Techniques

CS1606 OPERATING SYSTEM LABORATORY 0 0 3 100

1. Implement the following CPU Scheduling Algorithms.

i) FCFS ii) Round Robin iii) Shortest Job First .

2. Implement the Mutual Exclusion Problem Using Dekker’s Algorithm.

3. Implement Inter Process Communication Problem (Producer-Consumer /

Reader- Writer Problem ) Using Semaphores.

4. Implement Best fit, First Fit Algorithm for Memory Management.

5. Implement Memory Allocation with Pages.

6. Implement FIFO page Replacement Algorithm.

7. Implement LRU page Replacement Algorithm.

8. Implement the creation of Shared memory Segment.

9. Implement File Locking.

10. Implement Banker’s algorithm.