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

Contact us

Head of the Department,
Department of Information Technology,
National Institute of Technology Karnataka,
SurathkalP. O. Srinivasnagar, Mangalore - 575 025
Ph.:    +91-824-2474056
Email:  hodit [at] nitk [dot] edu [dot] in
 

Web Admin: Sowmya Kamath S

Connect with us

We're on Social Networks. Follow us & stay in touch.