Algorithms and Complexity
Course Name:
Algorithms and Complexity (CS700)
Programme:
M.Tech (CSE)
Semester:
First
Category:
Programme Core (PC)
Credits (L-T-P):
04 (3-0-2)
Content:
Algorithmic paradigms: Dynamic Programming, Greedy, Branch-and-bound, Asymptotic complexity, Amortized analysis, Graph Algorithms: Shortest paths, Flow networks; NP-completeness, Approximation algorithms, Randomized algorithms and advanced data structures.
References:
1.T.H. Cormen, C.E. Leiserson, R.L. Rivest, "Introduction to Algorithms", McGraw Hill, 1994.
2.Dan Gusfield, "Algorithms on Strings, trees and Sequences", Cambridge, 2005.
3.Sara Baase, "Computer Algorithms: Introduction to Design and Analysis", Addison Wesley, 1998.
4.Michael T Goodrich & Roberto Tamassia, "Algorithm Design: Foundations, Analysis and Internet Examples", John Wiley, 2002.
Department:
Computer Science and Engineering