Artificial Intelligence MCQs with Answers
Practice important Artificial Intelligence MCQs with answers and explanations.
Multiple Choice Questions
Q261: In Best First Search, the selection of the next node is based on ______.
- A: random choice
- B: least cost
- C: greatest depth
- D: best available heuristic
View Answer
D
Q262: Best First Search can sometimes reduce search time because it uses _______.
- A: exhaustive methods
- B: random guessing
- C: heuristics to guide search
- D: backtracking
View Answer
C
Q263: Which of the following is a major limitation of heuristic-based searches?
- A: They are too slow
- B: They require exact algorithms
- C: They do not guarantee optimal solutions
- D: They can't solve puzzles
View Answer
C
Q264: Which method attempts to find all possible solutions and then chooses the best one?
- A: Best First Search
- B: Beam Search
- C: British Museum Procedure
- D: A* Search
View Answer
C
Q265: The British Museum Procedure is analogous to which of the following?
- A: Greedy Search
- B: Brute Force Search
- C: Backtracking
- D: Optimal Search
View Answer
B
Q266: Exhaustively exploring a search tree with branching factor 16 and depth 100 would require computation of the order of ______.
- A: 10^100
- B: 10^120
- C: 10^50
- D: 10^10
View Answer
B
Q267: Which search method avoids exploring longer paths by pruning them early?
- A: Backtracking
- B: Beam Search
- C: Branch and Bound
- D: Depth First Search
View Answer
C
Q268: Branch and Bound works by cutting off paths that _______.
- A: are too deep
- B: contain cycles
- C: exceed a known best path length
- D: lead to leaf nodes
View Answer
C
Q269: What improvement in Branch and Bound uses previous calculations to avoid recomputation?
- A: Heuristic estimate
- B: Greedy method
- C: Dynamic programming
- D: Backtracking
View Answer
C
Q270: Which improvement helps Branch and Bound to avoid losing nearby solutions?
- A: Overestimate heuristic
- B: Underestimate heuristic
- C: Random walk
- D: Loop detection
View Answer
B