Artificial Intelligence MCQs with Answers
Practice important Artificial Intelligence MCQs with answers and explanations.
Chapter: 8
Q221:
Which search algorithm guarantees to find the shallowest goal?
A. DFS
B. BFS
C. Hill Climbing
D. Progressive Deepening
Correct Answer:
B
Chapter: 8
Q222:
BFS requires _______ space compared to DFS.
A. less
B. the same
C. more
D. zero
Correct Answer:
C
Chapter: 8
Q223:
Progressive Deepening combines the benefits of ______.
A. DFS and BFS
B. BFS and A*
C. DFS and Uniform Cost Search
D. Hill Climbing and BFS
Correct Answer:
A
Chapter: 8
Q224:
In progressive deepening, DFS is applied up to a specific _____.
A. width
B. level
C. node
D. path
Correct Answer:
B
Chapter: 8
Q225:
DFS is preferred over BFS in terms of _____.
A. depth exploration
B. time complexity
C. memory efficiency
D. accuracy
Correct Answer:
C
Chapter: 8
Q226:
The process of applying DFS with increasing depth is called _____.
A. Hill Climbing
B. Breadth First Search
C. Depth Incremental Search
D. Progressive Deepening
Correct Answer:
D
Chapter: 8
Q227:
Progressive Deepening guarantees finding the goal at minimum _____.
A. width
B. time
C. depth
D. nodes
Correct Answer:
C
Chapter: 8
Q228:
A search strategy that uses a guide or guess is called _____.
A. uninformed search
B. DFS
C. binary search
D. heuristic search
Correct Answer:
D
Chapter: 8
Q229:
Heuristic functions are used in search algorithms to _____.
A. increase path length
B. store previous paths
C. guide towards the goal
D. randomize the search
Correct Answer:
C
Chapter: 8
Q230:
The straight-line distance to the goal is used as a _____.
A. state function
B. goal function
C. heuristic function
D. boundary function
Correct Answer:
C
Chapter: 8
Q231:
Which of the following is a limitation of heuristics?
A. They always fail
B. They give wrong solutions
C. They can misguide
D. They require complex math
Correct Answer:
C
Chapter: 8
Q232:
The term "as the crow flies distance" refers to _____.
A. travel time
B. memory size
C. actual path
D. straight-line distance
Correct Answer:
D
Chapter: 8
Q233:
Heuristic search reduces the _____.
A. number of states
B. accuracy
C. size of solution
D. tree height
Correct Answer:
A
Chapter: 8
Q234:
Hill Climbing is a variant of which search method?
A. Breadth First Search
B. Depth First Search
C. Uniform Cost Search
D. Progressive Deepening
Correct Answer:
B
Chapter: 8
Q235:
Which of the following is NOT a problem in Hill Climbing?
A. Foothill Problem
B. Plateau Problem
C. Ridge Problem
D. BFS Overflow
Correct Answer:
D
Chapter: 8
Q236:
In the Foothill Problem, the search gets stuck at _____.
A. global minima
B. global maxima
C. local maxima
D. random points
Correct Answer:
C
Chapter: 8
Q237:
Which problem occurs in Hill Climbing when all paths are flat?
A. Foothill
B. Ridge
C. Plateau
D. Depth Problem
Correct Answer:
C
Chapter: 8
Q238:
Which of the following can solve local maxima or plateau issues in Hill Climbing?
A. Backtracking
B. Randomness
C. Depth Control
D. Memory Increase
Correct Answer:
B
Chapter: 8
Q239:
In Hill Climbing, the best move is the one that _____.
A. looks random
B. is farthest from goal
C. gives the highest heuristic value
D. reduces the height
Correct Answer:
C
Chapter: 8
Q240:
A heuristic function returns a _____.
A. state
B. path
C. number
D. operator
Correct Answer:
C