Artificial Intelligence MCQs with Answers
Practice important Artificial Intelligence MCQs with answers and explanations.
Chapter: 10
Q301:
Blind search strategy involves ______.
A. Heuristics
B. Predefined evaluation
C. Random moves
D. No prior knowledge
Correct Answer:
D
Chapter: 10
Q302:
Which of the following is a component of problem solving?
A. Input State
B. Operators
C. History Log
D. Static Score
Correct Answer:
B
Chapter: 10
Q303:
What type of search uses heuristics to guide the process?
A. Blind search
B. DFS
C. Heuristic search
D. BFS
Correct Answer:
C
Chapter: 10
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
Correct Answer:
C
Chapter: 10
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
Correct Answer:
C
Chapter: 10
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
Correct Answer:
C
Chapter: 10
Q307:
Progressive deepening combines _______ and _______.
A. DFS and pruning
B. DFS and BFS
C. BFS and minimax
D. Minimax and heuristics
Correct Answer:
B
Chapter: 10
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
Correct Answer:
C
Chapter: 10
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
Correct Answer:
C
Chapter: 10
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
Correct Answer:
C
Chapter: 10
Q311:
Minimax search trees use alternating levels for _________.
A. Minimizer and maximizer
B. Random access and memory
C. Heuristic and evaluation
D. Recursion and iteration
Correct Answer:
A
Chapter: 10
Q312:
Which procedure uses both maximizer and minimizer logic in a tree?
A. Depth First
B. Minimax
C. Best First
D. Hill Climbing
Correct Answer:
B
Chapter: 10
Q313:
Static evaluator gives a score to ________.
A. Each game level
B. Only root node
C. Each node in the tree
D. Only leaf nodes
Correct Answer:
C
Chapter: 10
Q314:
Hill Climbing can fail due to _________.
A. Multiple goals
B. Plateau and ridges
C. Too many nodes
D. Perfect solutions
Correct Answer:
B
Chapter: 10
Q315:
The Alpha Beta Pruning skips evaluation if the current branch is ________.
A. Less than Alpha
B. More than Beta
C. Irrelevant to the outcome
D. All of these
Correct Answer:
D
Chapter: 10
Q316:
The player who wants the lowest score in minimax is called the ________.
A. Minimizer
B. Maximizer
C. Reducer
D. Selector
Correct Answer:
A
Chapter: 10
Q317:
A good example of problem solving components is:
A. Chess game menu
B. A person lost in a city trying to find the airport
C. A computer login screen
D. Wi-Fi connectivity
Correct Answer:
B
Chapter: 10
Q318:
Generate and Test strategy is ________.
A. A random guessing process
B. An intelligent agent
C. A classical method of solving problems
D. A sorting algorithm
Correct Answer:
C
Chapter: 10
Q319:
Social networks enable users to communicate with each other by posting _______.
A. information, comments, messages, images, and videos
B. technical documents
C. programming code
D. commercial advertisements
Correct Answer:
A
Chapter: 10
Q320:
Problem representation plays a key role in _______.
A. Minimax decision
B. Problem solving
C. Random guessing
D. Input gathering
Correct Answer:
B