1.

When is breadth-first search is optimal?(a) When there is less number of nodes(b) When all step costs are equal(c) When all step costs are unequal(d) None of the mentioned

Answer» Correct option is (b) When all step costs are equal

Easy explanation: Because it always expands the shallowest unexpanded node.


Discussion

No Comment Found

Related InterviewSolutions