Design and Analysis of Algorithms
Course Name:
Design and Analysis of Algorithms (CS253)
Programme:
B.Tech (CSE)
Semester:
Fourth
Category:
Programme Core (PC)
Credits (L-T-P):
04 (3-1-0)
Content:
Models of computation, Algorithm analysis, Time and spacec omplexity, Average and worst case analysis, Lower bounds.Algorithm design techniques: Divide and conquer, Greedy, Dynamic programming, Amortization, Randomization. Problem classes: P, NP, PSPACE; Reducibility, NP-hard and NP-complete problems. Approximation algorithms for some NP-hard problems
References:
Cormen, Leiserson, Rivest,and Stein, ”Introduction to Algorithms”, MIT Press ,Third Edition, 2009.
Dasgupta, Papadimitrou and Vazirani, “Algorithms”, McGraw-Hill Education, 2006. Horowitz, Sahni, and Rajasekaran,
“Computer Algorithms” Silicon Press, 2007
Kleinberg and Tardos, “Algorithm Design”, Pearson, 2005.
Goodrich and Tamassia, “Algorithm Design”, Wiley, 2001.
Department:
Computer Science and Engineering