Which data structure is used to implement BFS efficiently?

• Stack

• Queue

• Priority Queue

• Hash Table

In DFS, what data structure is typically used for its implementation?

• Queue

• Stack

• Heap

• Tree

BFS is guaranteed to find the shortest path in:

• Weighted graphs

• Directed Acyclic Graphs

• Unweighted graphs

• Trees only

Which search method is not complete?

• BFS

• DFS (without cycle detection)

• Uniform Cost Search

• A* Search

What is the worst-case time complexity of BFS in a graph with branching factor b and depth d?

• O(b^d)

• O(d^b)

• O(b*d)

• O(d + b)

Which search strategy consumes less memory in most practical applications?

• BFS

• DFS

• Uniform Cost

• A*

Which of the following is both complete and optimal in unweighted graphs?

• DFS

• BFS

• Greedy Search

• Iterative Deepening DFS

Which search algorithm uses backtracking?

• BFS

• DFS

• Uniform Cost

• Greedy Best First

In Iterative Deepening DFS, what is increased gradually?

• Branching factor

• Memory limit

• Depth limit

• Cost threshold

Which search strategy combines the space efficiency of DFS and completeness of BFS?

• Uniform Cost Search

• Bidirectional Search

• Greedy Search

• Iterative Deepening DFS