Learn Algorithms, with pictures you can poke.
Short concepts, every formula in one place, interactive animations, and the question types that keep repeating in past GATE papers.
Syllabus. Asymptotic worst-case time and space complexity. Searching, sorting. Graph traversals, minimum spanning trees, shortest paths. Algorithm design techniques: greedy, dynamic programming, divide and conquer. P, NP and NP-completeness.
Study order
Highest yield first. Tick a topic when you are done with it.
0 of 5 topics done
Asymptotic Analysis & Recurrences
Every algorithm question ends in a complexity. Loop counting, recurrences and the Master theorem are near-certain marks.
Sorting & Searching
Complexities, stability, number of swaps and comparisons, and quicksort partitioning appear in almost every paper.
Graph Algorithms
The largest algorithm topic: traversals, MST, shortest paths and topological order are asked in several questions per paper.
Algorithm Design: Divide & Conquer, Greedy, DP
Identify the paradigm, write the recurrence, and fill a DP table by hand: these questions carry 2 marks each.
P, NP & NP-Completeness
Usually one conceptual question: which statements about P, NP, NP-hard and NP-complete are true.
What gets asked, at a glance
Most frequent question types across topics (rating is approximate).
Importance and frequency ratings are my reading of recurring GATE CSE patterns, not an official count. Cross-check against a PYQ set before relying on them for exact marks.
Frequently asked questions
How many marks does Algorithms carry in GATE CSE?
By my estimate about 7 to 9 marks per paper. This is an estimate from recurring patterns in past papers, not an official count, and it varies from year to year.
What topics are in Algorithms for GATE CSE?
Asymptotic Analysis & Recurrences; Sorting & Searching; Graph Algorithms; Algorithm Design: Divide & Conquer, Greedy, DP; P, NP & NP-Completeness.
Which Algorithms topics are most important for GATE?
The highest-yield topics are Asymptotic Analysis & Recurrences; Sorting & Searching; Graph Algorithms; Algorithm Design: Divide & Conquer, Greedy, DP. Importance is my estimate from recurring question patterns.
Where can I find solved GATE Algorithms previous year questions?
This page links to 67 previous year question entries from 2012 to 2025, each with the official answer key and a worked solution.