Artificial Intelligence Questions & Answers – State Space Search

This set of Artificial Intelligence Multiple Choice Questions & Answers (MCQs) focuses on “State Space Search”.

1. 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
View Answer

Answer: b
Explanation: The straightforward approach for planning algorithm is state space search because it takes into account of everything for finding a solution.

2. What are taken into account of state-space search?
a) Postconditions
b) Preconditions
c) Effects
d) Both Preconditions & Effects
View Answer

Answer: d
Explanation: The state-space search takes both precondition and effects into account for solving a problem.

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

Answer: b
Explanation: There are two ways available to solve the state-space search. They are forward from the initial state and backward from the goal.
advertisement

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

Answer: a
Explanation: It is sometimes called as progression planning, because it moves in the forward direction.

5. How many states are available in state-space search?
a) 1
b) 2
c) 3
d) 4
View Answer

Answer: d
Explanation: There are four states available in state-space search. They are initial state, actions, goal test and step cost.
Free 30-Day Python Certification Bootcamp is Live. Join Now!

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

Answer: c
Explanation: The main advantage of backward search will allow us to consider only relevant actions.

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

Answer: a
Explanation: Backward state-space search will find the solution from goal to the action, So it is called as Regression planning.

8. What is meant by consistent in state-space search?
a) Change in the desired literals
b) Not any change in the literals
c) No change in goal state
d) None of the mentioned
View Answer

Answer: b
Explanation: Consistent means that the completed actions will not undo any desired literals.

9. What will happen if a predecessor description is generated that is satisfied by the initial state of the planning problem?
a) Success
b) Error
c) Compilation
d) Termination
View Answer

Answer: d
Explanation: None.
advertisement

10. Which approach is to pretend that a pure divide and conquer algorithm will work?
a) Goal independence
b) Subgoal independence
c) Both Goal & Subgoal independence
d) None of the mentioned
View Answer

Answer: b
Explanation: Subgoal independence approach is to pretend that a pure divide and conquer algorithm will work for admissible heuristics.

Sanfoundry Global Education & Learning Series – Artificial Intelligence.

advertisement
advertisement
Subscribe to our Newsletters (Subject-wise). Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social networks below and stay updated with latest contests, videos, internships and jobs!

Youtube | Telegram | LinkedIn | Instagram | Facebook | Twitter | Pinterest
Manish Bhojasia - Founder & CTO at Sanfoundry
I’m Manish - Founder and CTO at Sanfoundry. I’ve been working in tech for over 25 years, with deep focus on Linux kernel, SAN technologies, Advanced C, Full Stack and Scalable website designs.

You can connect with me on LinkedIn, watch my Youtube Masterclasses, or join my Telegram tech discussions.

If you’re in your 40s–60s and exploring new directions in your career, I also offer mentoring. Learn more here.