

MCQOPTIONS
Saved Bookmarks
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_SEARCH_ALGORITHM_IMPOSES_A_FIXED_DEPTH_LIMIT_ON_NODES??$ |
A. | Depth-limited search |
B. | Depth-first search |
C. | Iterative deepening search |
D. | Bidirectional search |
Answer» B. Depth-first search | |
2. |
Which search implements stack operation for searching the states?$ |
A. | Depth-limited search |
B. | Depth-first search |
C. | Breadth-first search |
D. | None of the mentioned |
Answer» C. Breadth-first search | |
3. |
Which algorithm is used to solve any kind of problem? |
A. | Breadth-first algorithm |
B. | Tree algorithm |
C. | Bidirectional search algorithm |
D. | None of the mentioned |
Answer» C. Bidirectional search algorithm | |
4. |
How many parts does a problem consists of? |
A. | 1 |
B. | 2 |
C. | 3 |
D. | 4 |
Answer» E. | |
5. |
What is the space complexity of Depth-first search? |
A. | O(b) |
B. | O(bl) |
C. | O(m) |
D. | O(bm) |
Answer» E. | |
6. |
How many successors are generated in backtracking search? |
A. | 1 |
B. | 2 |
C. | 3 |
D. | 4 |
Answer» B. 2 | |
7. |
When is breadth-first search is optimal? |
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 | |
8. |
Which search is implemented with an empty first-in-first-out queue? |
A. | Depth-first search |
B. | Breadth-first search |
C. | Bidirectional search |
D. | None of the mentioned |
Answer» C. Bidirectional search | |
9. |
How many types are available in uninformed search method? |
A. | 3 |
B. | 4 |
C. | 5 |
D. | 6 |
Answer» D. 6 | |
10. |
Which search strategy is also called as blind search? |
A. | Uninformed search |
B. | Informed search |
C. | Simple reflex search |
D. | All of the mentioned |
Answer» B. Informed search | |