Compare the breadth-first and depth-first search algorithms : Using Depth-First Search (DFS)

The video introduces the depth first search (DFS) algorithm, comparing it with breadth first search (BFS). DFS explores one branch deeply before backtracking, using a stack data structure. An example demonstrates DFS on a graph, highlighting its non-optimal pathfinding compared to BFS. The video concludes with a comparison of both algorithms' efficiency and applicability, especially in infinite graphs.

What is the primary data structure used in Depth First Search?

• Queue

• Stack

• Array

• Linked List

In Depth First Search, what happens when a branch has no more adjacent vertices?

• The algorithm restarts

• The algorithm switches to BFS

• The algorithm backtracks

• The algorithm stops

How does Depth First Search explore vertices compared to Breadth First Search?

• DFS explores all vertices at the same level first

• DFS explores one branch deeply before backtracking

• DFS uses a queue to manage vertices

• DFS is guaranteed to find the shortest path

Which of the following is true about Depth First Search?

• It always finds the shortest path

• It uses more space than BFS

• It may not terminate in infinite graphs

• It is slower than BFS

What is a potential drawback of using Depth First Search in an infinite graph?

• It may not find any path

• It may never terminate

• It uses too much memory

• It is too slow