Algorithms happen to be a rough task in most cases especially in exams like GATE, and other Computer Science Engineering Exams. It is also an important topic as it covers the weightage of 5-6 marks. However, Algorithm is also the most scoring section, you just have to know the tricks to practice religiously.
These notes are very nicely written in good handwriting to help students easily grasp the concept and become able to solve the GATE problems. Notes contain theory, concepts, and solved examples wherever necessary.
- Searching, sorting, hashing
- Asymptotic worst-case time and space complexity
- Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer
- Graph search, minimum spanning trees, shortest paths
For further queries please send us an e-mail: email@example.com