### 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

### Web Links

- Big O- how to find time complexity
- Hashing
- Extended Master Theorem
- Master Theorem for Subtract and Conquer Recurrences
- Master Theorem Exercises
- Cormen Solutions,
- More Cormen Solutions

### Previous Year Questions

http://gateoverflow.in/questions/algorithms

### Important Questions

http://gateoverflow.in/blog/25/important-questions-in-algorithms

### Recommended Tests

- https://gateoverflow.in/exam/237/go-2021-algorithms-1
- https://gateoverflow.in/exam/239/go-2021-algorithms-2
- https://gateoverflow.in/exam/37/go2017-algorithms-1
- https://gateoverflow.in/exam/82/test-by-bikram-algorithms-2

### GATE CSE Discussions

2016-2 Algorithms and Pointers

78,532 total views, 1 views today