Gate2017 cs Q14
0. Consider the following table:
| Algorithms | Design Paradigms | ||
| P. | Kruskal | i. | Divide and conquer |
| Q. | Quicksort | ii. | Greedy |
| R. | Floyd-Warshall | iii | Dynamic Programming |
- Option : C
- Explanation : Kruskal’s algorithm follows greedy approach in order to find MST of a connected graph. Quick sort follows divide and conquer strategy. Floyd Warshal algorithm is used to find the shortest path between every pair of vertices and it follows dynamic programming strategy.
