Match List–I with List–II and select the correct answer using the codes given…
20182018
Match List–I with List–II and select the correct answer using the codes given below the Lists: List–I List–II A. All-pairs shortest path 1. Greedy B. Quicksort 2.Depth-first search C. Minimum weight spanning tree 3. Dynamic programming D. Connected components 4. Divide and conquer
Answer: B. A–3, B–4, C–1, D–2 — All-pairs shortest path → Dynamic programming (e.g., Floyd–Warshall) Quicksort → Divide and conquer Minimum weight spanning tree → Greedy (Prim’s, Kruskal’s)…
- A.
A–2, B–4, C–1, D–3
- B.
A–3, B–4, C–1, D–2
- C.
A–3, B–4, C–2, D–1
- D.
A–4, B–1, C–2, D–3
Attempted by 377 students.
Show answer & explanation
Correct answer: B
All-pairs shortest path → Dynamic programming (e.g., Floyd–Warshall)
Quicksort → Divide and conquer
Minimum weight spanning tree → Greedy (Prim’s, Kruskal’s)
Connected components → Depth-first search (DFS)