McqMate
Login
Register
Home
Search
Login
Register
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
View all MCQs in:
Data Structures (DS)
Discussion
Comment
Related Questions
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.
Login to Continue
It will take less than 2 minutes
Continue with Google
Continue with Linkedin
Continue with Twitter
Report MCQ
Remark*
Report