IT903
Course Name:
Design & Analysis of Algorithms (IT903)
Programme:
Ph.D
Credits (L-T-P):
4
Content:
Fundamentals of Algorithmic Problem Solving, Fundamental data Structures, Fundamentals of the Analysis of Algorithm Efficiency, Brute Force, Divide-and-Conquer, Decrease and
Conquer, Transform and Conquer, Space and Time Tradeoffs, Dynamic Programming, Greedy Technique, Limitations of Algorithm Power. Coping with the Limitations of Algorithm
Power.
References:
Anany Levitin, Introduction to The Design And Analysis Of Algorithms, Pearson Education, 2003.
T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, McGraw Hill, 1994.
Sara Baase, Computer Algorithms: Introduction to Design and Analysis, Addison Wesley, 1998.
Michael T Goodrich & Roberto Tamassia, Algorithm Design: Foundations, Analysis & Internet Examples, John Wiley, 2002.
Dan Gusfield, Algorithms on Strings, trees and Sequences, Cambridge, 2005.
Department:
Information Technology