Data Structure Topological Sorting Online Exam Quiz
Data Structure Topological Sorting GK Quiz. Question and Answers related to Data Structure Topological Sorting. MCQ (Multiple Choice Questions with answers about Data Structure Topological Sorting
Topological sort of a Directed Acyclic graph is?
Options
A : Always unique
B : Always Not unique
C : Sometimes unique and sometimes not unique
D : Always unique if graph has even number of vertices
A man wants to go different places in the world. He has listed them down all. But there are some places where he wants to visit before some other places. What application of graph can he use to determine that?
Options
A : Depth First Search
B : Breadth First Search
C : Topological Sorting
D : Dijkstra’s Shortest path algorithm
Which of the following is not an application of topological sorting?
Options
A : Finding prerequisite of a task
B : Finding Deadlock in an Operating System
C : Finding Cycle in a graph
D : Ordered Statistics
In most of the cases, topological sort starts from a node which has __________
Options
A : Maximum Degree
B : Minimum Degree
C : Any degree
D : Zero Degree
Most Efficient Time Complexity of Topological Sorting is? (V – number of vertices, E – number of edges)
Options
A : O(V + E)
B : O(V)
C : O(E)
D : O(V*E)
Topological sort is equivalent to which of the traversals in trees?
Options
A : Pre-order traversal
B : Post-order traversal
C : In-order traversal
D : Level-order traversal
Topological sort can be applied to which of the following graphs?
Options
A : Undirected Cyclic Graphs
B : Directed Cyclic Graphs
C : Undirected Acyclic Graphs
D : Directed Acyclic Graphs
Topological sort can be implemented by?
Options
A : Using Depth First Search
B : Using Breadth First Search
C : Using Depth and Breadth First Search
D : Using level ordered search
When the topological sort of a graph is unique?
Options
A : When there exists a hamiltonian path in the graph
B : In the presence of multiple nodes with indegree 0
C : In the presence of single node with indegree 0
D : In the presence of single node with outdegree 0
Data Structure Adjacency List more Online Exam Quiz
Data Structure Stack Operations
Data Structure Stack Using Queues
Data Structure String Reversal Recursion
Data Structure Threaded Binary Tree
Data Structure Undirected Graph
Data Structure Uniform Binary Search