This set of Artificial Intelligence Multiple Choice Questions & Answers (MCQs) focuses on “Partial Order Planning – 1”.
1. Which of the following search belongs to totally ordered plan search?
a) Forward state-space search
b) Hill-climbing search
c) Depth-first search
d) Breadth-first search
View Answer
Explanation: Forward and backward state-space search are particular forms of totally ordered plan search.
2. Which cannot be taken as advantage for totally ordered plan search?
a) Composition
b) State search
c) Problem decomposition
d) None of the mentioned
View Answer
Explanation: As the search explore only linear sequences of actions, So they cannot take advantage of problem decomposition.
3. What is the advantage of totally ordered plan in constructing the plan?
a) Reliability
b) Flexibility
c) Easy to use
d) All of the mentioned
View Answer
Explanation: Totally ordered plan has the advantage of flexibility in the order in which it constructs the plan.
4. Which strategy is used for delaying a choice during search?
a) First commitment
b) Least commitment
c) Both First & Least commitment
d) None of the mentioned
View Answer
Explanation: The general strategy of delaying a choice during search is called the least commitment strategy.
5. Which algorithm places two actions into a plan without specifying which should come first?
a) Full-order planner
b) Total-order planner
c) Semi-order planner
d) Partial-order planner
View Answer
Explanation: Any planning algorithm that can place two actions into a plan without specifying which should come first is called partial-order planner.
6. How many possible plans are available in partial-order solution?
a) 3
b) 4
c) 5
d) 6
View Answer
Explanation: The partial-order solution corresponds to six possible total-order plans.
7. What is the other name of each and every total-order plans?
a) Polarization
b) Linearization
c) Solarization
d) None of the mentioned
View Answer
Explanation: Each and every total order plan is also called as linearization of the partial-order plan.
8. What are present in the empty plan?
a) Start
b) Finish
c) Modest
d) Both Start & Finish
View Answer
Explanation: The ’empty’ plan contains just the start and finish actions.
9. What are not present in start actions?
a) Preconditions
b) Effect
c) Finish
d) None of the mentioned
View Answer
Explanation: Start has no precondition and has as its effects all the literals in the initial state of the planning problem.
10. What are not present in finish actions?
a) Preconditions
b) Effect
c) Finish
d) None of the mentioned
View Answer
Explanation: Finish has no effects and has as its preconditions the goal literals of the planning algorithm.
11. Which can be adapted for planning algorithms?
a) Most-constrained variable
b) Most-constrained literal
c) Constrained
d) None of the mentioned
View Answer
Explanation: The most-constrained variable heuristic from CSPs can be adapted for planning algorithm and seems to work well.
Sanfoundry Global Education & Learning Series – Artificial Intelligence.
To practice all areas of Artificial Intelligence, here is complete set of 250+ Multiple Choice Questions and Answers on Artificial Intelligence.
If you find a mistake in question / option / answer, kindly take a screenshot and email to [email protected]
- Check Computer Science Books
- Check Artificial Intelligence Books
- Apply for Computer Science Internship
- Practice Computer Science MCQs
