An algorithm A is admissible if ___________ A. It is not guaranteed to return an optimal solution when one exists B. It is guaranteed to return an optimal solution when one exists C. It returns more solutions, but not an optimal one D. It guarantees to return more optimal solutions

[amp_mcq option1=”It is not guaranteed to return an optimal solution when one exists” option2=”It is guaranteed to return an optimal solution when one exists” option3=”It returns more solutions, but not an optimal one” option4=”It guarantees to return more optimal solutions” correct=”option2″]

The correct answer is: B. It is guaranteed to return an optimal solution when one exists.

An admissible algorithm is one that always returns a solution that is no worse than the optimal solution. In other words, if an optimal solution exists, then an admissible algorithm will always find it.

Option A is incorrect because an admissible algorithm is guaranteed to return an optimal solution when one exists.

Option C is incorrect because an admissible algorithm is guaranteed to return an optimal solution, not more solutions.

Option D is incorrect because an admissible algorithm does not guarantee to return more optimal solutions.