Uninformed Search Algorithms Quiz

What is the main characteristic of uninformed search algorithms?

• They use heuristics to guide the search.

• They are always optimal.

• They do not use any clues about the suitable area.

• They require extensive prior knowledge.

Which data structure is used in the Breadth-first Search algorithm?

• Queue

• Linked List

• Stack

• Array

What is a disadvantage of the Depth-first Search algorithm?

• It is always optimal.

• It may go into an infinite loop.

• It cannot handle large graphs.

• It requires a lot of memory.

What does the Depth-Limited Search algorithm aim to solve?

• Infinite paths in Depth-first Search.

• Memory issues in Breadth-first Search.

• Finding the shortest path.

• Optimal path cost.

Which search algorithm is optimal when all edge costs are the same?

• Iterative Deepening Search

• Bidirectional Search

• Uniform-cost Search

• Depth-first Search

What is the time complexity of the Uniform-cost Search algorithm?

• O(bd)

• O(b1 + [C*/ε])

• O(nm)

• O(bℓ)

What is a key feature of the Iterative Deepening Depth-First Search?

• It uses a priority queue.

• It requires extensive memory.

• It combines BFS and DFS.

• It is non-optimal.

What is the main advantage of Bidirectional Search?

• It requires less memory.

• It can handle infinite graphs.

• It is easy to implement.

• It guarantees finding the shortest path.

Which search algorithm is known for its memory efficiency?

• Bidirectional Search

• Uniform-cost Search

• Depth-first Search

• Breadth-first Search

What is the completeness condition for Depth-first Search?

• It is complete in finite state space.

• It is always complete.

• It is complete only for infinite graphs.

• It is never complete.