Uninformed Search Strategies Questions and Answers

Answer: A

Search begins with the root node on the frontier and everything else unexplored, and the first expansion produces the successors of the initial state. Starting with the successors would skip the goal test on the root, which matters when the start is already a goal. The whole space is never materialised and the goals are not known in advance. Beginning from a single node and growing outward is what makes the algorithm applicable to spaces too large to enumerate.

Answer: B

A well written search tests the root before expanding anything and returns the empty plan, which is the correct answer when nothing needs to be done. Implementations that only test on expansion of successors miss this case and report failure or waste work. Treating the degenerate case correctly costs one test and is exactly the sort of boundary condition that distinguishes a careful implementation from a plausible one.

Answer: B

A search algorithm takes a problem as input and returns a solution.

The problem is defined by an initial state, the available actions, the transition model, a goal test and path costs. The algorithm searches the state space and returns a solution, usually a sequence of actions leading from the initial state to a goal.

'Input, output' is too vague, and 'solution, problem' reverses the relationship. A sequence of actions is what the solution typically contains, but parameters alone are not what the algorithm receives.