Register Now

Login

Lost Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

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: b
Explanation: Because it always expands the shallowest unexpanded node.

Join The Discussion