Algorithms

~11 marks

Complexity analysis, sorting, graph algorithms, dynamic programming, greedy, and computational complexity.

5 Topics

Asymptotic Analysis & Complexity

Asymptotic analysis measures algorithm efficiency by describing how running time grows with input size. It forms the foundation of every GATE Algorithms question.

Medium18m

Sorting Algorithms

GATE tests exact time/space complexities, stability, and in-place properties for all major sorting algorithms.

Medium20m

Graph Algorithms (BFS, DFS, Dijkstra, MST)

Graph algorithms test your understanding of traversal, shortest paths, and spanning trees. GATE frequently asks about time complexities, correctness conditions, and edge cases.

Hard22m

Dynamic Programming

DP solves problems by storing solutions to overlapping subproblems. GATE tests classic DP problems with a focus on recurrences and complexities.

Hard20m

Greedy Algorithms

Greedy algorithms make locally optimal choices at each step. GATE tests when greedy works, classic problems, and knowing when greedy fails.

Medium16m