Loading previous year questions
Algorithms · Algorithm Design Techniques
Official IIT answer key · IIT Kanpur · Audited Aug 2026
GATE CSE 2015 Set 1 Q6 · MCQ · 1 mark
Key concept
No account needed
Sit 5 related Algorithm Design TechniquesPYQs as a guest. We'll score the set and show which traps cost marks — sign in only if you want to save the run.
Topic notes
GATE tests algorithm design techniques through two primary styles: conceptual classification and mechanical algorithmic execution. At the 1-mark level, questions focus on matching standard classical algorithms (such as MST algorithms, shortest paths, and sorting algorithms) to their corresponding paradigms like Greedy, Dynamic Programming, Divide and Conquer, or Backtracking. At the 2-mark level, the focus shifts to quantitative problem solving, such as building a Huffman tree and computing the exact total or expected bit length for encoded messages.
Full Algorithm Design Techniques guide →Match the following: (P) Prim's algorithm for minimum spanning tree (Q) Floyd-Warshall algorithm for all pairs shortest paths (R) Mergesort (S) Hamiltonian circuit (i) Backtracking (ii) Greedy method (iii) Dynamic programming (iv) Divide and conquer
Topic-wise GATE CS PYQs with verified steps
Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.