Algorithms Syllabus
- http://gatecse.in/wiki/Changes_to_GATE_CSE_Syllabus_in_2016#Algorithms
- Searching, sorting, hashing.
- Asymptotic worst case time and space complexity.
- Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer.
- Graph traversals, minimum spanning trees, shortest paths.
“Just a rename of Graph Traversals to Graph Search.”
Book
Video
GO Classroom
Recommended Tests:
Web Links
- Big O- how to find time complexity
- Hashing
- Extended Master Theorem
- Master Theorem for Subtract and Conquer Recurrences
- Master Theorem Exercises
- Akra-Bazzi Method
- Cormen Solutions,
- More Cormen Solutions
Previous Year Questions
Important Questions
GATE CSE Discussions
2016-2 Algorithms and Pointers
GATE CSE Syllabus
Best Books for GATE CSE