Search Algorithms Quiz

In which search strategy is the shallowest node expanded first?

• Depth First Search

• Breadth First Search

• Hill Climbing

• A* Search

Which of the following is NOT an example of uninformed search?

• Breadth First Search

• Depth First Search

• Hill Climbing

• Uniform Cost Search

Which of these search algorithms uses a heuristic function to guide the search?

• Breadth First Search

• Depth First Search

• Hill Climbing

• Depth Limited Search

The A* algorithm uses which two components to evaluate nodes?

• Cost and depth

• Path cost and heuristic cost

• Breadth and depth

• Step cost only

What is the primary disadvantage of depth first search?

• May find sub-optimal solution

• High space requirement

• Needs heuristic function

• Cannot be used in trees

Which search algorithm is guaranteed to find the optimal solution if the heuristic is admissible?

• Hill Climbing

• A* Search

• Depth First Search

• Breadth First Search

What is the main challenge in heuristic search?

• Using too little memory

• Defining a suitable heuristic

• Infinite loops

• Large step costs

The Hill Climbing algorithm can get stuck at which points?

• Local maxima

• Goal node

• Heuristic minima

• Both a and c

Which algorithm is best suited when solution spaces are AND/OR graphs?

• A* algorithm

• AO* algorithm

• BFS

• Hill climbing

In adversarial search, which algorithm is commonly used in two-player games?

• A*

• Mini-max

• AO*

• Hill climbing