Given below are some algorithms, and some algorithm design paradigms. 1.…
GATE · 2015 · CS · Set 2 · Computer Science & IT
Given below are some algorithms, and some algorithm design paradigms.
1. Dijkstra’s Shortest Path | i. Divide and Conquer |
2. Floyd-Warshall algorithm to compute all pairs shortest path | ii. Dynamic Programming |
3. Binary search on a sorted array | iii. Greedy design |
4. Backtracking search on a graph | iv. Depth-first search |
v. Breadth-first search |
Match the above algorithms on the left to the corresponding design paradigm they follow.
- A.
1-i, 2-iii, 3-i, 4-v.
- B.
1-iii, 2-iii, 3-i, 4-v.
- C.
1-iii, 2-ii, 3-i, 4-iv.
- D.
1-iii, 2-ii, 3-i, 4-v.
Attempted by 183 students.
Sign up free to check your answer
Sign up freeLoading lesson…