11. Where does the values of alpha-beta search get updated?
a. Along the path of search
b. Initial state itself
c. At the end
d. None of the mentioned
Answer: (a).Along the path of search

12. Which value is assigned to alpha and beta in the alpha-beta pruning?
a. Alpha = max
b. Beta = min
c. Beta = max
d. Both a & b
Answer: (d).Both a & b

13. To which depth does the alpha-beta pruning can be applied?
a. 10 states
b. 8 States
c. 6 States
d. Any depth
Answer: (d).Any depth

14. Which values are independent in minimax search algorithm?
a. Pruned leaves x and y
b. Every state is dependent
c. Root is independent
d. None of the mentioned
Answer: (a).Pruned leaves x and y

15. Which is the most straightforward approach for planning algorithm?
a. Best-first search
b. State-space search
c. Depth-first search
d. Hill-climbing search
Answer: (b).State-space search

16. What are conditions taken into account of state-space search?
a. Post conditions
b. Preconditions
c. Effects
d. Both b & c
Answer: (d).Both b & c

17. How many ways are available to solve the state-space search?
a. 1
b. 2
c. 3
d. 4
Answer: (b).2

18. What is the other name for forward state-space search?
a. Progression planning
b. Regression planning
c. Test planning
d. None of the mentioned
Answer: (a).Progression planning

19. What is the main advantage of backward state-space search?
a. Cost
b. Actions
c. Relevant actions
d. All of the mentioned
Answer: (c).Relevant actions

20. What is the other name of backward state-space search?
a. Regression planning
b. Progression planning
c. State planning
d. Test planning
Answer: (a).Regression planning

Page 2 of 4