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 is the degree of freedom in the robotics? How can it be determined?

0 Answers  

---

Which is the best way to go for game playing problem?

0 Answers  

---

What is hidden markov model (hmms) is used?

0 Answers  

---

In artificial intelligence, what do semantic analyses used for?

0 Answers  

---

 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  

---

 Which were built in such a way that humans had to supply the inputs and interpret the outputs? a) Agents b) AI system c) Sensor d) Actuators

0 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  

---

 Which is used to improve the performance of heuristic search? a) Quality of nodes b) Quality of heuristic function c) Simple form of nodes d) None of the mentioned

0 Answers  

---

Which functions are used as preferences over state history? a) Award b) Reward c) Explicit d) Implicit

0 Answers  

---

 In many problems the path to goal is irrelevant, this class of problems can be solved using, a) Informed Search Techniques b) Uninformed Search Techniques c) Local Search Techniques d) Only a and b

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  

---