LM12-Uninformed search strategies

5 flashcards · Computer Science · by Ramya Santhi Ramachandran

1. When is breadth-first search is optimal?

   When all step costs are equal

2. Which search implements stack operation for searching the states?

   Depth-first search

3. One definition of AI focuses on problem-solving methods that process:

   symbols

4. What is Time Complexity of Breadth First search algorithm?

   b^d

5. Depth-First Search is implemented in recursion with _______ data structure.

   LIFO