Hill-Climbing algorithm terminates when,
a) Stopping criterion met
b) Global Min/Max is achieved
c) No neighbor has higher value
d) Local Min/Max is achieved


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

Post New Answer

More AI Robotics Interview Questions

 What is the expansion if PEAS in task environment? a) Peer, Environment, Actuators, Sense b) Perceiving, Enivornment, Actuators, Sensors c) Performance, Environment, Actuators, Sensors, d) None of the mentioned

1 Answers  


What is the space complexity of Greedy search? a) O(b) b) O(bl) c) O(m) d) O(bm)

1 Answers  


What is the rule of simple reflex agent? a) Simple-action rule b) Condition-action rule c) Both a & b d) None of the mentioned

0 Answers  


What are expert systems limitations?

0 Answers  


What is not represented by using propositional logic? a) Objects b) Relations c) Both a & b d) None of the mentioned

0 Answers  






Differentiate between the iqbot, metabot and a taskbot?

0 Answers  


For building a bayes model how many terms are required?

0 Answers  


What is the degree of freedom in the robotics? How can it be determined?

0 Answers  


What is computer vision?

0 Answers  


What are industrial robots? Explain the various types of industrial robots?

0 Answers  


What does a hybrid bayesian network contain?

0 Answers  


The main task of a problem-solving agent is a) Solve the given problem and reach to goal b) To find out which sequence of action will get it to the goal state c) Both a) and b) d) Neither a) nor b)

0 Answers  


Categories