COURSE CODE L 4 T 0

COURSE TITLE

ALGORITHM ANALYSIS AND DESIGN

P 0

CREDITS (or Max. Marks) 4 WEIGHTAGES CA Attd 5 AT 20 P 0 MTE P 0 Th 25 P 0 ETE Th 50

COURSE OBJECTIVES: To create analytical skills, to enable the students to design algorithms for various applications, and to analyze the algorithms. PRE-REQUISITES: CSE204: Fundamental of Data Structure CSE205: Data Structure CSE2050: Data Structure COURSE CONTENTS: S. No. 1 2 3 4 5 Description Introduction: Notion of Algorithm , Fundamentals of Algorithmic Solving , Important Problem types , Fundamentals of the Analysis Framework , Asymptotic Notations and Basic Efficiency Classes. Mathematical Analysis of Non-recursive Algorithm , Mathematical Analysis of Recursive Algorithm , Example: Fibonacci Numbers, Solving recurrences using master method, substitution and iteration method. Sorting and order statics: Heap sort, Quick sort and sorting in linear time. Data Structures: Elementary data structures, Hash tables, BST, Red Black trees. Advanced design and analysis techniques: Dynamic Programing. MTE Advanced design and analysis techniques: Greedy techniques, Brute force techniques, amortized analysis. Advanced Data Structures: Binomial Heap ,Fibonacci heap. Graph Algorithm:Minimum Spanning trees,Single source and all source shortest path algorithm,Maximum flow String Matching Techniques:Brute force, Robin Karp, Bellman Ford,KMP Problem classes P, NP, NP-hard and NP-complete, deterministic and non deterministic polynomial time algorithms., Approximation algorithms for some NP-complete problems. or or or

6 7 8 9 10

TEXT BOOKS: 1. T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithms, PHI Pvt. Ltd., 2007 OTHER READINGS: 1. A.V.Aho, J.E. Hopcroft and J.D.Ullman, The Design and Analysis Of Computer Algorithms, Pearson Education Asia, 2007 2. Anany Levitin, Introduction to the Design and Analysis of Algorithm, Pearson Education Asia, 2003. 3. Sara Baase and Allen Van Gelder, Computer Algorithms - Introduction to Design and Analysis, Pearson Education Asia, 2006 4. Horowitz, S. Sahni, Fundamentals of Computer Algorithms, Galgotia Publishers, 2005 SALIENT PEDAGOGICAL FEATURES:

1. Closing Quiz/Review Quiz. 2. Drill Problems based on real life scenarios. 3. Recent Trends Topics.

1. Use of Mathematical Computing models.