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 — A. All-pairs shortest path algorithms, such as Floyd-Warshall, rely on Dynamic Programming (3). B. Quicksort is a classic example of the Divide and Conquer…
- 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 316 students.
Show answer & explanation
Correct answer: B
A. All-pairs shortest path algorithms, such as Floyd-Warshall, rely on Dynamic Programming (3). B. Quicksort is a classic example of the Divide and Conquer paradigm (4). C. Minimum weight spanning tree algorithms like Prim's or Kruskal's utilize Greedy strategies (1). D. Finding connected components in a graph is typically achieved using Depth-first search (2). Therefore, the correct matching sequence is A-3, B-4, C-1, D-2.