Prelim Exam - A.I. - Part 1

Which of the following best defines a search space?

• The final solution of a problem

• A set of possible solutions a system may have

• The memory required for searching

• The sequence of percepts an agent receives

The start state in a search problem refers to:

• The most optimal solution

• The initial point where the agent begins searching

• The goal state of the problem

• The path cost of the first step

Which property of a search algorithm guarantees finding a solution if one exists?

• Optimality

• Completeness

• Time complexity

• Space complexity

The function that checks if the current state meets the goal is called:

• Start state

• Search tree

• Goal test

• Transition model

In a search tree, the “fringe” refers to:

• The root node

• All expanded nodes

• The leaves (nodes available for expansion)

• The internal states already visited

Which search strategy explores all nodes at the current depth before moving deeper?

• Depth-First Search

• Breadth-First Search

• Hill Climbing

• A* Search

A search algorithm is considered optimal if it:

• Finds the fastest solution

• Always finds a solution

• Guarantees the best (lowest cost) solution

• Uses the least amount of memory

Heuristic functions are used in search to:

• Guarantee completeness

• Guide search using problem-specific knowledge

• Increase space complexity

• Replace the goal test

Which uninformed search strategy combines DFS space efficiency with BFS completeness?

• Greedy Best-First Search

• Iterative Deepening DFS

• Hill Climbing

• A* Search

The A* algorithm combines the benefits of:

• Depth-First Search and Hill Climbing

• Greedy Best-First and Uniform-Cost Search

• Breadth-First Search and Hill Climbing

• Heuristics and Random Search