Differentiate between the iqbot, metabot and a taskbot?

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

1 Answers  

---

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

0 Answers  

---

 A problem in a search space Is defined by, a) Initial state b) Goal test c) Intermediate states d) All of the above

0 Answers  

---

In inductive logic programming what needed to be satisfied?

0 Answers  

---

Artificial Intelligence has its expansion in the following application. (Mark all that apply) a) Planning and Scheduling b) Game Playing c) Diagnosis d) Robotics e) All of the above

1 Answers  

---

In hmm’s, what are the possible values of the variable?

0 Answers  

---

What can operate over the joint state space? a) Decision-making algorithm b) Learning algorithm c) Complex algorithm d) Both a & b

0 Answers  

---

What is lisp?

0 Answers  

---

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

0 Answers  

---

What are components of robotics?

0 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  

---