Quiz on BFS and DFS

What does BFS stand for?

• Binary Fast Search

• Breadth Fast Search

• Binary First Search

• Breadth First Search

Which data structure does BFS use?

• Stack

• Queue

• Array

• Linked List

What is the main conceptual difference between BFS and DFS?

• BFS uses LIFO, DFS uses FIFO

• BFS is faster than DFS

• BFS builds the tree level by level, DFS builds sub-tree by sub-tree

• BFS is used for acyclic graphs, DFS for cyclic graphs

Which approach for keeping track the last node visited does DFS use?

• Queue FIFO (First In First Out)

• Stack LIFO (Last In First Out)

• Priority Queue

• Randomized

Which approach for keeping track the nodes to be visited does BFS use?

• Queue FIFO (First In First Out)

• Stack LIFO (Last In First Out)

• Priority Queue

• Randomized

For which scenario is BFS more suitable?

• Searching vertices closer to the source

• Finding solutions far from the source

• Detecting cycles in graphs

• Finding strongly connected components

Which of the following is an application of BFS?

• Cycle detection

• Topological sorting

• Shortest path in unweighted graphs

• Finding strongly connected components

Which data structure does DFS use?

• Stack

• Queue

• Graph

• Heap

Which traversal method is used in DFS?

• Level order traversal

• Post-order traversal

• In-order traversal

• Pre-order traversal

Which of the following is an application of DFS?

• Finding strongly connected components

• Breadth-first traversal

• Finding shortest path in unweighted graphs

• Finding shortest path in weighted graphs