Teaching UGC NET Mock Test Series 2025 (Paper 1 & 2) Algorithms Algorithm Design Techniques Dynamic Programming
Match the following with respect to algorithm paradigms:
|
|
List - I |
|
List - II |
|
(a) |
The 8-Queen’s problem |
(i) |
Dynamic programming |
|
(b) |
Single-Source shortest paths |
(ii) |
Divide and conquer |
|
(c) |
STRASSEN’s Matrix multiplication |
(iii) |
Greedy approach |
|
(d) |
Optimal binary search trees |
(iv) |
Backtracking |
1
(a) - (iv), (b) - (i), (c) - (iii), (d) - (ii)
2
(a) - (iv), (b) - (iii), (c) - (i), (d) - (ii)
3
(a) - (iii), (b) - (iv), (c) - (ii), (d) - (i)
4
(a) - (iv), (b) - (iii), (c) - (ii), (d) - (i)