Artificial Intelligence MCQs with Answers
Practice important Artificial Intelligence MCQs with answers and explanations.
Chapter: 9
Q281:
Branch and Bound is preferable over brute force because it ______.
A. always finds all solutions
B. explores every node
C. avoids exploring unnecessary paths
D. skips the goal node
Correct Answer:
C
Chapter: 9
Q282:
In A*, if node A has a cost of 3 and remaining estimate of 2, its evaluation function f(n) is ______.
A. 3
B. 2
C. 5
D. 1
Correct Answer:
C
Chapter: 9
Q283:
In adversarial search, if one agent makes a move, the other agent will ______.
A. take the same action
B. ignore it
C. move randomly
D. counteract the move
Correct Answer:
D
Chapter: 9
Q284:
Which of the following is NOT a component of A* search?
A. Branch and Bound
B. Heuristic Estimates
C. Overestimation
D. Dynamic Programming
Correct Answer:
C
Chapter: 9
Q285:
In branch and bound, what is meant by “binding a path”?
A. Following it until the end
B. Skipping it entirely
C. Marking it for revisit
D. Pruning it from search space
Correct Answer:
D
Chapter: 9
Q286:
In the context of optimal search, which of the following is an exhaustive technique?
A. A* Search
B. Beam Search
C. British Museum Procedure
D. Branch and Bound
Correct Answer:
C
Chapter: 9
Q287:
Which algorithm avoids exploring paths with higher cost to the same node?
A. Depth First Search
B. Beam Search
C. Dynamic Programming
D. Simulated Annealing
Correct Answer:
C
Chapter: 10
Q288:
What is the primary goal of the minimax procedure in adversarial search?
A. To find the shortest path
B. To reduce memory usage
C. To make optimal decisions considering the opponent's moves
D. To evaluate heuristic functions
Correct Answer:
C
Chapter: 10
Q289:
In the minimax procedure, what does a positive static evaluation score indicate?
A. Favor to minimizer
B. Favor to maximizer
C. Equal chance for both players
D. Unknown result
Correct Answer:
B
Chapter: 10
Q290:
What term is used for the player who aims to get the highest possible score in the minimax procedure?
A. Minimizer
B. Selector
C. Maximizer
D. Explorer
Correct Answer:
C
Chapter: 10
Q291:
The static evaluator in a minimax tree assigns what to each node?
A. A heuristic rule
B. A complexity class
C. A static evaluation score
D. A random number
Correct Answer:
C
Chapter: 10
Q292:
In the minimax game tree, who selects the move after the maximizer's move?
A. Arbiter
B. Judge
C. Minimizer
D. Another maximizer
Correct Answer:
C
Chapter: 10
Q293:
Minimizer always tries to force the maximizer into a position with the _______ score.
A. Highest
B. Predictable
C. Random
D. Lowest
Correct Answer:
D
Chapter: 10
Q294:
In adversarial search, the look-ahead strategy is used to ________.
A. Skip levels
B. Reduce memory
C. Understand future game states
D. Predict user inputs
Correct Answer:
C
Chapter: 10
Q295:
Which strategy improves minimax by reducing the number of nodes evaluated?
A. Hill Climbing
B. Best First Search
C. Alpha Beta Pruning
D. Depth First Search
Correct Answer:
C
Chapter: 10
Q296:
Alpha Beta Pruning works by _______ the branches that do not affect the final decision.
A. Evaluating
B. Expanding
C. Pruning
D. Reversing
Correct Answer:
C
Chapter: 10
Q297:
Alpha Beta Pruning reduces the number of _______ evaluations.
A. Heuristic
B. Static
C. Dynamic
D. Total
Correct Answer:
B
Chapter: 10
Q298:
What is the purpose of a static evaluator in the minimax algorithm?
A. To create game levels
B. To choose random paths
C. To score game positions
D. To delete unused nodes
Correct Answer:
C
Chapter: 10
Q299:
The term "solution space" in problem solving refers to ________.
A. All possible answers
B. All possible states
C. All user responses
D. None of these
Correct Answer:
B
Chapter: 10
Q300:
In problem solving, "operators" represent _______.
A. Rules to reach the goal
B. Static values
C. Input devices
D. Random guesses
Correct Answer:
A