Match List 1 with List 2 and choose the correct answer from the code given below
|
List 1 |
List 2 |
|
a) Greedy best-first search |
i) Selects a code for expansion if optimal path to that node has been found |
|
b) A* Search |
ii) Avoids substantial overhead associated with keeping the sorted queue of nodes |
|
c) Recursive best-first search |
iii) Suffers from excessive node generation |
|
d) Iterative-deepening A* Search |
iv) Time complexity depends upon the quality of heuristic |
1
(a)-(iv), (b)-(iii), (c) -(ii), (d)-(i)
2
(a)-(i), (b)-(iv), (c) -(iii), (d)-(ii)
3
(a)-(iv), (b)-(i), (c) -(ii), (d)-(iii)
4
(a)-(i), (b)-(ii), (c) -(iii), (d)-(iv)