Match List I with List II
|
List I |
List II |
|
(A) Depth-First Search |
(I) Complete and optimal with admissible heuristic |
|
(B) Breadth-First Search |
(II) May fail on infinite search spaces without proper depth limit |
|
(C) Iterative Deepening Search |
(III) Uses less memory but can revisit nodes. |
|
(D) Uniform Cost Search |
(IV) Expands shallowest unexpanded node first. |
Choose the correct answer from the options given below:
1
A - II, B - IV, C - III, D - I
2
A - III, B - IV, C - II, D - I
3
A - II, B - III, C - IV, D - I
4
A - IV, B - I, C - III, D - II