Engineering Questions with Answers - Multiple Choice Questions
Artificial Intelligence MCQ – Partial Order Planning – 1
1 - Question
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
Answer: a
Explanation: Forward and backward state-space search are particular forms of totally ordered plan search.
2 - Question
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
Answer: c
Explanation: As the search explore only linear sequences of actions, So they cannot take advantage of problem decomposition.
3 - Question
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
Answer: b
Explanation: Totally ordered plan has the advantage of flexibility in the order in which it constructs the plan.
4 - Question
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
Answer: b
Explanation: The general strategy of delaying a choice during search is called the least commitment strategy.
5 - Question
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
Answer: d
Explanation: Any planning algorithm that can place two actions into a plan without specifying which should come first is called partial-order planner.
6 - Question
How many possible plans are available in partial-order solution?
a) 3
b) 4
c) 5
d) 6
View Answer
Answer: d
Explanation: The partial-order solution corresponds to six possible total-order plans.
7 - Question
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
Answer: b
Explanation: Each and every total order plan is also called as linearization of the partial-order plan.
8 - Question
What are present in the empty plan?
a) Start
b) Finish
c) Modest
d) Both Start & Finish
View Answer
Answer: d
Explanation: The ’empty’ plan contains just the start and finish actions.
9 - Question
What are not present in start actions?
a) Preconditions
b) Effect
c) Finish
d) None of the mentioned
View Answer
Answer: a
Explanation: Start has no precondition and has as its effects all the literals in the initial state of the planning problem.
10 - Question
What are not present in finish actions?
a) Preconditions
b) Effect
c) Finish
d) None of the mentioned
View Answer
Answer: b
Explanation: Finish has no effects and has as its preconditions the goal literals of the planning algorithm.
11 - Question
Which can be adapted for planning algorithms?
a) Most-constrained variable
b) Most-constrained literal
c) Constrained
d) None of the mentioned
View Answer
Answer: a
Explanation: The most-constrained variable heuristic from CSPs can be adapted for planning algorithm and seems to work well.