GATE CS Algorithms Syllabus: Topics and Previous Year Questions
The full GATE CS Algorithms syllabus — 5 topics. Previous year questions for this subject are being added. Sign up free to practise every question, topic by topic, with the answer to each one.
Algorithm Analysis & Asymptotic Notations Coming soon
Covers: Asymptotic Notation, Finding Time Complexity · Solving Recurrence Relations
Divide and Conquer Coming soon
Covers: Divide and Conquer · Binary Search · Max-Min · Matrix Multiplication · Linear Search · Hashing
Sorting Coming soon
Covers: Merge Sort · Quick Sort · Elementary Sorting (Insertion, Selection, Bubble) · Heaps · Radix Sort
Dynamic Programming Coming soon
Covers: Dynamic Programming
Greedy Method and Graph Techniques Coming soon
Covers: Greedy Method · Minimum Spanning Trees · Single-Source Shortest Paths · All-Pairs Shortest Paths · Graph Traversals (BFS and DFS) · Graph Techniques
Practise Algorithms
Sign up free to work through every GATE CS Algorithms question, topic by topic, with the answer to each one.
Create your free accountSign in