The GATE Grind

GATE Algorithms: Greedy Techniques – Previous Year Questions

3 GATE previous year questions on Greedy Techniques (Algorithms, Computer Science) with answers and explanations, from every paper.

  1. GATE 2017 CS Q15 (1 mark, Multiple choice) – Consider the following table: Algorithms Design Paradigms --- --- (P) Kruskal (i) Divide and Conquer (Q) Quicksort (ii) Greedy (R) Floyd-Warshall…
  2. GATE 2015 CS Q13 (1 mark, Multiple choice) – Match the following: (P) Prim's algorithm for minimum spanning tree (Q) Floyd-Warshall algorithm for all pairs shortest paths (R) Mergesort (S)…
  3. GATE 2018 CS Q58 (2 marks, Numerical answer) – Consider the weights and values of items listed below. Note that there is only one unit of each item. Item number Weight (in Kgs) Value (in Rupees)…