Question 11 : What will happen if a predecessor description is generated that is satisfied by the initial state of the planning problem?
1. Success
2. Error
3. Compilation
4. Termination
View Answer   Discuss with Members

Question 12 : What is meant by consistent in state-space search?
1. Change in the desired literals
2. Not any change in the literals
3. No change in goal state
4. None of the mentioned
View Answer   Discuss with Members

Question 13 : What is the other name of backward state-space search?
1. Regression planning
2. Progression planning
3. State planning
4. Test planning
View Answer   Discuss with Members

Question 14 : What is the main advantage of backward state-space search?
1. Cost
2. Actions
3. Relevant actions
4. All of the mentioned
View Answer   Discuss with Members

Question 15 : How many states are available in state-space search?
1. 1
2. 2
3. 3
4. 4
View Answer   Discuss with Members

Question 16 : What is the other name for forward state-space search?
1. Progression planning
2. Regression planning
3. Test planning
4. None of the mentioned
View Answer   Discuss with Members

Question 17 : How many ways are available to solve the state-space search?
1. 1
2. 2
3. 3
4. 4
View Answer   Discuss with Members

Question 18 : What are taken into account of state-space search?
1. Postconditions
2. Preconditions
3. Effects
4. Both Preconditions & Effects
View Answer   Discuss with Members

Question 19 : Which is the most straightforward approach for planning algorithm?
1. Best-first search
2. State-space search
3. Depth-first search
4. Hill-climbing search
View Answer   Discuss with Members

Question 20 : The complexity of minimax algorithm is
1. Same as of DFS
2. Space - bm and time – bm
3. Time - bm and space – bm
4. Same as BFS
View Answer   Discuss with Members