09NN01 OPTIMIZATION TECHNIQUES 3104

LINEAR PROGRAMMING: Linear Programming: Graphical method, Simplex method, Revised simplex method, Duality in linear programming (LP), Sensitivity analysis, other algorithms for solving LP problems, Transportation, assignment and other applications. (9) NON-LINEAR PROGRAMMING: Non Linear Programming: Unconstrained optimization techniques, Direct search methods, Descent methods, constrained optimization. (9) INTEGER AND DYNAMIC PROGRAMMING: Formulation of Integer Programming Problems, Gomorys cutting plane methods, Branch and Bound Techniques, Characteristics of Dynamic programming, Bellmans principle of optimality, Concepts of dynamic method of solution. (11) PERT/CPM: Network Construction-Computation of earliest start time, latest start time, total, free and independent float time -Crashing Computation of optimistic, most likely, pessimistic and expected time- Resource analysis in Network scheduling. (5) NON TRADITIONAL TECHNIQUES: Genetic Algorithm, Simulated Annealing, Tabu Search and Neural Networks. (8)

Total 42 REFERENCES: 1. Rao S S, Engineering Optimization: Theory and Practice, New Age International, New Delhi, 2006. 2. Trivedi K S, Probability and Statistics with Reliability, Queuing and Computer Applications, Prentice Hall, New Delhi, 2006. 3. Taha H A, Operations Research: An Introduction, Pearson Education, New Delhi, 2006. 4. Alberto LeonGarcia, Probability and Random Processes for Electrical Engineering, Pearson Education, New Delhi, 2007. 5. Jang J S R, Sun C T and Mizutani, Neuro-Fuzzy and Soft Computing: A Computational Approach to Learning and Machine Intelligence, Pearson Education, New Delhi, 2005.

09NN02 DATA STRUCTURES AND ALGORITHMS 3104

INTRODUCTION: Primitive Data Types - Abstract Data types Algorithm Analysis Time and Space Complexity. LISTS: Arrays Linked Lists Stacks and Queues Applications Implementation of Recursive Functions. (3) (5)

TREES: Binary Trees Tree Traversals Binary Search Trees Balanced Search Trees AVL Red-Black Trees Binary Heap Heap Sort Priority Queues. (8)

GRAPHS: Representation of Graphs, Breadth First Search, Depth First Search, Strongly Connected Components, Dijkstras and Bellman Fords Algorithms Floyd - Warshalls All Pair Shortest Paths Algorithm. (8) SEARCHING: Hash Tables Collision resolution Tree Structures. ALGORITHM DESIGN METHODS: Greedy Method - Divide and Conquer Branch and Bound. (4) Dynamic Programming - Backtracking (14)

Total 42 REFERENCES: 1. Weiss M A, Data Structures & Algorithm analysis in C++, Addison Wesley, New Delhi, 2006. 2. Ellis Horowitz and Sartaz Sahni, Fundamentals of Computer Algorithms, Computer Science Press, Delhi, 2008.

3.

Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, Introduction to Algorithms, Prentice Hall, Delhi 2001. 4. Vijayalakshmi Pai , Data Structures-Concepts, Techniques and Applications, Tata McGraw Hill, New Delhi, 2008.

86

09NN03 ADVANCED COMPUTER ARCHITECTURE 4004

REVIEW OF COMPUTER ARCHITECTURE: Fundamentals of Computer design- Technology trends- cost- measuring and reporting performance - Instruction set principles- addressing modes. (9) PIPELINING AND ILP: Pipelining - Design issues - Instruction level parallelism (ILP) -over coming data hazards reducing branch costs high performance instruction delivery - hardware based speculation- limitation of ILP - ILP software approach-compiler techniques- static branch protection-VLIW approach- Hardware and software solutions. (9) MEMORY: Memory hierarchy design- cache performance- reducing cache misses penalty and miss rate virtual memory- protection. (7) STORAGE SYSTEMS: Types Buses - RAID- errors and failures- bench marking a storage device- designing a I/O system. (8) MULTIPROCESSORS: Multiprocessors and thread level parallelism- symmetric shared memory architectures- distributed shared memory- Synchronization-multi threading. Inter connection networks and clusters- interconnection network media practical issues in interconnecting networks- examples clusters- designing a cluster. (9) Total 42 REFERENCES: 1. Patterson D A and Hennessy J L, Computer Architecture: A Quantitative Approach, Morgan Kaufmann Amsterdam, 2006. 2. Carl Hamacher, Zvonko Vranesic, Safwat Zaky, Computer Organization, McGraw Hill, New York, 2006. 3. Vincent T Heuring, Jordan H F, Computer Systems Design and Architecture, Addison Wesley, NewDelhi, 2006. 4. Kai Hwang, Advanced Computer Architecture, Parallelism, Scalability, Programmability, McGraw Hill,London, 2003.

09NN04 OPERATING SYSTEM DESIGN 3104

INTRODUCTION: Introduction - Operating Systems Services Types of Operating Systems and Operating systems structure. (5) PROCESS MANAGEMENT: Processes - CPU Scheduling Approaches Process Synchronization Semaphores Deadlocks Handling Deadlocks Multithreading Case study: process management in Linux. (10)

MEMORY MANAGEMENT: Memory Management Paging Segmentation Virtual Memory Demand Paging Replacement Algorithms Case study: Memory management in Linux. (9) FILE HANDLING: 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 Case study: I/O management in Linux (9) ADVANCED OS: Design issues in Distributed Operating System- Network Operating Systems Symbion OS (9)

Total 42 REFERENCES: 1. Abraham Silberschatz, Peter B Galvin, Gagne G, Operating System Concepts, John Wiley & Sons, New York, 2005. 2. Charles Crowley, Operating systems: A Design Oriented Approach, Tata McGraw Hill, 2004. 3. Dhamdhare, Operating Systems-a concept based approach, Tata McGraw Hill, 2006. 4. Tanenbaum, Distributed Operating Systems, Pearson Education, New Delhi, 2004. 5. Pradeep K Sinha, Distributed OS concepts and Design, IEEE computer Society Press, PHI 2005.

87

09NN05 /09NE35 SOFTWARE ENGINEERING METHODOLOGIES 3003

INTRODUCTION: Definition of terms Role of Software Software characteristics Software classification Software myths Software Life Cycle Models - Selection of process models for projects. (8) SOFTWARE REQUIREMENT ANALYSIS: Software Requirements elicitation Requirement Specifications Joint Application development Analysis modeling. (8)

SOFTWARE DESIGN: Design concepts Function Oriented Design Object Oriented Design User interface design Software Architecture. (8) PROGRAMMING STANDARDS: Structured programming Coding standards Maintainability of programs. SOFTWARE TESTING: Testing fundamentals Test cases Testing Techniques Testing strategies. (4) (6)

SOFTWARE CONFIGURATION MANAGEMENT: SCM process Version control Change control Configuration audit SCM Standards. (4) SOFTWARE MAINTENANCE: Types of changes Maintenance issues Measuring maintenance effort Proactive, Preventive and Perfective maintenance Software rejuvenation. (4) Total 42 REFERENCES: 1. Roger Pressman S, Software Engineering: A Practitioner's Approach, Tata McGraw Hill, New Delhi, 2005. 2. Sommerville I, Software Engineering, Pearson Education, New Delhi, 2007. 3. Shari Lawrence Pfleeger, Software Engineering: Theory and Practice, Pearson Education, New Delhi, 2007.

09NN08 NETWORKING TECHNOLOGY 3024

INTRODUCTION: Networking basics - LANs and WANs - Network hardware components, Server-based networks - Peerto-peer networks - Server-based vs. peer-to-peer networks - Specialized servers - Combination networks - Network packets Addressing packets Multiplexing - Protocols - The OSI reference model Internet Protocol Stack. (8) DATA LINK CONTROL: Asynchronous and Synchronous transmission - MAC protocol; Controlled & contention-based IEEE 802.11 LANs System architecture, physical layer, Media Access Control MAC management Error Detection and Correction Techniques CRC and Linear Block Codes Transmission Protocols Retransmission techniques -Token ring FDDI. (9) TRANSPORT LAYER: Introduction to TCP packet format sliding window protocol Establishing and Closing TCP connection Response to Congestion and variance in delay TCP performance Reserved and available port numbers. (8) NETWORK PROTOCOLS: IP Layers and functions - Congestion control - X.25 - Internetworking concepts and X.25 architectural models Naming addressing and routing using IP - Unreliable connectionless delivery - Datagrams Routing IP datagrams ICMP. (9) NETWORK PERFORMANCE MEASUREMENT AND MODELING: Traffic modeling and simulation - self-similar and heavy-tailed models - Buffering Blocking - Fast Forwarding Internet traffic: self-similarity - Ethernet traffic - World-Wide-

88

Web traffic - IP Switching - IP multicast - multicast routing.

(8)

Total 42 REFERENCES: 1. Fitzgerald and Dennis, Business Data Communications and Networking, John Wiley and Sons, Delhi, 2005. 2. William Stallings, Data and Computer Communications, Eighth edition, Prentice Hall, New Delhi, 2006. 3. James F Kurose, et al, Computer Networking: A Top-Down Approach Featuring the Internet, Fourth edition, Addison Wesley, 2008. 4. Achyut S Godbole, Data Communications and Networks, Tata Mc-Graw Hill, 2002. 5. Ferouzan, Data Communications and Networking, Tata Mc-Graw Hill, 2006.

PRACTICALS
09NN51 DATA STRUCTURES LABORATORY 0032
Students will be assigned with an application that employs the use of data structures in problem solving. Typical applications include; 1. 2. 3. 4. 5. 6. 7. Solving Maze Problem Stack. Traffic Signal Simulation Queue. Sparse Matrix Manipulation Linked Lists. Creating Optimal Binary Search Trees Trees. PERT Graph. Dictionary Application Hashing. Simulation of various sorting techniques.

89