AFFILIATED INSTITUTIONS

ANNA UNIVERSITY OF TECHNOLOGY CHENNAI

CHENNAI 600 113
REGULATIONS - 2010
CURRICULUM AND SYLLABUS FOR I SEMESTER (FULL TIME)
M.E.COMPUTER SCIENCE AND ENGINEERING
SEMESTER I

SL. COURSE
NO CODE COURSE TITLE L T P C
THEORY
1 281110 Operations Research 3 1 0 4
2 241101 Computer Architecture 3 0 0 3
3 241102 Data Structures and Algorithms 3 0 0 3
4 243101 Object Oriented Software Engineering 3 0 0 3
5 241103 Computer Networks and Management 3 0 0 3
PRACTICAL
6 241151 Data Structures Lab 0 0 3 2
7 241152 Network ing Lab 0 0 3 2
TOTAL 15 1 6 20
281110 OPERATIONS RESEARCH
LTPC
3 104
UNIT I QUEUEING MODELS 9
Poisson Process – Markovian Queues – Single and Multi-server Models – Little’s formula –
Machine Interference Model – Steady State analysis – Self Service Queue.

UNIT II ADVANCED QUEUEING MODELS 9

Non- Markovian Queues – Pollaczek Khintchine Formula – Queues in Series – Open Queueing
Networks –Closed Queueing networks.

UNIT III SIMULATION 9

Discrete Even Simulation – Monte – Carlo Simulation – Stochastic Simulation – Applications to
Queueing systems.

UNIT IV LINEAR PROGRAMMING 9

Formulation – Graphical solution – Simplex method – Two phase method - Transportation and
Assignment Problems.

UNIT V NON-LINEAR PROGRAMMING 9

Lagrange multipliers – Equality constraints – Inequality constraints – Kuhn - Tucker conditions
– Quadratic Programming.

L + T: 45+15 =60
TEXT BOOKS:

1. Winston.W.L. “Operations Research”, Fourth Edition, Thomson – Brooks/Cole, 2003.

2. Taha, H.A. “Operations Research: An Introduction”, Ninth Edition, Pearson Education
Edition, Asia, New Delhi, 2002.

REFERENCES:

1. Robertazzi. T.G. “Computer Networks and Systems – Queuing Theory and Performance
Evaluation”, Third Edition, Springer, 2002 Reprint.
2. Ross. S.M., “Probability Models for Computer Science”, Academic Press, 2002.
241101 COMPUTER ARCHITECTURE LT PC
3 0 0 3

UNIT I FUNDAMENTALS OF COMPUTER DESIGN AND PIPELINING 9

Fundamentals of Computer Design – Measuring and reporting performance – Quantitative

principles of computer design. Instruction set principles – Classifying ISA – Design issues.
Pipelining – Basic concepts – Hazards – Implementation – Multicycle operations.

UNIT II INSTRUCTION LEVEL PARALLELISM WITH DYNAMIC APPROACHES 9

Concepts – Dynamic Scheduling – Dynamic hardware prediction – Multiple issue – Hardware
based speculation – Limitations of ILP – Case studies.

UNIT III INSTRUCTION LEVEL PARALLELISM WITH SOFTWARE APPROACHES 9

Compiler techniques for exposing ILP – Static branch prediction – VLIW – Advanced
compiler support – Hardware support for exposing more parallelism – Hardware versus
software speculation mechanisms – Case studies.

UNIT IV MULTIPROCESSORS AND MULTICORE ARCHITECTURES 9

Symmetric and distributed shared memory architectures – Performance issues –
Synchronisation issues – Models of memory consistency – Software and hardware
multithreading – SMT and CMP architectures – Design issues – Case studies.

UNIT V 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
an I/O system.

TOTAL : 45 PERIODS

REFERENCES:

1. John L. Hennessey and David A. Patterson, “ Computer Architecture – A quantitative

th
approach”, Morgan Kaufmann / Elsevier, 4 . edition, 2007.
2. David E. Culler, Jaswinder Pal Singh, “Parallel Computing Architecture : A hardware/
software approach” , Morgan Kaufmann / Elsevier, 1997.
3. William Stallings, “ Computer Organization and Architecture – Designing for
Performance”, Pearson Education, Seventh Edition, 2006.
4. Behrooz Parhami, “Computer Architecture”, Oxford University Press, 2006.
241102 DATA STRUCTURES AND ALGORITHMS
LTPC
3003
UNIT I COMPLEXITY ANALYSIS & ELEMENTARY DATA STRUCTURES 9
Asymptotic notations – Properties of big oh notation – asymptotic notation with several
parameters – conditional asymptotic notation – amortized analysis – NP-completeness – NP-
hard – recurrence equations – solving recurrence equations – arrays – linked lists – trees.
UNIT II HEAP STRUCTURES 9
Min-max heaps – Deaps – Leftist heaps –Binomial heaps – Fibonacci heaps – Skew heaps -
Lazy-binomial heaps.

UNIT III SEARCH STRUCTURES 9

Binary search trees – AVL trees – 2-3 trees – 2-3-4 trees – Red-black trees – B-trees –
splay trees – Tries.

UNIT IV GREEDY & DIVIDE AND CONQUER 9

Quicksort – Strassen’s matrix multiplication – Convex hull - Tree-vertex splitting – Job
sequencing with deadlines – Optimal storage on tapes

UNIT V DYNAMIC PROGRAMMING AND BACKTRACKING 9

Multistage graphs – 0/1 knapsack using dynamic programming – Flow shop scheduling – 8-
queens problem – graph coloring – knapsack using backtracking

TOTAL : 45 PERIODS

REFERENCES:

1. E. Horowitz, S.Sahni and Dinesh Mehta, Fundamentals of Data structures in C++,

Galgotia, 1999.
2. E. Horowitz, S.Sahni and S. Rajasekaran, Computer Algorithms / C++, Galgotia, 1999.
3. Adam Drozdex, Data Structures and algorithms in C++, Second Edition,
Thomson learning – vikas publishing house, 2001.
4. G. Brassard and P. Bratley, Algorithmics: Theory and Practice, Printice –Hall, 1988.
5. Thomas H.Corman, Charles E.Leiserson, Ronald L. Rivest, ”Introduction to Algorithms”,
Second Edition, PHI 2003.
243101 OBJECT ORIENTED SOFTWARE ENGINEERING L TPC
3 0 03

UNIT I INTRODUCTION 9
System Concepts – Software Engineering Concepts – Development Activities – Managing
Software Development – Unified Modeling Language – Project Organization – Communication

UNIT II ANALYSIS 9
Requirements Elicitation – Concepts – Activities – Management – Analysis Object Model –
Analysis Dynamic Models

UNIT III SYSTEM DESIGN 9

Decomposing the system – Overview of System Design – System Design Concepts – System
Design Activities – Addressing Design Goals – Managing System Design

UNIT IV OBJECT DESIGN AND IMPLEMENTATION ISSUES 9

Reusing Pattern Solutions – Specifying Interfaces – Mapping Models to Code – Testing

UNIT V MANAGING CHANGE 9

Rationale Management – Configuration Management – Project Management – Software Life
Cycle
TOTAL : 45 PERIODS
REFERENCES:
nd
1. Bernd Bruegge, Alan H Dutoit, Object-Oriented Software Engineering, 2 ed, Pearson
Education, 2004.
rd
2. Craig Larman, Applying UML and Patterns, 3 ed, Pearson Education, 2005.
th
3. Stephen Schach, Software Engineering 7 ed, McGraw-Hill, 2007.
241103 COMPUTER NETWORKS AND MANAGEMENT
LTPC
3003
UNIT I HIGH SPEED NETWORKS 9
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, Fibre Channel – Wireless LAN’s.

UNIT II CONGESTION AND TRAFFIC MANAGEMENT 9

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 10

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 9

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 & Characteristics, Data Flow, RSVP operations, Protocol Mechanisms –
Multiprotocol Label Switching – Operations, Label Stacking, Protocol details – RTP – Protocol
Architecture, Data Transfer Protocol, RTCP.

TOTAL : 45 PERIODS
TEXT BOOKS:

1. William Stallings, “HIGH SPEED NETWORKS AND INTERNET”, Pearson Education,

Second Edition, 2002.

REFERENCES:

1. Warland & Pravin Varaiya, “HIGH PERFORMANCE COMMUNICATION NETWORKS”,

Jean Harcourt Asia Pvt. Ltd., II Edition, 2001.
2. Irvan Pepelnjk, Jim Guichard and Jeff Apcar, “MPLS and VPN architecture”, Cisco
Press, Volume 1 and 2, 2003.
241151 DATA STRUCTURES LAB
LTPC
0032

1. Min Heap
2. Deaps
3. Leftist Heap
4. AVL Tree
5. B-Tree
6. Tries
7. Quick Sort
8. Convex hull
9. 0/1 Knapsack using Dynamic Programming
10. Graph coloring using backtracking
TOTAL : 30 PERIODS

241152 NETWORKING LAB LTPC

0032

1. Socket Programming
a. TCP Sockets
b. UDP Sockets
c. Applications using Sockets
2. Simulation of Sliding Window Protocol
3. Simulation of Routing Protocols
4. Development of applications such as DNS/ HTTP/ E – mail/ Multi - user Chat
5. Simulation of Network Management Protocols
6. Study of Network Simulator Packages – such as opnet, ns2, etc.

TOTAL : 30 PERIODS