

MCQOPTIONS
Saved Bookmarks
This section includes 11 Mcqs, each offering curated multiple-choice questions to sharpen your Artificial Intelligence knowledge and support exam preparation. Choose a topic below to get started.
1. |
WHAT_ARE_NOT_PRESENT_IN_START_ACTIONS??$ |
A. | Preconditions |
B. | Effect |
C. | Finish |
D. | None of the mentioned |
Answer» B. Effect | |
2. |
Which can be adapted for planning algorithm?$ |
A. | Most-constrained variable |
B. | Most-constrained literal |
C. | constrained |
D. | None of the mentioned |
Answer» B. Most-constrained literal | |
3. |
What_are_not_present_in_finish_actions?$ |
A. | Preconditions |
B. | Effect |
C. | Finish |
D. | None of the mentioned |
Answer» C. Finish | |
4. |
What are present in the empty plan? |
A. | Start |
B. | Finish |
C. | Modest |
D. | Both Start & Finish |
Answer» E. | |
5. |
What is the other name of each and every total-order plans? |
A. | Polarization |
B. | Linearization |
C. | Solarization |
D. | None of the mentioned |
Answer» C. Solarization | |
6. |
How many possible plans are available in partial-order solution? |
A. | 3 |
B. | 4 |
C. | 5 |
D. | 6 |
Answer» E. | |
7. |
Which algorithm place 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 |
Answer» E. | |
8. |
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 |
Answer» C. Both First & Least commitment | |
9. |
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 |
Answer» C. Easy to use | |
10. |
Which cannot be taken as advantage for totally ordered plan search? |
A. | Composition |
B. | State search |
C. | Problem decomposition |
D. | None of the mentioned |
Answer» D. None of the mentioned | |
11. |
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 |
Answer» B. Hill-climbing search | |