Free Practice Quiz Question List

2 Problem Solving and Search Online Quiz Questions

Use this free practice quiz with 20 questions to review 2 Problem Solving and Search, test your knowledge, and prepare for your next test or exam.

20 questions

True or false

1 point

The goal test determines whether a delivery robot has reached its destination.

A
True
B
False

Choose one

1 point

A robot can reach a charging station by several routes. Each move through a difficult square uses extra energy, and the objective is to minimize total energy. Which part of the problem definition represents the energy accumulated along a route?

A
Initial state
B
Path cost
C
Goal test
D
Transition model

Fill in the blank

1 point

In a search algorithm, the collection of states that have been discovered but not yet explored is called the .

Written response

1 point

On a grid where each move goes one square horizontally or vertically, what is the name of the heuristic that estimates remaining moves by adding the horizontal and vertical differences from the goal?

Choose one

1 point

Which uninformed search strategy explores the shallowest paths first, typically using a queue?

A
Depth-first search
B
Breadth-first search
C
Uniform-cost search
D
Greedy best-first search

True or false

1 point

In graph search on a finite state space, tracking duplicate states can prevent a search from revisiting a cycle indefinitely.

A
True
B
False

Choose all

1 point

Select all statements that accurately describe breadth-first search or uniform-cost search.

A
Breadth-first search explores shallowest paths first and finds a fewest-action solution when all action costs are equal.
B
Breadth-first search always finds the least-cost solution even when action costs differ.
C
Uniform-cost search expands the frontier path with the lowest cost so far.
D
Uniform-cost search always chooses a path with the fewest actions.

Written response

1 point

What search concept describes the typical number of successor states available from each state?

Fill in the blank

1 point

Greedy best-first search prioritizes a state using its heuristic estimate, but it ignores the and therefore is not generally guaranteed to find a least-cost path.

Choose one

1 point

For A* tree search to find an optimal solution under the stated heuristic condition, which property must the heuristic have?

A
It gives the exact remaining cost for every state.
B
It estimates only the cost already paid from the start.
C
It never estimates a remaining cost greater than the true remaining cost.
D
It assigns the same estimate to every state.

Choose all

1 point

Select all statements about A* and heuristic conditions that are supported by the material.

A
An admissible heuristic allows A* tree search to find an optimal solution.
B
For graph search, heuristic consistency is a common condition supporting optimality without reopening explored states.
C
A* uses only the estimated remaining cost and ignores cost so far.
D
A* is guaranteed to find an optimal solution regardless of the heuristic.

Open ended

1 point

A map has roads of different lengths. Explain why breadth-first search and uniform-cost search might choose different routes, and identify which strategy is suitable for minimizing total distance.

Choose one

1 point

A robot can open a locked door only after collecting a key. Two situations have the robot in the same square, but in one it has the key and in the other it does not. What should the state representation do to support valid planning?

A
Include whether the robot has collected the key in its state.
B
Record only the robot's current square, since the key is not its location.
C
Remove the door from the goal test.
D
Use the path depth as the transition model.

Choose one

1 point

In a route-finding problem, two different paths can reach the same intersection, and roads can form cycles. Why should graph search track explored states?

A
To ensure each state appears only once in every possible search tree
B
To avoid repeatedly visiting the same state when paths converge or cycles occur
C
To make every action have the same cost
D
To guarantee that the first path found is least-cost

Choose one

1 point

Which uninformed search strategy explores the shallowest paths first?

A
Breadth-first search
B
Depth-first search
C
Greedy best-first search
D
Uniform-cost search

Choose one

1 point

A planner has limited memory and needs to explore a possible route, but does not need a shortest-path guarantee. Which strategy best fits these priorities?

A
Breadth-first search, because it uses the least memory and guarantees the lowest cost
B
Uniform-cost search, because it always explores the deepest path first
C
Depth-first search, because it can use less memory when a shortest-path guarantee is unnecessary
D
Greedy best-first search, because it guarantees the fewest actions

Choose one

1 point

A* is choosing which state to expand next. State A has $g=4$ and $h=5$ , State B has $g=6$ and $h=2$ , and State C has $g=2$ and $h=7$ . Which state does A* select?

A
State A
B
State B
C
State C

True or false

1 point

True or false: Greedy best-first search can choose a state that appears close to the goal even when the path to that state has already cost a great deal.

A
True
B
False

Written response

1 point

In informed search, what does the heuristic $h(n)$ estimate for a state $n$ ?

Written response

1 point

On a grid where each move changes position by one square in one of the four cardinal directions, what is the Manhattan distance from $(2,3)$ to $(7,5)$ , measured in moves?