MCAPREP
Home > PYQ Blogs > CUET-MCA 2025 Paper > Question 37

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
View Dynamic Solution & Explanation ▼
Correct Solution: Option C

Step-by-step Solution:

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.

← Previous Question Our Rankers Next Question →