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_IDENTICAL_TO_THE_CLOSED_LIST_IN_GRAPH_SEARCH??$ |
| A. | Hill climbing search algorithm |
| B. | Depth-first search |
| C. | Transposition table |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |
| 2. |
Which_function_is_used_to_calculate_the_feasibility_of_whole_game_tree?$ |
| A. | Evaluation function |
| B. | Transposition |
| C. | Alpha-beta pruning |
| D. | All of the mentioned |
| Answer» B. Transposition | |
| 3. |
What is called as transposition table? |
| A. | Hash table of next seen positions |
| B. | Hash table of previously seen positions |
| C. | Next value in the search |
| D. | None of the mentioned |
| Answer» C. Next value in the search | |
| 4. |
How the effectiveness of the alpha-beta pruning gets increased? |
| A. | Depends on the nodes |
| B. | Depends on the order in which they are executed |
| C. | All of the mentioned |
| D. | None of the mentioned |
| Answer» B. Depends on the order in which they are executed | |
| 5. |
Where does the values of alpha-beta search get updated? |
| A. | Along the path of search |
| B. | Initial state itself |
| C. | At the end |
| D. | None of the mentioned |
| Answer» B. Initial state itself | |
| 6. |
Which value is assigned to alpha and beta in the alpha-beta pruning? |
| A. | Alpha = max |
| B. | Beta = min |
| C. | Beta = max |
| D. | Both Alpha = max & Beta = min |
| Answer» E. | |
| 7. |
Which search is similar to minimax search? |
| A. | Hill-climbing search |
| B. | Depth-first search |
| C. | Breadth-first search |
| D. | All of the mentioned |
| Answer» C. Breadth-first search | |
| 8. |
To which depth does the alpha-beta pruning can be applied? |
| A. | 10 states |
| B. | 8 States |
| C. | 6 States |
| D. | Any depth |
| Answer» E. | |
| 9. |
Which values are independant in minimax search algorithm? |
| A. | Pruned leaves x and y |
| B. | Every states are dependant |
| C. | Root is independant |
| D. | None of the mentioned |
| Answer» B. Every states are dependant | |
| 10. |
Which search is equal to minimax search but eliminates the branches that can’t influence the final decision? |
| A. | Depth-first search |
| B. | Breadth-first search |
| C. | Alpha-beta pruning |
| D. | None of the mentioned |
| Answer» D. None of the mentioned | |