What is the other name of informed search strategy? a) Simple search b) Heuristic search c) Online search d) None of the mentioned

0 Answers  

---

What is the heuristic function of greedy best-first search? a) f(n) != h(n) b) f(n) < h(n) c) f(n) = h(n) d) f(n) > h(n)

0 Answers  

---

___________ algorithm keeps track of k states rather than just one. a) Hill-Climbing search b) Local Beam search c) Stochastic hill-climbing search d) Random restart hill-climbing search

0 Answers  

---

The game of Poker is a single agent. a) True b) False

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  

---

The problem-solving agent with several immediate options of unknown value can decide what to do by just examining different possible sequences of actions that lead to states of known value, and then choosing the best sequence. This process of looking for such a sequence is called Search. State True or False a) True b) False

0 Answers  

---

What is user interface?

0 Answers  

---

What are some of the benefits of using a blue prism for robotics?

0 Answers  

---

What is “generality” in ai ?

0 Answers  

---

What is autonomous robot?

0 Answers  

---

An agent is composed of, a) Architecture b) Agent Function c) Perception Sequence d) Architecture and Program

2 Answers  

---

When do we call the states are safely explorable? a) A goal state is unreachable from any state b) A goal state is denied access c) A goal state is reachable from every state d) None of the mentioned

3 Answers  

---