edited by
626 views
0 votes
0 votes

Match List I with List II and choose the correct answer from the code given below.

List I List II
(a) Greedy Best-First Search (i) Selects a node 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 on the quality of heuristic

Code:

  1. (a) – (i), (b)-(ii), (c)-(iii), (d)-(iv)
  2. (a) – (iv), (b)-(i), (c)-(ii), (d)-(iii)
  3. (a) – (iv), (b)-(iii), (c)-(ii), (d)-(i)
  4. (a) – (i), (b)-(iv), (c)-(iii), (d)-(ii)
edited by

Please log in or register to answer this question.

Related questions

1 votes
1 votes
0 answers
3
0 votes
0 votes
2 answers
4
Arjun asked Jan 2, 2019
4,324 views
Consider the graph shown below:Use Kruskal’s algorithm to find the minimum spanning tree of the graph. The weight of this minimum spanning tree is$17$$14$$16$$13$