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. |
WHICH_IS_USED_TO_IMPROVE_THE_PERFORMANCE_OF_HEURISTIC_SEARCH??$ |
| A. | Quality of nodes |
| B. | Quality of heuristic function |
| C. | Simple form of nodes |
| D. | None of the mentioned |
| Answer» C. Simple form of nodes | |
| 2. |
Which_search_method_will_expand_the_node_that_is_closest_to_the_goal?$ |
| A. | Best-first search |
| B. | Greedy best-first search |
| C. | A* search |
| D. | None of the mentioned |
| Answer» C. A* search | |
| 3. |
Which search is complete and optimal when h(n) is consistent? |
| A. | Best-first search |
| B. | Depth-first search |
| C. | Both Best-first & Depth-first search |
| D. | A* search |
| Answer» E. | |
| 4. |
Which method is used to search better by learning? |
| A. | Best-first search |
| B. | Depth-first search |
| C. | Metalevel state space |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 5. |
Which search uses only the linear space for searching? |
| A. | Best-first search |
| B. | Recursive best-first search |
| C. | Depth-first search |
| D. | None of the mentioned |
| Answer» C. Depth-first search | |
| 6. |
What is the heuristic function of greedy best-first search? |
| A. | f(n) != h(n) |
| B. | f(n) < h(n) |
| C. | f(n) = h(n) |
| D. | f(n) > h(n) |
| Answer» D. f(n) > h(n) | |
| 7. |
Which function will select the lowest expansion node at first for evaluation? |
| A. | Greedy best-first search |
| B. | Best-first search |
| C. | Depth-first search |
| D. | None of the mentioned |
| Answer» C. Depth-first search | |
| 8. |
Which search uses the problem specific knowledge beyond the definition of the problem? |
| A. | Informed search |
| B. | Depth-first search |
| C. | Breadth-first search |
| D. | Uninformed search |
| Answer» B. Depth-first search | |
| 9. |
How many types of informed search method are in artificial intelligence? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» E. | |
| 10. |
What is the other name of informed search strategy? |
| A. | Simple search |
| B. | Heuristic search |
| C. | Online search |
| D. | None of the mentioned |
| Answer» C. Online search | |