Aspire Faculty ID #12066 · Topic: CUET 2025 · Just now
CUET 2025

Which of the following is not an application of DFS?

Solution

  • Topological Sort → Can be done using DFS (by finishing times). ✅

  • Strongly Connected Components (SCCs) → Kosaraju’s and Tarjan’s algorithms use DFS. ✅

  • Solving Maze Problem → DFS is a valid approach to explore paths in a maze. ✅

  • Finding minimum distance in an unweighted graph → This requires Breadth First Search (BFS), not DFS, because BFS ensures the shortest path in an unweighted graph. ❌

← Previous Next →

Next 10 Questions — CUET 2025

Ascending by ID
1
Which of the following statement is true about IEEE754 representation of +0 and -0?
Topic: CUET 2025
 2
Match List-I with List-II List I - (Letter Number Seires)  List II - (Missing Term)  (A) D4,F6…
Topic: CUET 2025
 3
Which CPU scheduling algorithm prefers the process with the shortest burst time?
Topic: CUET 2025
 4
Complete the following statement by choosing the correct option. For a deadlock to occur, the four conditions name…
Topic: CUET 2025
 5
The length of major axis and coordinate of vertices for the ellipse $3x^{2}+2y^{2}=6$ respectively are:
Topic: CUET 2025
 6
The Dining Philosopher’ problem can be solved by:
Topic: CUET 2025
 7
The points $(K,2-2K)$, $(-K+1,2K)$ and $(-4-K,6-2K)$ are collinear if:(A) $K=\frac{1}{2}$ (B) $K=\frac{-1}{2}$ (C) $K=\…
Topic: CUET 2025
 8
Consider the following Karnaugh Map (K-map). Minimal Function generated by this Karnaugh map is?1. $Q'S+P'Q$2. $Q'S'+P'…
Topic: CUET 2025
 9
In a binary search tree, the worst case time complexity of inserting and deleting a key is:
Topic: CUET 2025
 10
Match List-I with List-II List-I List-II         (A) If $\begin{vmatrix}\l…
Topic: CUET 2025
Ask Your Question or Put Your Review.

loading...