CS201 Design and Analysis of Algorithms Max.Marks:75

Size: px

Start display at page:

Download "CS201 Design and Analysis of Algorithms Max.Marks:75"

Maximillian Wood
5 years ago
Views:

1 Syllabus for M.Sc. Computer Science Programme Semester II CS 201 Design and Analysis of Algorithms 100 ( ) CS 202 Data Communication and Computer Network 100 ( ) CS 203 Optimization Techniques 100 ( ) CS 204 Software Engineering 100 ( ) CS 205 LAB (DAA) 100 ( ) CS201 Design and Analysis of Algorithms Max.Marks:75 Algorithms, Analysis of Algorithm, Design of Algorithms, Time and space complexities, Asymptotic notations, Growth+ of Functions, Recurrences Sorting in Polynomial Time: Insertion Sort, Merge Sort, Heap sort and Quick Sort Sorting in Linear Time: Counting Sort, Radix Sort, Bucket Sort I Elementary Data Structure: Stacks, Queues, Linked List, Binary Search Tree, Hash Table Advanced Data Structure: Red Black Trees, Splay Tree, Augmenting Data Structure Binomial Heap, B-tree, Fibonacci Heap,and Data Structure for Disjoint sets, Dictionaries and Priority Queues, mergeable heaps, concatanable queues. II Advanced Design and Analysis Techniques: Dynamic Programming, Greedy Algorithm, Backtracking, Branch- and- Bound.

2 Graph Algorithms: Elementary Graph Algorithm, Breadth First Search, Depth First Search, Minimum Spanning Tree, Kruskal s Algorithm, Prim s Algorithm, Single Source Shortest Path, All Pair Shortest Path, Maximum Flow and Traveling Salesman Problem. Randomized Algorithm: String Matching, NP-Hard and NP- Completeness, Approximation Algorithms, Sorting Network, Matrix Operations, Polynomial and FFT, Number Theoretic Algorithms, Computational Geometry. 1. Horowitz Sahni, Fundamentals of Computer Algorithm, Galgotia, 2. Coreman Leiserson etal, Introduction to Algorithm, PHI 3. Brassard Bratley, Fundamental of Algorithm, PHI 4. M.T. Goodrich etal, Algorithms Design, John Wiley and Sons 5. A V. Aho etal, The Design and Analysis of Algorithms, Pearson Education CS202 Data Communication and Computer Network Max. Marks: 75 Fundamentals of Data communication, Transmission media, Transmission modes, Asynchronous and Synchronous transmission. communication channel, Measure of Information Encoding of source output Shannon s algorithm, I Digital and analog signals, Digital to Digital conversion, Analog to Digital conversion, Digital to Analog conversion, Analog to Analog conversion. Multiplexing, Error detection and correction codes. II Overview of computer network, Network topology, Routers, Bridges and gateways, LAN, MAN and WAN, OSI reference model, TCP/IP reference model, Novell Netware, ARPANET, NSFNET, IEEE LAN standards Logical Link Protocol, CSMA/CD, Token Bus, Token Ring,

3 FDDI. Data Link Layer Protocols, HDLC, Concepts in Network Layer, Routing Algorithms, Switching Techniques. Transport Layer services, Problems and protocols, Integrated Services Digital Network (ISDN), Asychronous Transfer Mode (ATM), Real Time Protocols. Network Security, Authentication applications, Electronic Mail Architecture and services. Cryptography-Public key, secret key, Domain Name System(DNS), System Security: Intruders, Viruses, Firewall Design Principles. 1. K.S. Shanmavgoan, Digital and Analog Communication system, Wiley, John and sons. 2. Behrouz A. Forouzan, Data Communications and Networking Communication System, TMH 3. A.S. Tanenbaum, Computer Network PHI 4. Black, Computer Network PHI 5. Miller, Data and Network Communication, Vikas 6. Comer, Computer Network and Internet, Addision Wesley 7. Schwartz, Communication Networks CS203 Optimization Techniques Max. Marks: 75 Linear Programming Problems (LPP) in the standard form, Mathematical formulation, LPP in canonical form, conversion of LPP in standard form to LPP in canonical form. I

4 Simplex: Prevention of cyclic computation in Simplex and Tableau, Big-M method, Dual Simplex and Revised Simplex. Complexity of Simplex algorithms, Exponential behavior of Simplex. II Ellipsoid method and Karmakar s method for solving LPPs. Solving simple LPPs through these methods etc. Assignment and Transportation Problems: Simple algorithms like Hungarian Method etc. Shortest Path Problems : Dijkestra and Moore s method Network Flow Problem: Formulation Max Flow, Mincut theorem, Ford and Fulkerson s algorithm, Malhotra, Pramod Kumar Maheshwari (MPM) Polynomial algorithm for solving network flow problem. Non Linear Programming: Kuhn Tucker Conditions, Convex Functions and Convex region, Convex Programming Problems, Algorithms for solving convex Programming Problems. 1. S.D. Sharma, Operation Research, KedarNath, Raninath Meerut 2. H.A. Taha, Operation research, McMillan 3. L.S. Srinath, Linear Programming, East west Publication CS204 Software Engineering Max. Marks: 75 Introduction: Software Engineering vs. Traditional Programming, System Development Life Cycle (Software Production Process, Conception, Initiation, Analysis Design, Construction, Testing, Implementation). Waterfall Model, Evolutionary Model. Factors affecting Software Development and Maintenance. I Software Project Management: Defining the Problem, Developing a Solution Strategy, Planning the Development Process, Measurement of Software Productivity and Quality.

5 II Software Engineering Principles & Tools: Tools of Design (Data Flow Diagrams, Data Dictionary, Decision Tree, Decision Tables), Modularization (Coupling) Testing: Testing fundamentals, Unit testing, Blackbox testing, Whitebox testing, Basic Path testing, Control Structure testing, Integration testing. Software maintenance: Introduction to Software Maintenance, Enhancing Maintainability During Development (analysis Activities, Standards and Guidelines, Design activities, Implementation Activities, Supporting Documents) Managerial Aspects of Software Maintenance (Change Control Board, Change Request summaries, Quality Assurance Activities, Organizing Maintenance Programs). 1. R.F.Fairley,, Software Engineering Concepts, McGraw Hill. 2. R.S.Press Man, Software Engineering A Practitioners Approach McGraw Hill. 3. Rajib Mall, Fundamentals of Software Engineering. PHI. 4. Pankaj Jalote. An Integrated Approach to Software Engineering, Narosa

Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest. Introduction to Algorithms

Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Introduction to Algorithms Preface xiii 1 Introduction 1 1.1 Algorithms 1 1.2 Analyzing algorithms 6 1.3 Designing algorithms 1 1 1.4 Summary 1 6