Quiz on Search Algorithms

What data structure is used in BFS?

• Stack

• Queue

• Linked List

• Tree

Which of the following is true for BFS?

• It uses LIFO structure

• It may not find the shortest path

• It explores all nodes at one depth before moving to the next

• It is faster than DFS

BFS is optimal when:

• All actions have the same cost

• Graph has cycles

• Goal node is far

• Nodes have variable cost

BFS is a type of:

• Informed search

• Blind search

• Heuristic search

• Local search

Which traversal guarantees the shortest path in unweighted graphs?

• DFS

• A*

• UCS

• BFS

What data structure is used in DFS?

• Queue

• Stack

• Heap

• Array

DFS is not guaranteed to find the optimal path because:

• It is incomplete

• It explores the deepest path first

• It uses heuristics

• It doesn’t store visited nodes

Which of these is most memory-efficient?

• BFS

• DFS

• A*

• UCS

DFS may get stuck in:

• Heuristics

• Infinite loops in cyclic graphs

• Sorting

• Memory issues

DFS is suitable when:

• Shallow solutions are preferred

• Deep solutions are needed

• Heuristics are used

• Uniform cost is important