ANNA UNIVERSITY - COIMBATORE – 13

CURRICULUM - 2007
POST GRADUATE PROGRAMME
Branch : M.E. (COMPUTER SCIENCE AND ENGINEERING)

SEMESTER – I (FULL- TIME)

Subject
Subject Name L T P M
Code
THEORY
07CS101 Theoretical Foundations of Computer Science 3 1 0 100
07CS102 Advanced Computer Architecture 3 1 0 100
07CS103 Data Structures and Algorithms 3 0 0 100
07CS104 Operating Systems 3 0 0 100
07CS105 Software Engineering Methodologies 3 0 0 100
07CS106 Computer Networks 3 0 0 100
PRACTICALS
07CS107 Data Structures Laboratory 0 0 3 100
TOTAL 18 2 3 700

SEMESTER – I (PART - TIME)

Subject
Subject Name L T P M
Code
THEORY
07CS101 Theoretical Foundations of Computer Science 3 1 0 100
07CS102 Advanced Computer Architecture 3 1 0 100
07CS103 Data Structures and Analysis of Algorithms 3 0 0 100
07CS104 Operating Systems 3 0 0 100
07CS105 Software Engineering Methodologies 3 0 0 100
PRACTICALS
07CS107 Data Structures Laboratory 0 0 3 100
TOTAL 15 2 3 600
 L T P M
07CS101 THEORETICAL FOUNDATIONS OF COMPUTER SCIENCE
3 1 0 100

UNIT – I FUNDAMENTAL STRUCTURES (12)

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 (12)

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 (12)

Basics of counting – Counting arguments – Pigeonhole principle – Permutations and
Combinations – Recursion and Recurrence relations – Generating functions.

UNIT – IV MODELING COMPUTATION AND LANGUAGES (12)

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 (12)
Finite probability – Conditional Probability – Independence – Bayes’ theorem –
Mathematical expectation – Probability Distribution (Binomial, Poisson, Geometric
and their Properties).
Lecture 45 Tutorial 15 Total 60
Reference Books
1 Judith L.Gersting, “Mathematical Structures for Computer Science”, W.H.
Freeman and Company, NY, 2006.
2 Kenneth H. Rosen, “Discrete Mathematics and its Applications”, Fifth Edition,
TMH, 2003.
3 M.K. Venkataraman, N. Sridharan and N.Chandrasekaran,“ Discrete Maths.”,
The National Publishing Company, 2003.
4 Kishore S Trivedi, “Probability and statistics with reliability, Queing and
computer science applications”, PHI, 2006.
 L T P M
07CS102 ADVANCED COMPUTER ARCHITECTURE
3 1 0 100

UNIT – I FUNDAMENTALS OF COMPUTER DESIGN (12)

Introduction-measuring and reporting performance- Quantitative principles of
computer design-Instruction set principles and examples- classifying instructions- set
architectures-memory addressing-addressing modes for signal processing-type and
size of operands.

UNIT – II INSTRUCTION LEVEL PARALLELISM (12)

Concepts and challenges – overcoming data hazards with dynamic scheduling –
examples- reducing branch costs with dynamic hardware prediction- high
performance instruction delivery- taking advantages of ILP with multiple issues-
limitations of ILP.

UNIT – III ILP WITH SOFTWARE APPROACHES (12)

Basic compiler techniques for exposing ILP- static branch prediction- static multiple
issues: VLIW approach- Advanced compiler support for exposing and exploiting ILP-
Hardware support-cross cutting issues- Intel IA64 architecture.

UNIT – IV MEMORY HIERARCHY DESIGN (12)

Introduction- review of caches- cache performance- reducing cache miss penalty-
reducing miss rate- miss rate via parallelism –reducing hit time – main memory and
organizations for improving performance- memory technology- virtual memory.
UNIT – V MULTIPROCESSORS AND THREAD LEVEL PARALLELISM (12)
Symmetric shared memory architectures-performance of symmetric shared memory
multiprocessors – Distributed shared memory architectures-synchronization- storage
systems – types of storage devices- buses- reliability-availability and dependability-
RAID – errors and failures in real systems- IO performance measures- Introduction
to queuing theory.
Lecture 45 Tutorial 15 Total 60
Reference Books
1 John L. Hennessey and David A. Patterson,”Computer Architecture: A
Quantitative Approach”, Morgan Kaufmann, 2006.
2 D. Sima, T. Fountain and P. Kacsuk, “ Advanced Computer Architectures: A
Design Space Approach”, Addison Wesley, 2000.
3 Kai Hwang “Advanced Computer Architecture: Parallelism, Scalability,
Programmability” Tata McGraw Hill Edition, 2001.
 L T P M
07CS103 DATA STRUCTURES ALGORITHMS
3 0 0 100
(Common to Computer Science & Engineering and Information Technology)

UNIT – I INTRODUCTION (9)

Basic concepts of OOPs – Templates – Fundamentals of Analysis of Algorithm

Efficiency – ADT – List (Singly, Doubly and Circular) Implementation – Array,
Pointer.

UNIT – II BASIC DATA STRUCTURES (9)

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 (9)

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

Graphs – Directed Graphs – Shortest Path Problem – Undirected Graph – Spanning
Trees – Graph Traversals.

UNIT – IV SEARCHING AND SORTING (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

UNIT – V ALGORITHM DESIGN TECHNIQUES (9)

Design Techniques – Divide and Conquer – Dynamic Programming – Greedy

Algorithm – Backtracking – Local Search Algorithms

Total 45
Reference Books

1 Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, 3rd edition,
Pearson Education, 2007.
2 A. Levitin, “Introduction to The Design and Analysis of Algorithms “, 2nd edition,
Addison Wesley, 2007.
3 Tanenbaum A.S., Langram Y and Augestien M.J., ”Data Structures using C &
C++”, Prentice Hall of India, 2002
4 Aho, Hopcroft, Ullman, “Data Structures and Algorithms”, Pearson Education,
2002.
5 Horowitz, Sahni, Rajasekaran, “Computer Algorithms”, Galgotia, 2000
 L T P M
07CS104 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. Buddy Systems – Storage Compaction.

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
Reference Books

1 Avi Silberschatz, P.B.Galvin, G.Gagne “Operating System Concepts” seventh

edition, John Wiley & Sons, 2007.
2 Pradeep K.Sinha, “Distributed Operating System: Concepts and Design”, IEEE
computer Society Press, PHI, 2004.
3 Andrew S. Tanenbaum , “Modern Operating Systems”, PHI , 2nd Edition, 2001
 L T P M
07CS105 SOFTWARE ENGINEERING METHODOLOGIES
3 0 0 100

UNIT – I PROCESS AND PROJECT MANAGEMENT (9)

Software Process models – process iteration – process activities – rational unified

process – computer aided software engineering. Management activities – project
planning – project scheduling – risk management.

UNIT – II REQUIREMENT ANALYSIS (9)

Functional and Non – functional requirements – user requirements – system

requirements – interface specifications – software requirements document.
Requirements engineering processes – feasibility studies – elicitation and analysis –
validations – management. System Models – Context – Behavioural – Data – Object
– Structured.

UNIT – III SOFTWARE DESIGN (9)

Architectural Design – Distributed System Architectures – Application Architectures –

Object Oriented Design – Real-time Software Design.

UNIT – IV SOFTWARE TESTING (9)

Software testing fundamentals – Test Case Design – White Box – Basis Path
Testing – Control Structure Testing – Black Box – Testing for Specialized
environments, Architectures and Applications - Software Testing Strategies –
Approach – issues – testing – unit – integration – validation – system – art of
debugging.

UNIT – V SOFTWARE QUALITY ASSURANCE (9)

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 – configuration item – process – objects in the software configuration –
version control – change control – configuration audit – status reporting – SCM
Standards – Case study : Martha Stockton Greengage (MSG) foundations.

Total 45
Reference Books

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

Edition, McGraw Hill, 2005.
2 I.Sommerville, “Software Engineering”, 5th Edition, Addison Wesley, 1996.
 L T P M
07CS106 COMPUTER NETWORKS
3 0 0 100
(Common to Computer Science & Engineering and Software Engineering)

UNIT - I COMPUTER NETWORKS AND INTERNET (9)

Internet – Network edge – network core – access networks and physical media – ISP
and Internet Backbones – delay and loss in packet switched network – protocol
layers and service models.

UNIT - II APPLICATION LAYER (9)

Principles of network application – web and HTTP – FTP – e-mail – DNS – P2P file
sharing – Socket Programming with TCP and UDP.

UNIT - III TRANSPORT LAYER (9)

Introduction and Transport layer services – multiplexing and de-multiplexing –

connection less transport – principles of reliable data transfer – connection oriented
transfer – principles of congestion control – TCP congestion control.

UNIT - IV NETWORK LAYER (9)

Introduction – Virtual circuits and Datagram networks – routers – internet protocol –

forwarding and addressing in the internet – routing algorithms – routing in the
internet – broadcast and multicast routing. – link layer – introduction and services –
error detection and correction techniques – multiple access protocols - link layer
addressing.

UNIT - V MULTIMEDIA AND NETWORKING (9)

Streaming stored audio and video – best of the best effort service – protocol for real
time interactive applications – network management – infrastructures – internet
standards management framework.

Total 45
Reference Books

1 James F. Kurose, Keith W. Ross, “Computer Networking – A top down Approach

Featuring the Internet” ,Third Edition, Pearson Education, 2006
2 Behrouz A. Foruzan, “Data communication and Networking”, Tata McGraw Hill,
2004.
3 William Stallings, “Data and Computer Communication”, Sixth Edition, Pearson
Education, 2000.
 PRACTICALS

L T P M
07CS107 DATA STRUCTURES LABORATORY
0 0 3 100

LIST OF EXPERIMENTS

1 Implementation of List (Single, Double, Circular).

2 Implementation of Stack

3 Implementation of Queue.

4 Implementation of Searching Techniques (any three)

5 Implementation of Sorting Techniques ( any Three)

6 Implementation of Hash table

7 Implementation of Heaps

8 Implementation of AVL Rotations

9 Implementation of Prim’s Algorithm.

10 Implementation of Breadth First Search Techniques.

11 Implementation of Depth First Search Techniques.

12 Implementation of Dijkstra’s Algorithm.

13 Implementation of Kruskal’s Algorithm.