What kind of environment is strategic in artificial intelligence? a) Deterministic b) Rational c) Partial d) Stochastic

1 Answers  

---

What is user interface?

0 Answers  

---

What are industrial robots?

0 Answers  

---

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

0 Answers  

---

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

0 Answers  

---

---

_________________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations. a) Constraints Satisfaction Problems b) Uninformed Search Problems c) Local Search Problems d) Only a) and b)

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  

---

How many types of agents are there in artificial intelligence? a) 1 b) 2 c) 3 d) 4

1 Answers  

---

 Which method is effective for escaping from local minima? a) Updating heuristic estimate b) Reducing heuristic estimate c) Eliminating heuristic estimate d) None of the mentioned

2 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  

---

What is single agent pathfinding problems?

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  

---