0 votes
in Artificial Intelligence by
Which data structure conveniently used to implement BFS?

(a) Stacks

(b) Queues

(c) Priority Queues

(d) All of the mentioned

This question was posed to me in unit test.

Question is taken from Uninformed Search and Exploration topic in chapter 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
Right answer is (b) Queues

Easy explanation: Queue is the most convenient data structure, but memory used to store nodes can be reduced by using circular queues.

Related questions

0 votes
asked Nov 1, 2021 in Artificial Intelligence by DavidAnderson
0 votes
asked Oct 23, 2021 in Artificial Intelligence by DavidAnderson
...