Explore topic-wise MCQs in Data Structure.

This section includes 2 Mcqs, each offering curated multiple-choice questions to sharpen your Data Structure knowledge and support exam preparation. Choose a topic below to get started.

1.

Which of the following is not an application of Depth First Search?

A. For generating topological sort of a graph
B. For generating Strongly Connected Components of a directed graph
C. Detecting cycles in the graph
D. Peer to Peer Networks
Answer» E.
Discussion
2.

Time Complexity of DFS is? (V number of vertices, E number of edges)

A. O(V + E)
B. O(V)
C. O(E)
D. O(V*E)
Answer» B. O(V)
Discussion