GATE Algorithms – Previous Year Questions by Topic

GATE Algorithms (Computer Science) previous year questions, topic by topic: Searching, Sorting and Hashing, Asymptotic Analysis and Time/Space Complexity, Greedy Techniques, Dynamic Programming, Divide-and-Conquer, Graph Algorithms: Traversals, Minimum Spanning Trees, Shortest Paths.

• Searching, Sorting and Hashing 13 questions
• Asymptotic Analysis and Time/Space Complexity 20 questions
• Greedy Techniques 3 questions
• Dynamic Programming 5 questions
• Divide-and-Conquer 3 questions
• Graph Algorithms: Traversals, Minimum Spanning Trees, Shortest Paths 32 questions