Artificial Intelligence MCQs with Answers
Practice important Artificial Intelligence MCQs with answers and explanations.
Multiple Choice Questions
Q211: Which one is TRUE about BFS?
- A: It selects deeper nodes first
- B: It selects random nodes
- C: It uses 1/height(n) as priority
- D: It selects shallower nodes first
View Answer
D
Q212: Which of the following searches explores more area of search space in general?
- A: DFS
- B: BFS
- C: Greedy
- D: Uniform Cost Search
View Answer
B
Q213: Q is initialized with ________.
- A: S only
- B: Goal node
- C: Empty queue
- D: Visited list
View Answer
A
Q214: If node X is a goal node, algorithm will ________.
- A: Ignore X
- B: Skip X
- C: Return X
- D: Reinitialize Q
View Answer
C
Q215: Which part of the algorithm determines the search type (DFS/BFS)?
- A: Visited set
- B: Queue type
- C: Priority function
- D: Pick step from Q
View Answer
C
Q216: What is added to Visited list during the algorithm execution?
- A: Goal node only
- B: Start node only
- C: All nodes visited
- D: Only failed nodes
View Answer
C
Q217: The same Simple Search Algorithm applies to ________.
- A: Informed search only
- B: Uninformed search only
- C: Both A and B
- D: Heuristic search
View Answer
C
Q218: DFS is effective when goal is located ______.
- A: Near root
- B: In deep leaf
- C: In middle node
- D: Unknown location
View Answer
B
Q219: The algorithm returns H if ________.
- A: H is found to be a goal
- B: H has highest cost
- C: H is the start node
- D: H is not in Visited
View Answer
A
Q220: Which of the following is a major drawback of DFS?
- A: It always finds the shallowest goal
- B: It requires exponential space
- C: It can run forever in infinite paths
- D: It is too slow
View Answer
C