Match List I with List II
|
List I |
List II |
|
(A) Depth-Limited Search |
(I) Search stops after reaching a predefined depth |
|
(B) Bidirectional Search |
(II) Efficient when solution lies at a shallow depth |
|
(C) Simulated Annealing |
(III) Randomized algorithm that avoids local minima. |
|
(D) Iterative Deepening Search |
(IV) Combines features of depth-first and breadth-first search. |
Choose the correct answer from the options given below:
1
A - I, B - II, C - III, D - IV
2
A - IV, B - I, C - III, D - II
3
A - I, B - IV, C - III, D - II
4
A - I, B - II, C - IV, D - III