Hill climbing sometimes called ____________ because it grabs a good neighbor state without thinking ahead about where to go next. a) Needy local search b) Heuristic local search c) Greedy local search d) Optimal local search

1 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  

---

Which is the best way to go for game playing problem?

0 Answers  

---

Name some expert system technology?

0 Answers  

---

Give a brief introduction to robotics?

0 Answers  

---

Consider a problem of preparing a schedule for a class of student. This problem is a type of a) Search Problem b) Backtrack Problem c) CSP d) Planning Problem

0 Answers  

---

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

1 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  

---

 A problem in a search space Is defined by, a) Initial state b) Goal test c) Intermediate states d) All of the above

0 Answers  

---

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

0 Answers  

---

What are the characteristics of ai expert systems?

0 Answers  

---