Question 4387 – 2009 June UGC NET Paper 1
December 4, 2023Question 4435 – 2010 December UGC NET Paper 1
December 4, 2023NTA UGC NET DEC-2022 Paper-2
|
Question 37
|
The A* algorithm is optimal when,
|
It always finds the solution with the lowest total cost if the heuristic ‘h’ is admissible.
|
|
|
Always finds the solution with the highest total cost if the heuristic ‘h’ is admissible.
|
|
|
Finds the solution with the lowest total cost if the heuristic ‘h’ is not admissible.
|
|
|
It always finds the solution with the highest total cost if the heuristic ‘h’ is not admissible.
|
Correct Answer: A