Beginner Data Structures & Algorithms
Q13 / 100

What does DFS stand for in graph algorithms?

Correct! Well done.

Incorrect.

The correct answer is B) Depth-First Search

B

Correct Answer

Depth-First Search

Explanation

Depth-First Search explores as far as possible along a branch before backtracking. It uses a stack (or recursion) and is useful for cycle detection and topological sort.

Previous All Questions Next
Progress
13/100
🌳

Browse All Data Structures & Algorithms Questions

100 questions · beginner to advanced