Question

Which search algorithm will use limited amount of memory?

(a) RBFS

(b) SMA*

(c) Hill-climbing search algorithm

(d) Both RBFS & SMA*

I had been asked this question during an online interview.

Origin of the question is Online Search Agent topic in division Intelligent Agents of Artificial Intelligence

Select the correct answer from above options

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

Answer 1

Correct option is (d) Both RBFS & SMA*

To explain I would say: RBFE and SMA* will solve any kind of problem that A* can’t by using limited amount of memory.