Artificial Intelligence MCQs with Answers
Practice important Artificial Intelligence MCQs with answers and explanations.
Multiple Choice Questions
Q301: Blind search strategy involves ______.
- A: Heuristics
- B: Predefined evaluation
- C: Random moves
- D: No prior knowledge
View Answer
D
Q302: Which of the following is a component of problem solving?
- A: Input State
- B: Operators
- C: History Log
- D: Static Score
View Answer
B
Q303: What type of search uses heuristics to guide the process?
- A: Blind search
- B: DFS
- C: Heuristic search
- D: BFS
View Answer
C
Q304: What is a major drawback of Hill Climbing search?
- A: Too fast to terminate
- B: Too accurate to adjust
- C: Might get stuck at local maxima
- D: Consumes no memory
View Answer
C
Q305: The goal of Beam Search is to ______.
- A: Explore every path
- B: Use all resources
- C: Limit the number of branches to expand
- D: Use all memory
View Answer
C
Q306: In Best First Search, nodes are selected based on ______.
- A: Their color
- B: Depth in tree
- C: Estimated cost to goal
- D: Alphabetical order
View Answer
C
Q307: Progressive deepening combines _______ and _______.
- A: DFS and pruning
- B: DFS and BFS
- C: BFS and minimax
- D: Minimax and heuristics
View Answer
B
Q308: In the context of search algorithms, the goal state represents ________.
- A: Intermediate step
- B: Best node
- C: Final desired outcome
- D: A failure condition
View Answer
C
Q309: Branch and Bound strategy attempts to ______.
- A: Always use BFS
- B: Discard duplicate nodes
- C: Find optimal path by bounding possible solutions
- D: Break rules of search
View Answer
C
Q310: What is the main benefit of Alpha Beta Pruning in minimax trees?
- A: Memory optimization
- B: Faster CPU
- C: Fewer evaluations of nodes
- D: More randomness
View Answer
C