- Written by KamatchiPriya
- Hits: 1943
2011 CSE I SEM - ME Curriculum and Syllabus
Curriculum and Syllabus: M.E. 2011 CSE, AUC 2011
Semester: 1
MA9219, Operations Research
Subject Introduction / Notes not available
Unit I - QUEUEING MODELS
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
Non Markovian Queues - Pollaczek Khintchine Formula - Queues in Series - Open Queueing - Networks - Closed Queueing networks
Unit III - SIMULATION
Discrete Even Simulation - Monte Carlo Simulation - Stochastic Simulation - Applications to Queueing systems
Unit IV - LINEAR PROGRAMMING
Formulation - Graphical solution - Simplex method - Two phase method - Transportation Problems - Assignment Problems
Unit V - NON-LINEAR PROGRAMMING
Lagrange multipliers - Equality constraints - Inequality constraints - Kuhn - Tucker conditions - Quadratic Programming.
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.
CS9211, Computer Architecture
Subject Introduction / Notes not available
Unit I - FUNDAMENTALS OF COMPUTER DESIGN AND PIPELINING
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
Concepts - Dynamic Scheduling - Dynamic hardware prediction - Multiple issue - Hardware - based speculation - Limitations of ILP - Case studies.
Unit III - INSTRUCTION LEVEL PARALLELISM WITH SOFTWARE APPROACHES
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
Symmetric and distributed shared memory architectures - Performance issues - Synchronization issues - Models of memory consistency - Software and hardware multithreading - SMT and CMP architectures - Design issues - Case studies.
Unit V - MEMORY AND I/O
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.
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.
CS9212, Data Structures and Algorithms
Subject Introduction / Notes not available
Unit I - COMPLEXITY ANALYSIS & ELEMENTARY DATA STRUCTURES
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
Min-max heaps - Deaps - Leftist heaps - Binomial heaps - Fibonacci heaps - Skew heaps - - Lazy-binomial heaps.
Unit III - SEARCH STRUCTURES
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
Quicksort - Strassen's matrix multiplication - Convex hull - Tree-vertex splitting - Job sequencing with deadlines - Optimal storage on tapes
Unit V - DYNAMIC PROGRAMMING AND BACKTRACKING
Multistage graphs - 0/1 knapsack using dynamic programming - Flow shop scheduling - 8-queens problem - graph coloring - knapsack using backtracking
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.
SE9213, Object Oriented Software Engineering
Subject Introduction / Notes not available
Unit I - INTRODUCTION
System Concepts - Software Engineering Concepts - Development Activities - Managing Software Development - Unified Modeling Language - Project Organization - Communication
Unit II - ANALYSIS
Requirements Elicitation - Concepts - Activities - Management - Analysis Object Model - Analysis Dynamic Models
Unit III - SYSTEM DESIGN
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
Reusing Pattern Solutions - Specifying Interfaces - Mapping Models to Code - Testing
Unit V - MANAGING CHANGE
Rationale Management - Configuration Management - Project Management - Software Life Cycle
REFERENCES:
1. Bernd Bruegge, Alan H Dutoit, Object-Oriented Software Engineering, 2nd ed, Pearson Education, 2004.
2. Craig Larman, Applying UML and Patterns, 3rd ed, Pearson Education, 2005.
3. Stephen Schach, Software Engineering 7th ed, McGraw-Hill, 2007.
CS9213, Computer Networks and Management
Subject Introduction / Notes not available
Unit I - HIGH SPEED NETWORKS
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
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
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
Integrated Services Architecture - Approach, Components, Services - Queuing Discipline, FQ, PS, BRFQ, GPS, WFQ - Random Early Detection, Differentiated Services.
Unit V - PROTOCOLS FOR QoS SUPPORT
RSVP - Goals & Characteristics, Data Flow, RSVP operations, Protocol Mechanisms - Multiprotocol Label Switching - Operations, Label Stacking, Protocol details - RTP - Protocol Architecture, Data Transfer Protocol, RTCP.
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.
CS 9215, Data Structures Lab
Subject Introduction / Notes not available
Unit I - Min Heap
Deaps - Leftist Heap - AVL Tree - B-Tree - Tries - Quick Sort - Convex hull - 0/1 Knapsack using Dynamic Programming - Graph coloring using backtracking
Books information not available
CS9216, Networking Lab
Subject Introduction / Notes not available
Unit I - Socket Programming
a. TCP Sockets - b. UDP Sockets - c. Applications using Sockets - Simulation of Sliding Window Protocol - Simulation of Routing Protocols - Development of applications such as DNS/ HTTP/ E - mail/ Multi - user Chat - Simulation of Network Management Protocols - Study of Network Simulator Packages - such as opnet, ns2, etc.
Books information not available
More by KamatchiPriya
