MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 9 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. |
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 |
| Answer» C. Both Goal & Subgoal independence | |
| 2. |
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 |
| Answer» E. | |
| 3. |
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 |
| Answer» C. No change in goal state | |
| 4. |
What is the main advantage of backward state-space search? |
| A. | Cost |
| B. | Actions |
| C. | Relevant actions |
| D. | All of the mentioned |
| Answer» D. All of the mentioned | |
| 5. |
How many states are available in state-space search? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» E. | |
| 6. |
What is the other name for forward state-space search? |
| A. | Progression planning |
| B. | Regression planning |
| C. | Test planning |
| D. | None of the mentioned |
| Answer» B. Regression planning | |
| 7. |
How many ways are available to solve the state-space search? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» C. 3 | |
| 8. |
What are taken into account of state-space search? |
| A. | Postconditions |
| B. | Preconditions |
| C. | Effects |
| D. | Both Preconditions & Effects |
| Answer» E. | |
| 9. |
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 |
| Answer» C. Depth-first search | |