Artificial Intelligence MCQs with Answers
Practice important Artificial Intelligence MCQs with answers and explanations.
Multiple Choice Questions
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
View Answer
B
Q252: DFS can run forever in search spaces with _____.
- A: cycles
- B: limited memory
- C: trees
- D: finite paths
View Answer
A
Q253: The main memory problem in BFS is its _____.
- A: exponential time
- B: exponential space
- C: exponential depth
- D: low accuracy
View Answer
B
Q254: Straight-line distance between cities helps in _____.
- A: uninformed search
- B: DFS
- C: heuristic estimation
- D: space optimization
View Answer
C
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
View Answer
B
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
View Answer
B
Q257: Hill Climbing searches for solutions using _____.
- A: random guesses
- B: heuristic improvement
- C: limited memory
- D: stack overflow
View Answer
B
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
View Answer
C
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
View Answer
C
Q260: Best First Search is based on which type of approach?
- A: Brute force
- B: Greedy
- C: Backtracking
- D: Dynamic Programming
View Answer
B