Question

Match List I with List II

LIST I	LIST II
(A) Floyd-Warshall algorithm for all pair shortest paths	(I) Divide and Conquer
(B) Prim’s algorithm	(II) Greedy Paradigm
(C) Hamiltonian Circuit	(III) Backtracking
(D) Merge Sort	(IV) Dynamic Programming paradigm

Choose the correct answer from the options given below:

• (A) - (IV), (B) - (III), (C) - (II), (D) - (I)
• (A) - (IV), (B) - (II), (C) - (III), (D) - (I)
• (A) - (II), (B) - (III), (C) - (I), (D) - (IV)
• (A) - (III), (B) - (II), (C) - (IV), (D) - (I)

Hint:

Understand the paradigms associated with algorithms to match them effectively.

Answer 1

The Correct Option is A

- (A) The Floyd-Warshall algorithm leverages the Dynamic Programming paradigm (IV). - (B) Prim’s algorithm operates based on the Greedy Paradigm (III). - (C) The Hamiltonian Circuit problem is resolved using Backtracking (II). - (D) Merge Sort is implemented employing the Divide and Conquer paradigm (I).