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

This question was posed to me during an interview.

I need to ask this question from Uninformed Search and Exploration topic 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 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.

Related questions

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