Which of the following is not an... - Solved

Question 37

Computer Awareness Graphs Medium

Which of the following is not an application of DFS?

(A) Topological Sort

(B) Determining Strongly Connected Components in a graph

(C) Finding minimum distance to a node in an unweighted graph optimally

(D) Solving Maze Problem

✓ Correct Answer: Option C Verified Solution

📘 Step-by-Step Solution & Detailed Explanation:

DFS Application Question

Q. Which of the following is not an application of DFS?

A) Topological Sort

B) Determining Strongly Connected Components in a graph

C) Finding minimum distance to a node in an unweighted graph optimally

D) Solving Maze Problem

Explanation:
Depth First Search (DFS) is used in applications such as:

Topological sorting
Finding strongly connected components
Maze solving (backtracking)

However, finding the minimum distance in an unweighted graph requires Breadth First Search (BFS), not DFS. Hence, option (C) is the correct answer.

Full-Length Test Series

Prepare for CUET-MCA Under Real Exam Conditions

Take timed full-length mock tests with authentic question distributions, negative marking (+12/-3 in Math), and instant All India Rank calculation.

Start Free Mock Test Series →

Question 37

📘 Step-by-Step Solution & Detailed Explanation:

Practice Similar Graphs Questions

Prepare for CUET-MCA Under Real Exam Conditions