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_THE_NEW_STATES_ARE_GENERATED_IN_GENETIC_ALGORITHM??$ |
| A. | Composition |
| B. | Mutation |
| C. | Cross-over |
| D. | Both Mutation & Cross-over |
| Answer» E. | |
| 2. |
Which_method_is_effective_for_escaping_from_local_minima?$ |
| A. | Updating heuristic estimate |
| B. | Reducing heuristic estimate |
| C. | Eliminating heuristic estimate |
| D. | None of the mentioned |
| Answer» B. Reducing heuristic estimate | |
| 3. |
What is meant by simulated annealing in artificial intelligence? |
| A. | Returns an optimal solution when there is a proper cooling schedule |
| B. | Returns an optimal solution when there is no proper cooling schedule |
| C. | It will not return an optimal solution when there is a proper cooling schedule |
| D. | None of the mentioned |
| Answer» B. Returns an optimal solution when there is no proper cooling schedule | |
| 4. |
Which search algorithm will use limited amount of memory? |
| A. | RBFS |
| B. | SMA* |
| C. | Hill-climbing search algorithm |
| D. | Both RBFS & SMA* |
| Answer» E. | |
| 5. |
Which of the following algorithm is online search algorithm? |
| A. | Breadth-first search algorithm |
| B. | Depth-first search algorithm |
| C. | Hill-climbing search algorithm |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 6. |
In which state spaces does the online-dfs-agent will work? |
| A. | Irreversible state spaces |
| B. | Reversible state spaces |
| C. | searchable state spaces |
| D. | All of the mentioned |
| Answer» C. searchable state spaces | |
| 7. |
When do we call the states are safely explorable? |
| A. | A goal state is unreachable from any state |
| B. | A goal state is denied access |
| C. | A goal state is reachable from every state |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 8. |
Which are necessary for an agent to solve an online search problem? |
| A. | Actions |
| B. | Step-cost function |
| C. | Goal-test |
| D. | All of the mentioned |
| Answer» E. | |
| 9. |
What is called as exploration problem? |
| A. | State and actions are unknown to the agent |
| B. | State and actions are known to the agent |
| C. | Only actions are known to agent |
| D. | None of the mentioned |
| Answer» B. State and actions are known to the agent | |
| 10. |
Which search agent operates by interleaving computation and action? |
| A. | Offline search |
| B. | Online search |
| C. | Breadth-first search |
| D. | Depth-first search |
| Answer» C. Breadth-first search | |