+1 vote
in Artificial Intelligence by
Which search method takes less memory?

(a) Depth-First Search

(b) Breadth-First search

(c) Linear Search

(d) Optimal search

I had been asked this question in an internship interview.

The above asked question is from Problem Solving 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
The correct answer is (a) Depth-First Search

To explain I would say: Depth-First Search takes less memory since only the nodes on the current path are stored, but in Breadth First Search, all of the tree that has generated must be stored.

Related questions

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