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

4142

---

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

3051

---

 A problem solving approach works well for a) 8-Puzzle problem b) 8-queen problem c) Finding a optimal path from a given source to a destination d) Mars Hover (Robot Navigation)

3208

---

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

2192

---

How many successors are generated in backtracking search? a) 1 b) 2 c) 3 d) 4

3965

---

 In A* approach evaluation function is a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost

4961

---

 In A* approach evaluation function is a) Heuristic function b) Path cost from start node to current node c) Path cost from start node to current node + Heuristic cost d) Average of Path cost from start node to current node and Heuristic cost

2149

---

 A* is optimal if h(n) is an admissible heuristic-that is, provided that h(n) never underestimates the cost to reach the goal. a) True b) False

2293

---

What is the other name of informed search strategy? a) Simple search b) Heuristic search c) Online search d) None of the mentioned

5228

---

What is the heuristic function of greedy best-first search? a) f(n) != h(n) b) f(n) < h(n) c) f(n) = h(n) d) f(n) > h(n)

1564

---

Which search uses only the linear space for searching? a) Best-first search b) Recursive best-first search c) Depth-first search d) None of the mentioned

3043

---

Which method is used to search better by learning? a) Best-first search b) Depth-first search c) Metalevel state space d) None of the mentioned

3986

---

 Which is used to improve the performance of heuristic search? a) Quality of nodes b) Quality of heuristic function c) Simple form of nodes d) None of the mentioned

4858

---

 In many problems the path to goal is irrelevant, this class of problems can be solved using, a) Informed Search Techniques b) Uninformed Search Techniques c) Local Search Techniques d) Only a and b

2777

---

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

2212

---