CPE 126 Introduction to Artificial Intelligence
Module 3 Exam | 40 Questions and Answers |
2026 Update | 100% Correct - Mapúa
University.
CPE 126 Introduction to Artificial Intelligence Module 3 Exam | 40 Questions and Answers |
2026 Update | 100% Correct - Mapúa University
SECTION 1: Search Algorithms and Problem Solving
1. Which search algorithm explores all nodes at the present depth before moving to nodes at
the next depth level?
A) Depth-First Search (DFS)
B) Breadth-First Search (BFS)
C) Uniform-Cost Search (UCS)
D) A* Search
Correct Answer: B
Explanation: Breadth-First Search (BFS) explores all nodes at the present depth before moving
to nodes at the next depth level. It uses a queue (FIFO) and is complete and optimal for
unweighted graphs. DFS uses a stack (LIFO), UCS expands the lowest-cost node, and A* uses
heuristics.
2. A student is studying the rotation of the search tree to evaluate the completeness of
algorithms. Which search algorithm is guaranteed to find a solution if one exists?
A) Depth-First Search (DFS)
B) Breadth-First Search (BFS)
, C) Greedy Best-First Search
D) Hill Climbing
Correct Answer: B
Explanation: The rotation of the search tree for BFS guarantees finding a solution if one exists
(complete) because it explores all nodes level by level. DFS may get stuck in infinite loops,
Greedy Best-First Search may not be complete, and Hill Climbing can get stuck in local optima.
3. Which of the following is an admissible heuristic for the A search algorithm?*
A) A heuristic that overestimates the cost to the goal
B) A heuristic that never overestimates the cost to the goal
C) A heuristic that is always zero
D) A heuristic that is random
Correct Answer: B
Explanation: An admissible heuristic never overestimates the cost to reach the goal. This
ensures that A* search is optimal. A heuristic that overestimates may lead to suboptimal
solutions.
4. A student is studying the rotation of the nodes in a search algorithm. What is the time
complexity of Breadth-First Search (BFS) in terms of branching factor (b) and depth (d)?
A) O(b^d)
B) O(bd)
C) O(d^b)
D) O(b + d)
Correct Answer: A
Explanation: The rotation of the nodes in BFS: the time complexity is O(b^d), where b is the
branching factor and d is the depth of the shallowest goal. This is because BFS explores all
nodes at each level before moving deeper.
5. Which search algorithm uses a priority queue based on the cost of the path from the start
node?
A) Depth-First Search (DFS)
B) Breadth-First Search (BFS)
Module 3 Exam | 40 Questions and Answers |
2026 Update | 100% Correct - Mapúa
University.
CPE 126 Introduction to Artificial Intelligence Module 3 Exam | 40 Questions and Answers |
2026 Update | 100% Correct - Mapúa University
SECTION 1: Search Algorithms and Problem Solving
1. Which search algorithm explores all nodes at the present depth before moving to nodes at
the next depth level?
A) Depth-First Search (DFS)
B) Breadth-First Search (BFS)
C) Uniform-Cost Search (UCS)
D) A* Search
Correct Answer: B
Explanation: Breadth-First Search (BFS) explores all nodes at the present depth before moving
to nodes at the next depth level. It uses a queue (FIFO) and is complete and optimal for
unweighted graphs. DFS uses a stack (LIFO), UCS expands the lowest-cost node, and A* uses
heuristics.
2. A student is studying the rotation of the search tree to evaluate the completeness of
algorithms. Which search algorithm is guaranteed to find a solution if one exists?
A) Depth-First Search (DFS)
B) Breadth-First Search (BFS)
, C) Greedy Best-First Search
D) Hill Climbing
Correct Answer: B
Explanation: The rotation of the search tree for BFS guarantees finding a solution if one exists
(complete) because it explores all nodes level by level. DFS may get stuck in infinite loops,
Greedy Best-First Search may not be complete, and Hill Climbing can get stuck in local optima.
3. Which of the following is an admissible heuristic for the A search algorithm?*
A) A heuristic that overestimates the cost to the goal
B) A heuristic that never overestimates the cost to the goal
C) A heuristic that is always zero
D) A heuristic that is random
Correct Answer: B
Explanation: An admissible heuristic never overestimates the cost to reach the goal. This
ensures that A* search is optimal. A heuristic that overestimates may lead to suboptimal
solutions.
4. A student is studying the rotation of the nodes in a search algorithm. What is the time
complexity of Breadth-First Search (BFS) in terms of branching factor (b) and depth (d)?
A) O(b^d)
B) O(bd)
C) O(d^b)
D) O(b + d)
Correct Answer: A
Explanation: The rotation of the nodes in BFS: the time complexity is O(b^d), where b is the
branching factor and d is the depth of the shallowest goal. This is because BFS explores all
nodes at each level before moving deeper.
5. Which search algorithm uses a priority queue based on the cost of the path from the start
node?
A) Depth-First Search (DFS)
B) Breadth-First Search (BFS)
