___________ 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  

---

Artificial Intelligence has its expansion in the following application. (Mark all that apply) a) Planning and Scheduling b) Game Playing c) Diagnosis d) Robotics e) All of the above

1 Answers  

---

What are aspects of robotics?

0 Answers  

---

How the new states are generated in genetic algorithm? a) Composition b) Mutation c) Cross-over d) Both b & c

0 Answers  

---

In artificial intelligence, what do semantic analyses used for?

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  

---

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  

---

What are the capabilities of expert systems?

0 Answers  

---

How logical inference can be solved in propositional logic?

0 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  

---

Mention the difference between statistical ai and classical ai ?

0 Answers  

---

Why do we implement ai in the robots?

0 Answers  

---