1.

Breadth-first search always expands the ______ node in the current fringe of the search tree.(a) Shallowest(b) Child node(c) Deepest(d) Minimum cost

Answer» Correct answer is (a) Shallowest

Easiest explanation: Breadth-first search always expands the shallowest node in the current fringe of the search tree. Traversal is performed level wise.


Discussion

No Comment Found

Related InterviewSolutions