I M.Tech - IT (Full Time) (11-13)

ANNA UNIVERSITY OF TECHNOLOGY, COIMBATORE
M.Tech (Information Technology)
CURRICULUM 2011 - FULL TIME MODE
SEMESTER – I
Course Course Title L T P C

Code No.
Theory
MA9219 Operations Research 3 1 0 4
CS9212 Data Structures and algorithms 3 0 0 3
CS9211 Computer Architecture 3 0 0 3
CS9213 Computer Networks and Management 3 0 0 3
IT9211 Software Engineering 3 0 0 3
PRACTICAL
CS9215 Data Structures Laboratory 0 0 3 2
CS9216 Networking Laboratory 0 0 3 2
TOTAL 15 1 6 20
MA9219 OPERATIONS RESEARCH L T P C3 1 0 4
UNIT I QUEUEING MODELS 12

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 12

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

Discrete Even Simulation – Monte – Carlo Simulation – Stochastic Simulation –
Applications to Queueing systems.
UNIT IV LINEAR PROGRAMMING 12

Formulation – Graphical solution – Simplex method – Two phase method -
Transportation and Assignment Problems.
UNIT V NON-LINEAR PROGRAMMING 12

Lagrange multipliers – Equality constraints – Inequality constraints – Kuhn – Tucker
conditions – Quadratic Programming.
L + T: 45+15 =60 PERIODS
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.
CS9212 DATA STRUCTURES AND ALGORITHMS L T P C3 0 0 3
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.
CS9211 COMPUTER ARCHITECTURE L T P C3 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
approach”, Morgan Kaufmann / Elsevier, 4th. 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.
CS9213 COMPUTER NETWORKS AND MANAGEMENT LTPC3003
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.
IT9211 SOFTWARE ENGINEERING LTPC3003
UNIT I 9
Definition – systems approach – modeling the process and lifecycle – meaning of
process – software process models – tools and techniques – practical process modeling
– information systems – planning and managing the project – tracking project – project
personnel – effort estimation – risk management – project plan – process models and
project management
UNIT II 9
Capturing the requirements – requirements process – requirements elicitation – types –
characteristics – modeling notations – specification languages – prototyping –
documentation – validation and verification – measures – specification techniques –
designing the system – decomposition and modularity – architectural styles and
strategies – issues – characteristics – improvement techniques – design evaluation,
validation – documentation
UNIT III 8
Considering objects – object orientation – OO development – use cases – representing
OO – OO system design – program design – OO measurement – writing programs –
standards – procedures – guidelines – documentation – programming process
UNIT IV 9
Testing the program – faults – failures – issues – unit testing – Integration testing –
testing OO systems – test planning – automated testing tools - testing the system –
principles – function testing – performance testing – reliability, availability and
maintainability – acceptance testing – installation testing – automated system testing –
test documentation – testing safety critical systems – delivering the system – training –
documentation
UNIT V 10
System maintenance – the changing system – nature of maintenance – problems –
measuring maintenance characteristics – techniques and tools – software rejuvenation –
evaluation approaches – selection – assessment vs. prediction - evaluating products,
processes and resources – improving predictions, products, processes and resources –
guidelines – decision making in software engineering – licensing – certification and
ethics
TOTAL:45 PERIODS
TEXT BOOKS:
1. Shari Lawrence Pfleeger, Joanne M. Atlee, Software Engineering: Theory and
Practice, Prentice Hall, 2006
REFERENCES:
1. Carlo Ghezzi, Mehdi Jazayeri, Dino Mandrioli, Fundamentals of Software
Engineering, Prentice Hall, 2002
TOTAL:45 PERIODS
CS9215 DATA STRUCTURES LABORATORY LTPC0032
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:45 PERIODS
CS9216 NETWORKING LABORATORY LTPC0032
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:45 PERIODS

I M.Tech - IT (Full Time) (11-13)

Uploaded by

Copyright:

Available Formats

I M.Tech - IT (Full Time) (11-13)

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

I M.Tech - IT (Full Time) (11-13)

Uploaded by

Copyright:

Available Formats

ANNA UNIVERSITY OF TECHNOLOGY, COIMBATORE

M.Tech (Information Technology)

CURRICULUM 2011 - FULL TIME MODE

Course Course Title L T P C

UNIT I QUEUEING MODELS 12

UNIT II ADVANCED QUEUEING MODELS 12

UNIT III SIMULATION 12

UNIT IV LINEAR PROGRAMMING 12

UNIT V NON-LINEAR PROGRAMMING 12

UNIT I COMPLEXITY ANALYSIS & ELEMENTARY DATA STRUCTURES 9

UNIT II HEAP STRUCTURES 9

UNIT III SEARCH STRUCTURES 9

UNIT IV GREEDY & DIVIDE AND CONQUER 9

UNIT V DYNAMIC PROGRAMMING AND BACKTRACKING 9

UNIT I FUNDAMENTALS OF COMPUTER DESIGN AND PIPELINING 9

UNIT II INSTRUCTION LEVEL PARALLELISM WITH

UNIT III INSTRUCTION LEVEL PARALLELISM WITH SOFTWARE

UNIT IV MULTIPROCESSORS AND MULTICORE ARCHITECTURES 9

UNIT V MEMORY AND I/O 9

UNIT I HIGH SPEED NETWORKS 9

UNIT II CONGESTION AND TRAFFIC MANAGEMENT 9

UNIT III TCP AND ATM CONGESTION CONTROL 10

UNIT IV INTEGRATED AND DIFFERENTIATED SERVICES 9

UNIT V PROTOCOLS FOR QoS SUPPORT 8

You might also like