Explore topic-wise MCQs in Data Structure.

This section includes 1 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.

Most Efficient Time Complexity of Topological Sorting 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