Optimality of BFS is a) When there is less number of nodes b) When all step costs are equal c) When all step costs are unequal d) Both a & c

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  

---

A complete, local search algorithm always finds goal if one exists, an optimal algorithm always finds a global minimum/maximum. State whether True or False. a) True b) False

0 Answers  

---

What kind of environment is crossword puzzle? a) Static b) Dynamic c) Semidynamic d) None of the mentioned

2 Answers  

---

When do we call the states are safely explorable? a) A goal state is unreachable from any state b) A goal state is denied access c) A goal state is reachable from every state d) None of the mentioned

3 Answers  

---

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

0 Answers  

---

The Task Environment of an agent consists of a) Sensors b) Actuators c) Performance Measures d) Environment

0 Answers  

---

Where does the performance measure is included? a) Rational agent b) Task environment c) Actuators d) Sensor

0 Answers  

---

Solving a constraint satisfaction problem on a finite domain is an/a ___________ problem with respect to the domain size. a) P complete b) NP complete c) NP hard d) Domain dependent

0 Answers  

---

What is a difference in robot system and ai programs?

0 Answers  

---

Which is used to select the particular environment to run the agent? a) Environment creator b) Environment Generator c) Both a & b d) None of the mentioned

1 Answers  

---

List some of the various tools used in robotics?

0 Answers  

---