Search Strategies Quiz

Which of the following search strategies always expands the shallowest node first?

• Depth-First Search

• Uniform Cost Search

• Breadth-First Search

• Iterative Deepening Search

In which situation is Depth-First Search not complete?

• When the branching factor is finite

• When the goal node is at shallow depth

• When the state space is finite

• When the search tree is infinite

What is the time complexity of Breadth-First Search in the worst case?

• O(b·d)

• O(d^b)

• O(b^d)

• O(b·m)

Which uninformed search strategy guarantees finding the least-cost path to a goal?

• Depth-First Search

• Breadth-First Search

• Uniform Cost Search

• Iterative Deepening Search

What is the space complexity of Depth-First Search?

• O(b^d)

• O(b^m)

• O(b·d)

• O(b·m)

Which strategy combines the space efficiency of DFS with the completeness of BFS?

• Uniform Cost Search

• Iterative Deepening Search

• Bidirectional Search

• A* Search

Which of the following is true about Depth-Limited Search?

• It guarantees optimality

• It is complete for infinite-depth trees

• It expands nodes in cost order

• It is the same as BFS with depth cut-off

Uniform Cost Search is similar to which algorithm when all step costs are equal?

• DFS

• BFS

• A*

• DLS

What is a key limitation of BFS?

• It cannot find the shortest path

• It uses excessive memory

• It loops infinitely

• It cannot detect cycles

Iterative Deepening Search repeatedly applies:

• Breadth-First Search

• Uniform Cost Search

• Depth-Limited Search with increasing depth

• DFS with backtracking