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  

---

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

0 Answers  

---

Which of the Following problems can be modeled as CSP? a) 8-Puzzle problem b) 8-Queen problem c) Map coloring problem d) Sudoku

0 Answers  

---

What is the purpose of intelligence?

0 Answers  

---

Satellite Image Analysis System is (Choose the one that is not applicable). a) Episodic b) Semi-Static c) Single agent d) Partially Observable

1 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 the use of the function (copy-list <list>) in lisp?

0 Answers  

---

In which state spaces does the online-dfs-agent will work? a) Irreversible state spaces b) Reversible state spaces c) searchable state spaces d) All of the mentioned

0 Answers  

---

Which was the first industrial robot?

0 Answers  

---

What are the components of a robot?

0 Answers  

---

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

0 Answers  

---

What is the space complexity of Greedy search? a) O(b) b) O(bl) c) O(m) d) O(bm)

1 Answers  

---