Answer Posted / kojo

True

 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

2813

---

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

1909

---

List the name of the areas where the robotics can be applied?

1105

---

In hidden markov model, how does the state of the process is described?

1135

---

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

2242

---

What does a hybrid bayesian network contain?

1221

---

 A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never underestimates the cost to reach the goal. a) True b) False

2387

---

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

2052

---

What is fopl stands for and explain its role in artificial intelligence?

1293

---

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

2631

---

Which technology uses miniaturized accelerometers and gyroscopes? a) Sensors b) Actuators c) MEMS (MicroElectroMechanical System) d) None of the mentioned

1820

---

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

2246

---

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

2497

---

Which was the first industrial robot?

936

---

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

2371

---