GATE CS Data Structures and Algorithms (DSA): Practice questions with detailed solutions for competitive exams

GATE Computer Science and Information Technology Data Structures and Algorithms (DSA) Practice questions with detailed solutions

Topics covered are Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs, 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.