Match the following with respect to algorithm paradigms (a) The 8-Queen’s…
2018
Match the following with respect to algorithm paradigms
(a) The 8-Queen’s Problem
(b) Single-source shortest path
(c) Strassen’s Matrix
(d) Optimal binary search trees
(i) Dynamic Programming
(ii) Divide and Conquer
(iii) Greedy approach
(iv) Backtracking
- A.
(iv) (i) (iii) (ii)
- B.
(iv) (iii) (i) (ii)
- C.
(iii) (iv) (ii) (i)
- D.
(iv) (iii) (ii) (i)
Attempted by 12 students.
Show answer & explanation
Correct answer: D
The correct matches are: 8-Queen’s Problem uses Backtracking (iv). Single-source shortest path algorithms like Dijkstra's use a Greedy approach (iii). Strassen’s Matrix multiplication utilizes Divide and Conquer (ii). Optimal binary search trees are solved using Dynamic Programming (i).
A video solution is available for this question — log in and enroll to watch it.