Which of the following algorithm is online search algorithm? a) Breadth-first search algorithm b) Depth-first search algorithm c) Hill-climbing search algorithm d) None of the mentioned

0 Answers  

---

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

0 Answers  

---

What are industrial robots?

0 Answers  

---

What is natural language processing?

0 Answers  

---

To overcome the need to backtrack in constraint satisfaction problem can be eliminated by a) Forward Searching b) Constraint Propagation c) Backtrack after a forward search d) Omitting the constraints and focusing only on goals

0 Answers  

---

One of the main cons of hill-climbing search is, a) Terminates at local optimum b) Terminates at global optimum c) Does not find optimum solution d) Fail to find a solution

0 Answers  

---

The BACKTRACKING-SEARCH algorithm in Figure 5.3 has a very simple policy for what to do when a branch of the search fails: back up to the preceding variable and try a different value for it. This is called chronological-backtracking. It is also possible to go all the way to set of variable that caused failure. State whether True or False. a) True b) False

0 Answers  

---

What is travelling salesman problem?

0 Answers  

---

How the new states are generated in genetic algorithm? a) Composition b) Mutation c) Cross-over d) Both b & c

0 Answers  

---

Give a brief introduction to robotics?

0 Answers  

---

Hill-Climbing approach stuck for the following reasons a) Local maxima b) Ridges c) Plateaux d) All of above

0 Answers  

---

Which search uses only the linear space for searching? a) Best-first search b) Recursive best-first search c) Depth-first search d) None of the mentioned

0 Answers  

---