LM13-Uninformed search strategies

5 flashcards · Computer Science · by Ramya Santhi Ramachandran

1. uniform-cost search expands the node n with the _________

   Lowest path cost

2. Which search algorithm imposes a fixed depth limit on nodes?

   Depth-limited search

3. Which of the following search algorithm searches forward from initial state and backward from goal state till both meet to identify a common state?

   Bidirectional Search

4. Is optimality and completeness exist in bidirectional search algorithm?

   Yes, Yes

5. The __________algorithm explores the domain in a depth first manner.

   backtracking