Artificial Intelligence MCQs with Answers
Practice important Artificial Intelligence MCQs with answers and explanations.
Multiple Choice Questions
Q271: In dynamic programming, we always prefer the path with _______.
- A: more nodes
- B: minimum cost
- C: highest value
- D: longest path
View Answer
B
Q272: What is the A* algorithm?
- A: A brute force method
- B: A random walk method
- C: A combination of Branch and Bound with heuristic and dynamic programming
- D: Dynamic cost estimator
View Answer
C
Q273: In A* algorithm, node evaluation is based on ______.
- A: depth only
- B: heuristic only
- C: sum of distance so far and estimated remaining cost
- D: random choice
View Answer
C
Q274: A* search is more efficient than simple Branch and Bound due to ______.
- A: memory savings
- B: faster coding
- C: use of underestimates and dynamic programming
- D: luck
View Answer
C
Q275: If a node D can be reached with two different paths, which one does A* prefer?
- A: The longer one
- B: The path with lowest accumulated cost
- C: Random one
- D: The deepest path
View Answer
B
Q276: Adversarial Search involves how many players or agents?
- A: One
- B: Two or more
- C: None
- D: Three or more
View Answer
B
Q277: In Adversarial Search, players generally have ______ goals.
- A: same
- B: undefined
- C: contrary
- D: fixed
View Answer
C
Q278: Which of the following games is an example of Adversarial Search?
- A: Pac-Man
- B: Chess
- C: Monopoly
- D: Sudoku
View Answer
B
Q279: Player 1 trying to make a line of crosses in tic-tac-toe while Player 2 tries to block them is an example of ______.
- A: cooperative behavior
- B: branch and bound
- C: adversarial goal
- D: conflict resolution
View Answer
C
Q280: Adversarial Search is mostly applied in ______.
- A: robotics
- B: weather prediction
- C: board games
- D: chatbots
View Answer
C