adplus-dvertising
frame-decoration

Question

When the topological sort of a graph is unique?

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.

None of the mentioned

Answer: (a).When there exists a hamiltonian path in the graph

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. When the topological sort of a graph is unique?

Similar Questions

Discover Related MCQs

Q. 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?

Q. Topological sort is equivalent to which of the traversals in trees?

Q. Topological sort can be implemented by?

Q. Topological sort of a Directed Acyclic graph is?

Q. What can be the applications of topological sorting?

Q. Topological sort starts from a node which has?

Q. Most Efficient Time Complexity of Topological Sorting is? (V ā€“ number of vertices, E ā€“ number of edges)

Q. Topological sort can be applied to which of the following graphs?

Q. The Pancake Problems (1975, 1979, 1973) did NOT involve which of the following people?

Q. When we realize a specific implementation of a pancake algorithm, every move when we find the greatest of the sized array and flipping can be modeled through __________

Q. In a computational complexity theory, a problem with decision making is said to be NP-complete when it is both in NP and NP-hard. What does NP mean?

Q. In addition to the pancake sorting problem, there is the case of the burnt pancake problem in which we are dealing with pancakes (discs) that are burnt on one side only. In this case it is taken that the burnt side must always end up _______

Q. Pancake Sorting appears in which of the following?

Q. How many flips does the simplest of pancake sorting techniques require?

Q. Which operation is most essential to the process of pancake sort?

Q. What is the time complexity for a given pancake sort given it undergoes ā€œnā€ flip operations?

Q. Which of the following is not true about QuickSort?

Q. The given array is arr = {2,6,1}. What are the pivots that are returned as a result of subsequent partitioning?

Q. What is the average case complexity of QuickSort?

Q. The given array is arr = {2,3,4,1,6}. What are the pivots that are returned as a result of subsequent partitioning?