1. : Which of the following will occur when a predecessor description is produced that is satisfied by the initial state of the planning problem?
(A) Termination
(B) Error
(C) Compilation
(D) Success
2. : Which of the following technique is to pretend that a pure divide and conquer algorithm will work?
(A) Goal independence
(B) Subgoal independence
(C) Both Goal and Subgoal independence
(D) None of these
3. : State-space search can be solved in how many ways?
(A) 5
(B) 2
(C) 3
(D) 4
4. : Which of the following is the most basic technique for planning algorithms?
(A) Best-first search
(B) Hill-climbing search
(C) Depth-first search
(D) State-space search
5. : Which of the following is the key benefit of backward state-space search?
(A) Cost
(B) Actions
(C) Relevant actions
(D) All of these
6. : Backward state-space search is also known as?
(A) Regression planning
(B) Progression planning
(C) State planning
(D) Test planning
7. : Which is taken into account in state-space search?
(A) Postconditions
(B) Preconditions
(C) Effects
(D) B and C
8. : Forward state-space search is also known as?
(A) Progression planning
(B) Regression planning
(C) Test planning
(D) None of these
9. : The total number of states in the state-space search?
(A) 6
(B) 5
(C) 3
(D) 4
10. : Consistent in state-space search is the process of?
(A) Change in the desired literals
(B) No change in the goal state
(C) Not any change in the literals
(D) All of these