Which search algorithm will use limited amount of memory?
a) RBFS
b) SMA*
c) Hill-climbing search algorithm
d) Both a & b


No Answer is Posted For this Question
Be the First to Post Answer

Post New Answer

More AI Robotics Interview Questions

What are the components of a robot?

0 Answers  


The term ___________ is used for a depth-first search that chooses values for one variable at a time and returns when a variable has no legal values left to assign. a) Forward search b) Backtrack search c) Hill algorithm d) Reverse-Down-Hill search

1 Answers  


In hidden markov model, how does the state of the process is described?

0 Answers  


Is intelligence inherited?

0 Answers  


 What is used for tracking uncertain events? a) Filtering algorithm b) Sensors c) Actuators d) None of the mentioned

0 Answers  






Which functions are used as preferences over state history? a) Award b) Reward c) Explicit d) Implicit

0 Answers  


Which environment is called as semidynamic? a) Environment does not change with the passage of time b) Agent performance changes c) Environment will be changed d) Both a & b

0 Answers  


Which were built in such a way that humans had to supply the inputs and interpret the outputs? a) Agents b) AI system c) Sensor d) Actuators

1 Answers  


Stochastic hill climbing chooses at random from among the uphill moves; the probability of selection can vary with the steepness of the uphil1 move. a) True b) False

0 Answers  


 In many problems the path to goal is irrelevant, this class of problems can be solved using, a) Informed Search Techniques b) Uninformed Search Techniques c) Local Search Techniques d) Only a and b

0 Answers  


What is the heuristic function of greedy best-first search? a) f(n) != h(n) b) f(n) < h(n) c) f(n) = h(n) d) f(n) > h(n)

0 Answers  


A solution to a problem is a path from the initial state to a goal state. Solution quality is measured by the path cost function, and an optimal solution has the highest path cost among all solutions. State whether true or false. a) True b) False

1 Answers  


Categories