Q. 39 Given below are some algorithms, and some algorithm design paradigms.
List-I A. Dijkstra’s Shortest Path B. Floyd-Warshall algorithm to compute all pairs shortest path C. Binary search on a sorted array D. Backtracking search on a graph List-II 1. Divide and Conquer 2. Dynamic Programming 3. Greedy design 4. Depth-first search 5. Breadth-first search
Match the above algorithms on the left to the corresponding design paradigm
they follow.
A B C D (a) 1 3 1 5 (b) 3 3 1 5 (c) 3 2 1 4 (d) 3 2 1 5
Answer: (C)
Explanation:
