+1 vote
in Artificial Intelligence by
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

This question was posed to me during an interview.

Question is taken from Uninformed Search Strategy in portion Problem Solving of Artificial Intelligence

Select the correct answer from above options

Interview Questions and Answers, Database Interview Questions and Answers for Freshers and Experience

1 Answer

0 votes
by
Correct option is (b) When all step costs are equal

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

Related questions

+1 vote
asked Nov 1, 2021 in Artificial Intelligence by DavidAnderson
+1 vote
asked Nov 1, 2021 in Artificial Intelligence by DavidAnderson
...