Topological Sort

Choose difficulty:

Beginner

Intermediate

Advanced

1. Which of the following traversals in trees is equivalent to topological sort ?

a: Pre-Order Traversal Explanation

Explanation

b: Post-Order Traversal Explanation

Explanation

c: In-Order Traversal Explanation

Explanation

d: None of these Explanation

Explanation

2. Which of the following are applications of topological Sorting?
Finding prerequisite of a task
Finding Deadlock in an Operating System
Finding Cycle in a graph

a: 1 only Explanation

Explanation

b: 2 and 3 only Explanation

Explanation

c: 1,2 and 3 Explanation

Explanation

d: 2 only Explanation

Explanation

3. What is the most efficient Time Complexity of Topological Sorting?( N= number of vertices , E = number of edges)

a: O(N+E) Explanation

Explanation

b: O(N) Explanation

Explanation

c: O(V) Explanation

Explanation

d: O(V*E) Explanation

Explanation

4. The topological sort of Directed Acyclic graph is always unique.

a: False Explanation

Explanation

b: True Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

AGPL 3.0 & Creative Commons (CC BY-NC-SA 4.0)