What is uninformed search? Explain breadth-first and depth-first search strategies with their characteristics.

Answer:

Uninformed search (blind search) explores the search space without any domain-specific knowledge, relying only on the problem definition.

Breadth-First Search (BFS):

• Expands the shallowest node first.
• Uses a FIFO queue.
• Complete and optimal (for uniform cost).
• Time/space complexity: O(b^d), where b = branching factor, d = depth of solution.

Depth-First Search (DFS):

• Explores deepest nodes first.
• Uses a LIFO stack (or recursion).
• Not complete (may loop), not optimal.
• Time complexity: O(b^m), m = max depth.
• Space complexity: O(bm), better than BFS.

These strategies differ primarily in node expansion order and resource usage