Skip to main content

Artificial Intelligence MCQs with Answers

Practice important Artificial Intelligence MCQs with answers and explanations.

Multiple Choice Questions

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
View Answer
C

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
View Answer
C

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
View Answer
D

Q284: Which of the following is NOT a component of A* search?
  • A: Branch and Bound
  • B: Heuristic Estimates
  • C: Overestimation
  • D: Dynamic Programming
View Answer
C

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
View Answer
D

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
View Answer
C

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
View Answer
C

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
View Answer
C

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
View Answer
B

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
View Answer
C

Test Your Knowledge

Take a timed quiz on Artificial Intelligence

🚀 Start Quiz Now