Teaching Haryana (HPSC) Assistant Professor Mock Test 2025 Algorithms Algorithm Design Techniques Dynamic Programming
Consider the following table:
|
Algorithms |
Design Paradigms |
|
(A) Minimum spanning tree |
(I) Divide and Conquer |
|
(B) Binary Search |
(II) Greedy |
|
(C) Fibonacci numbers |
(III) Dynamic Programming |
1
(A) ↔ (I), (B) ↔ (II), (C) ↔ (III)
2
(A) ↔ (II), (B) ↔ (III), (C) ↔ (I)
3
(A) ↔ (II), (B) ↔ (I), (C) ↔ (III)
4
(A) ↔ (III), (B) ↔ (I), (C) ↔ (II)
5
Question Not Attempted