Artificial Intelligence MCQs with Answers
Practice important Artificial Intelligence MCQs with answers and explanations.
Chapter: 8
Q241:
In a Ridge Problem, the search is stuck on a _____.
A. local peak
B. flat area
C. knife-edge path
D. loop
Correct Answer:
C
Chapter: 8
Q242:
In the search tree, the goal is represented by city _____.
A. S
B. C
C. I
D. M
Correct Answer:
D
Chapter: 8
Q243:
In Hill Climbing, the path proceeds only if the next step _____.
A. is shorter
B. is closer to the goal
C. has a higher heuristic value
D. is random
Correct Answer:
C
Chapter: 8
Q244:
DFS may fail to find the goal if the path is _____.
A. short
B. looping
C. longer
D. finite
Correct Answer:
B
Chapter: 8
Q245:
Progressive deepening applies DFS with increasing levels until _____.
A. memory is full
B. goal is found
C. tree is exhausted
D. all nodes are visited
Correct Answer:
B
Chapter: 8
Q246:
Heuristic search is also known as _____.
A. blind search
B. uninformed search
C. informed search
D. goal-bound search
Correct Answer:
C
Chapter: 8
Q247:
Which of the following is an example of a heuristic?
A. Tree height
B. Smell of cheese
C. Memory stack
D. Edge weight
Correct Answer:
B
Chapter: 8
Q248:
Hill Climbing will stop when _____.
A. it finds the goal
B. all paths are explored
C. it reaches a local maxima
D. all nodes are visited
Correct Answer:
C
Chapter: 8
Q249:
In a search algorithm, a heuristic guides the path towards the _____.
A. start
B. point of failure
C. goal
D. edge
Correct Answer:
C
Chapter: 8
Q250:
If a heuristic leads you to a state with no goal access, it is considered _____.
A. perfect
B. random
C. misguiding
D. global
Correct Answer:
C
Chapter: 8
Q251:
Which problem can be solved by taking steps in random directions in Hill Climbing?
A. Depth problem
B. Ridge problem
C. Stack overflow
D. Tree balancing
Correct Answer:
B
Chapter: 8
Q252:
DFS can run forever in search spaces with _____.
A. cycles
B. limited memory
C. trees
D. finite paths
Correct Answer:
A
Chapter: 8
Q253:
The main memory problem in BFS is its _____.
A. exponential time
B. exponential space
C. exponential depth
D. low accuracy
Correct Answer:
B
Chapter: 8
Q254:
Straight-line distance between cities helps in _____.
A. uninformed search
B. DFS
C. heuristic estimation
D. space optimization
Correct Answer:
C
Chapter: 8
Q255:
In Hill Climbing, we proceed like a _____.
A. mouse searching cheese
B. blind man climbing a hill
C. a robot following a program
D. a BFS tree explorer
Correct Answer:
B
Chapter: 8
Q256:
When a blind person encounters a flat area while climbing, it represents the _____.
A. Foothill problem
B. Plateau problem
C. Ridge problem
D. Looping problem
Correct Answer:
B
Chapter: 8
Q257:
Hill Climbing searches for solutions using _____.
A. random guesses
B. heuristic improvement
C. limited memory
D. stack overflow
Correct Answer:
B
Chapter: 8
Q258:
Which of these ensures optimal path finding in the least depth with reduced space?
A. DFS
B. BFS
C. Progressive Deepening
D. Hill Climbing
Correct Answer:
C
Chapter: 9
Q259:
Which search algorithm considers all open nodes and selects the best one at each step?
A. Depth First Search
B. Breadth First Search
C. Best First Search
D. Uniform Cost Search
Correct Answer:
C
Chapter: 9
Q260:
Best First Search is based on which type of approach?
A. Brute force
B. Greedy
C. Backtracking
D. Dynamic Programming
Correct Answer:
B