Question 4224 – 2008 December UGC NET Paper 1
February 13, 2024Algorithms
February 13, 2024Question 10554 – Algorithms
Match the pairs in the following questions:
(a) Strassen's matrix multiplication algorithm (p) Greedy method (b) Kruskal's minimum spanning tree algorithm (q) Dynamic programming (c) Biconnected components algorithm (r) Divide and Conquer (d) Floyd's shortest path algorithm (s) Depth first search
Correct Answer: A
Question 20 Explanation:
Strassen’s matrix multiplication algorithm – Divide and Conquer
Kruskal’s minimum spanning tree algorithm – Greedy method
Biconnected components algorithm – Depth first search
Floyd’s shortest path algorithm – Dynamic programming
Kruskal’s minimum spanning tree algorithm – Greedy method
Biconnected components algorithm – Depth first search
Floyd’s shortest path algorithm – Dynamic programming
(a) – (r), (b) – (p), (c) – (s), (d) – (q)