Design and Analysis of Algorithms

Code: MA617 | L-T-P-C: 3-0-0-6

MA617 Design and Analysis of Algorithms L-T-P-C [3-0-0-6]

Models of Computation: space and time complexity measures, lower and upper bounds; Design techniques: greedy method, divide-and-conquer, dynamic programming; Amortized analysis: basic techniques, analysis of Fibonacci heap and disjoint-set forest; Graph algorithms: connectivity, topological sort, minimum spanning trees, shortest paths, network flow; String matching; Average-case analysis; NP-completeness.

Texts:

1. T.H. Cormen, C.E. Leiserson, R. L. Rivest and C. Stein, Introduction to Algorithms, MIT Press, 2009.

References:

1. J. Kleinberg and E. Tardos, Algorithm Design, Addison Wesley, 2006.
2.  
3. S. Dasgupta, C. Papadimitriou and U. Vazirani, Algorithms, McGraw-Hill, 2007.
4. A. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms, Pearson, 2002.