ALGORITHMS : BOOKS & Lecture Notes

Syllabus :

Analysis, Asymptotic notation, Notions of space and time complexity, Worst and average case analysis; Design: Greedy approach, Dynamic programming, Divide-and conquer; Tree and graph traversals, Connected components, Spanning trees, Shortest paths; Hashing, Sorting, Searching. Asymptotic analysis (best, worst, average cases) of time and space, upper and lower bounds, Basic concepts of complexity classes P, NP, NP-hard, NP-complete.

There are following books of Design & Analysis of algorithm with free download for GATE :

• Introduction to Algorithms - By Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest & Clifford Stein, Second Edition.

• Fundamental of Algorithms - By Gilles Brassard & Paul Bratley. 

• Introduction to Design and Analysis of Algorithms - By Anany Levitin, Second Edition.

There are following important, excellent & very useful some lecture notes by different authors with free download :

• Design and Analysis of Algorithm - By AICTE Staff.

• Design and Analysis of Computer Algorithms – Lecture Notes -- By David M. Mount.

• Design and Analysis of Algorithms – Course Notes -- By Samir Khuller.

• Algorithms and Complexity - By Herbert S. Wilf.

@ ONLINE READING :

• Design and Analysis of Algorithms - By Dave and Dave, Pearson.

• Design and Analysis of Algorithm - By A. A. Pumtambekar.