Complete Guideline and Reference for

Engineering Students related to Study and Reference Material of GATE.

-- Just Click it and Save it for Yours --

Search Books

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 :