Course Name: 

Advanced Algorithms (IT700)


M.Tech (IT)




Programme Core (PC)

Credits (L-T-P): 

(3-0-2) 4


Algorithmic paradigms: Dynamic Programming, Greedy, Branch-and-bound; Asymptotic complexity, Amortized analysis; Advanced Data structures for efficient manipulation of sets and partition, Efficient Graph algorithms: Depth first search; Strassen's matrix multiplication, Efficient algorithms: matrix inversion and LUP decomposition, Modular arithmetic, NP completeness/approximation algorithms, Randomized algorithms: min cut, primality testing; Online, Linear/Integer programming, Machine Learning Algorithms; Applications and Recent Trends.


Aho, Hopcroft and Ullman, The Design and Analysis of Computer Algorithms, Addison Wesley, 1974.
Horowitz and Sahni, Fundamentals of Computer Algorithms, Galgotia Publications, 1985.
Baase S., Computer Algorithms: Introduction to Design and Analysis, Addison Wesley, 1998.
Michael T Goodrich & Roberto Tamassia, Algorithm Design: Foundations, Analysis & Internet Examples, John Wiley, 2001.
Dan Gusfield, Algorithms on Strings, Trees and Sequences, Cambridge, 2005.
Jon Kleinberg and Eva Tardos, Algorithm Design, Pearson/Addison Wesley, 2006.
T H Cormen, C E Leiserson, R L Rivest, C Stein, Introduction to Algorithms, 3rd Edition, MIT Press, 2009.
Steven S Skiena, The Algorithm Design Manual, 2nd Edition, Springer-Verlag, 2010.


Information Technology

Contact us

G. Ram Mohana Reddy

Professor and Head,
Department of Information Technology, NITK, Surathkal,
P. O. Srinivasnagar, Mangalore - 575 025
Karnataka, India.
Ph.:    +91-824-2474056
Email:  infotech[AT]nitk[DOT]ac[DOT]in

Sowmya Kamath S (Web Admin)

Connect with us

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