Graph Traversal: BFS and DFS for Competitive Exams

Graph Traversal: BFS and DFS - Applications - Higher Difficulty Problems

Q. In a graph, if you want to check for cycles, which traversal method is more suitable?

Solution

DFS is more suitable for cycle detection as it can track back edges effectively.

Correct Answer: B — DFS

Q. In which scenario is DFS preferred over BFS?

Solution

DFS is preferred for exploring all possible paths, especially in scenarios like backtracking.

Correct Answer: B — Exploring all possible paths

Q. What is the main disadvantage of DFS compared to BFS?

Solution

DFS can get stuck in deep paths, leading to inefficient exploration in some cases.

Correct Answer: B — Can get stuck in deep paths

Q. What is the primary application of BFS in real-world scenarios?

Solution

BFS is commonly used in network broadcasting to explore all nodes at the current level before moving deeper.

Correct Answer: C — Network broadcasting

Q. Which of the following is a characteristic of BFS?

Solution

BFS uses a queue to explore nodes level by level.

Correct Answer: B — Uses a queue

Q. Which of the following problems can be solved using DFS?

Solution

DFS can be used for finding paths in a maze and topological sorting, but not for finding the shortest path in a weighted graph.

Correct Answer: C — Topological sorting

Q. Which of the following statements about DFS is true?

Solution

DFS can be implemented using recursion, which is a common approach in many algorithms.

Correct Answer: C — It can be implemented using recursion

Showing 1 to 7 of 7 (1 Pages)