

MCQOPTIONS
Saved Bookmarks
This section includes 6 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. |
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 | |
2. |
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 | |
3. |
Breadth-first search is not optimal when all step costs are equal, because it always expands the shallowest unexpanded node. |
A. | True |
B. | False |
Answer» C. | |
4. |
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. | |
5. |
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. | |
6. |
What is the general term of Blind searching? |
A. | Informed Search |
B. | Uninformed Search |
C. | Informed & Unformed Search |
D. | Heuristic Search |
Answer» C. Informed & Unformed Search | |