Computer Science · Data Structures and Algorithms
Which of the following statements about Depth First Search (DFS) are correct? A. It can detect cycles in a graph. B. It can be used to find connected components. C. It works for both directed and undirected graphs. D. It guarantees the shortest path in unweighted graphs.
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1B, C Only
- 2C, D Only
- 3A, B, C, D
- 4A, B, C Only✓
Correct answer
A, B, C Only
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Data Structures and Algorithms MCQs →Want more practice questions on Data Structures and Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Data Structures and Algorithms