MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 10 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. |
HOW_MANY_CONDITIONS_ARE_AVAILABLE_BETWEEN_TWO_ACTIONS_IN_MUTEX_RELATION??$ |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» D. 4 | |
| 2. |
What_is_called_inconsistent_support?$ |
| A. | If two literals are not negation of other |
| B. | If two literals are negation of other |
| C. | Mutually exclusive |
| D. | None of the mentioned |
| Answer» C. Mutually exclusive | |
| 3. |
When will further expansion is unnecessary for planning graph? |
| A. | Identical |
| B. | Replicate |
| C. | Not identical |
| D. | None of the mentioned |
| Answer» B. Replicate | |
| 4. |
What is meant by persistence actions? |
| A. | Allow a literal to remain false |
| B. | Allow a literal to remain true |
| C. | Allow a literal to remain false & true |
| D. | None of the mentioned |
| Answer» C. Allow a literal to remain false & true | |
| 5. |
Which kind of problem are suitable for planning graph? |
| A. | Propositional planning problem |
| B. | Planning problem |
| C. | Action problem |
| D. | None of the mentioned |
| Answer» B. Planning problem | |
| 6. |
What are present in each level of planning graph? |
| A. | Literals |
| B. | Actions |
| C. | Variables |
| D. | Both Literals & Actions |
| Answer» E. | |
| 7. |
What is the starting level of planning graph? |
| A. | Level 3 |
| B. | Level 2 |
| C. | Level 1 |
| D. | Level 0 |
| Answer» E. | |
| 8. |
What are present in the planning graph? |
| A. | Sequence of levels |
| B. | Literals |
| C. | Variables |
| D. | Heuristic estimates |
| Answer» B. Literals | |
| 9. |
Which is used to extract solution directly from the planning graph? |
| A. | Planning algorithm |
| B. | Graphplan |
| C. | Hill-climbing search |
| D. | All of the mentioned |
| Answer» C. Hill-climbing search | |
| 10. |
Which data structure is used to give better heuristic estimates? |
| A. | Forwards state-space |
| B. | Backward state-space |
| C. | Planning graph algorithm |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |