These note are very nicely written in good handwriting to help student easily grasp the concept and become able to solve the GATE problems. Notes contains theory, concepts and solved examples wherever necessary.
Topic Covered: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.