What is a robot?

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  

---

he process of removing detail from a given state representation is called______. a) Extraction b) Abstraction c) Information Retrieval d) Mining of data

1 Answers  

---

 Which search algorithm will use limited amount of memory? a) RBFS b) SMA* c) Hill-climbing search algorithm d) Both a & b

0 Answers  

---

 What kind of observing environments are present in artificial intelligence? a) Partial b) Fully c) Learning d) Both a & b

0 Answers  

---

Though local search algorithms are not systematic, key advantages would include a) Less memory b) More time c) Finds a solution in large infinite space d) No optimum solution

0 Answers  

---

The BACKTRACKING-SEARCH algorithm in Figure 5.3 has a very simple policy for what to do when a branch of the search fails: back up to the preceding variable and try a different value for it. This is called chronological-backtracking. It is also possible to go all the way to set of variable that caused failure. State whether True or False. a) True b) False

0 Answers  

---

What is single agent pathfinding problems?

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  

---

What is the action of task environment in artificial intelligence? a) Problem b) Solution c) Agent

0 Answers  

---

For building a bayes model how many terms are required?

0 Answers  

---

What kind of environment is crossword puzzle? a) Static b) Dynamic c) Semidynamic d) None of the mentioned

2 Answers  

---