AI & Expert systems-Unit 1

Which search algorithm explores all nodes at the present "depth" level before moving on to nodes at the next depth level?

• Breadth-First Search (BFS)
• Depth-First Search (DFS)

• Uniform Cost Search (UCS)

• Iterative Deepening Search (IDS)

In which search algorithm does the frontier expand according to the path cost, ensuring optimality in terms of path cost?

• Depth-First Search (DFS)

• Uniform Cost Search (UCS)

• Depth-Limited Search (DLS)

• Iterative Deepening Search (IDS)

Which search algorithm can get stuck in infinite paths if not properly managed?

• Breadth-First Search (BFS)

• Depth-First Search (DFS)

• Uniform Cost Search (UCS)

• Depth-Limited Search (DLS)

What is the primary advantage of Iterative Deepening Search (IDS) over Depth-First Search (DFS)?

• IDS guarantees finding the shallowest goal.

• IDS is faster.

• IDS requires less memory.

• IDS can handle infinite paths.

Bi-Directional Search typically requires which of the following conditions to work effectively?

• Complete knowledge of the search space.

• Infinite memory.

• High computational power.

• Knowledge of both the start and goal states.

Which search algorithm combines the benefits of Breadth-First Search (BFS) and Depth-First Search (DFS)?

• Uniform Cost Search (UCS)

• Depth-Limited Search (DLS)

• Iterative Deepening Search (IDS)

• Bi-Directional Search

Depth-Limited Search (DLS) is a variant of which search algorithm?

• Breadth-First Search (BFS)

• Depth-First Search (DFS)

• Uniform Cost Search (UCS)

• Iterative Deepening Search (IDS)

Which search algorithm focuses on exploring nodes based on their path cost from the start node?

• Depth-First Search (DFS)

• Breadth-First Search (BFS)

• Uniform Cost Search (UCS)

• Depth-Limited Search (DLS)

Which search algorithm iteratively increases the depth limit until a solution is found?

• Breadth-First Search (BFS)

• Depth-First Search (DFS)

• Depth-Limited Search (DLS)

• Iterative Deepening Search (IDS)

Which search algorithm explores nodes from both the start and goal states, aiming to meet in the middle?

• Breadth-First Search (BFS)

• Depth-First Search (DFS)

• Uniform Cost Search (UCS)

• Bi-Directional Search