MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 15 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. |
DEPTH-FIRST_SEARCH_ALWAYS_EXPANDS_THE________NODE_IN_THE_CURRENT_FRINGE_OF_THE_SEARCH_TREE.?$ |
| A. | Shallowest |
| B. | Child node |
| C. | Deepest |
| D. | Minimum cost |
| Answer» D. Minimum cost | |
| 2. |
Optimality of BFS is$ |
| A. | When there is less number of nodes |
| B. | When all step costs are equal |
| C. | When all step costs are unequal |
| D. | None of the mentioned |
| Answer» C. When all step costs are unequal | |
| 3. |
Breadth-first_search_always_expands_the________node_in_the_current_fringe_of_the_search_tree.$ |
| A. | Shallowest |
| B. | Child node |
| C. | Deepest |
| D. | Minimum cost |
| Answer» B. Child node | |
| 4. |
The main idea of Bidirectional search is to reduce the time complexity by searching two way simultaneously from start node and another from goal node. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 5. |
DFS is ______ efficient and BFS is __________ efficient. |
| A. | Space, Time |
| B. | Time, Space |
| C. | Time, Time |
| D. | Space, Space |
| Answer» B. Time, Space | |
| 6. |
For general graph, how one can get rid of repeated states? |
| A. | By maintaining a list of visited vertices |
| B. | By maintaining a list of traversed edges |
| C. | By maintaining a list of non-visited vertices |
| D. | By maintaining a list of non-traversed edges |
| Answer» B. By maintaining a list of traversed edges | |
| 7. |
When the environment of an agent is partially observable in search space following problem/problems could occur. |
| A. | Sensorless problems: If the agent has no sensors at all, then (as far as it knows) it could be in one of several possible initial states, and each action might therefore lead to one of several possible successor states |
| B. | Contingency problems: If the environment is partially observable or if actions are uncertain, then the agent’s percepts provide new information after each action. Each possible percept defines a contingency that must be planned for. A problem is called adversarial if the uncertainty is caused by the actions of another agent |
| C. | Exploration problems: When the states and actions of the environment are unknown, the agent must act to discover them. Exploration problems can be viewed as an extreme case of contingency problems |
| D. | All of the mentioned |
| Answer» E. | |
| 8. |
LIFO_is________where_as_FIFO_is_________ |
| A. | Stack, Queue |
| B. | Queue, Stack |
| C. | Priority Queue, Stack |
| D. | Stack. Priority Queue |
| Answer» B. Queue, Stack | |
| 9. |
uniform-cost search expands the node n with the_________? |
| A. | Lowest path cost |
| B. | Heuristic cost |
| C. | Highest path cost |
| D. | Average path cost |
| Answer» B. Heuristic cost | |
| 10. |
Breadth-first search is not optimal when all step costs are equal, because it always expands the shallowest unexpanded node. State whether true or false. |
| A. | True |
| B. | False |
| Answer» C. | |
| 11. |
The time and space complexity of BFS is (For time and space complexity problems consider b as branching factor and d as depth of the search tree.) |
| A. | O(bd+1) and O(bd+1) |
| B. | O(b2) and O(d2) |
| C. | O(d2) and O(b2) |
| D. | O(d2) and O(d2) |
| Answer» B. O(b2) and O(d2) | |
| 12. |
Which data structure conveniently used to implement BFS? |
| A. | Stacks |
| B. | Queues |
| C. | Priority Queues |
| D. | All of the mentioned |
| Answer» C. Priority Queues | |
| 13. |
Which of the following is/are Uninformed Search technique/techniques |
| A. | Breadth First Search (BFS) |
| B. | Depth First Search (DFS) |
| C. | Bidirectional Search |
| D. | All of the mentioned |
| Answer» E. | |
| 14. |
Strategies that know whether one non-goal state is “more promising” than another are called$ |
| A. | Informed & Unformed Search |
| B. | Unformed Search |
| C. | Heuristic & Unformed Search |
| D. | Informed & Heuristic Search |
| Answer» E. | |
| 15. |
Blind searching is general term for |
| A. | Informed Search |
| B. | Uninformed Search |
| C. | Informed & Unformed Search |
| D. | Heuristic Search |
| Answer» C. Informed & Unformed Search | |