Which are necessary for an agent to solve an online search problem? a) Actions b) Step-cost function c) Goal-test d) All of the mentioned

0 Answers  

---

What is “generality” in ai ?

0 Answers  

---

What is the use of the function (copy-list <list>) in lisp?

0 Answers  

---

Constraint satisfaction problems on finite domains are typically solved using a form of ___________. a) Search Algorithms b) Heuristic Search Algorithms c) Greedy Search Algorithms d) DFS/BFS Search Algorithms

0 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  

---

---

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

0 Answers  

---

Is intelligence inherited?

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  

---

Consider a problem of preparing a schedule for a class of student. This problem is a type of a) Search Problem b) Backtrack Problem c) CSP d) Planning Problem

0 Answers  

---

Specify the agent architecture name that is used to capture all kinds of actions. a) Complex b) Relational c) Hybrid d) None of the mentioned

0 Answers  

---

What is a robot locomotion?

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  

---