_________________ are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations. a) Constraints Satisfaction Problems b) Uninformed Search Problems c) Local Search Problems d) Only a) and b)

0 Answers  

---

The Set of actions for a problem in a state space is formulated by a ___________. a) Intermediate states b) Initial state c) Successor function, which takes current action and returns next immediate state d) None of the mentioned

0 Answers  

---

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

1 Answers  

---

What are the characteristics of ai expert systems?

0 Answers  

---

What are expert systems limitations?

0 Answers  

---

In top-down inductive learning methods how many literals are available? What are they?

0 Answers  

---

A solution to a problem is a path from the initial state to a goal state. Solution quality is measured by the path cost function, and an optimal solution has the highest path cost among all solutions. State whether true or false. a) True b) False

1 Answers  

---

To overcome the need to backtrack in constraint satisfaction problem can be eliminated by a) Forward Searching b) Constraint Propagation c) Backtrack after a forward search d) Omitting the constraints and focusing only on goals

1 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  

---

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

0 Answers  

---

What are components of robotics?

0 Answers  

---

Specify the agent architecture name that is used to capture all kinds of actions. a) Complex b) Relational c) Hybrid d) None of the mentioned

0 Answers  

---