Algo · about 7 to 9 marks per paper (my estimate, not an official count)

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

What gets asked, at a glance

Most frequent question types across topics (rating is approximate).

★★★
Order functions by asymptotic growth
Asymptotic Analysis & Recurrences
★★★
Time complexity of a nested loop / recursive code
Asymptotic Analysis & Recurrences
★★★
★★★
Worst / best / average case time of a sort
Sorting & Searching
★★★
Number of swaps or comparisons on a given input
Sorting & Searching
★★★
Quick sort partition / recurrence
Sorting & Searching
★★★
Minimum spanning tree: weight, uniqueness, which edges
Graph Algorithms
★★★
Dijkstra / shortest path order or distance
Graph Algorithms
★★★
BFS / DFS order, time complexity, applications
Graph Algorithms
★★★
Which paradigm solves it / which problem is greedy-solvable
Algorithm Design: Divide & Conquer, Greedy, DP
★★★
DP table value (LCS, knapsack, matrix chain, coin change)
Algorithm Design: Divide & Conquer, Greedy, DP
★★★
Time or space complexity of a DP / recurrence
Algorithm Design: Divide & Conquer, Greedy, DP
★★★
Which statements about P / NP / NP-complete are true
P, NP & NP-Completeness

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.