McqMate
Sign In
Hamberger menu
McqMate
Sign in
Sign up
Home
Forum
Search
Ask a Question
Sign In
McqMate Copyright © 2026
→
Computer Science Engineering (CSE)
→
Data Structures (DS)
→
Non Linear Data Structures - Graphs
→
The topological sorting of any DAG can b...
Q.
The topological sorting of any DAG can be done in time.
A.
cubic
B.
quadratic
C.
linear
D.
logarithmic
Answer» C. linear
687
0
Do you find this helpful?
9
View all MCQs in
Data Structures (DS)
Discussion
No comments yet
Login to comment
Related MCQs
If there are more than 1 topological sorting of a DAG is possible, which of the following is true.
Statement 1: Shell sort is a stable sorting algorithm. Statement 2: Shell sort is an in-place sorting algorithm.
What is an external sorting algorithm?
What is an internal sorting algorithm?
Which of the following is not an advantage of optimised bubble sort over other sorting techniques in case of sorted elements?
What is an in-place sorting algorithm?
What is the advantage of selection sort over other sorting techniques?
Which of the following sorting algorithm is stable?
Which of the following sorting algorithm is of divide-and-conquer type?
The earliest use of__________ sorting was in conjunction with network analysis.