Topological sort of a Directed Acyclic graph is?

Related MCQs

• When the topological sort of a graph is unique?
• Topological sort can be applied to which of the following graphs?
• In most of the cases, topological sort starts from a node which has __________
• A decomposition can be illustrated in the form of a directed graph with nodes corresponding to tasks and edges indicating that the result of one task is required for processing the next. Such graph is called as
• Suppose there are 16 elements in a series then how many phases will be required to sort the series using parallel odd-even bubble sort?
• Which of the following is not an application of topological sorting?
• In task dependency graph longest directed path between any pair of start and finish node is called as --------------
• A complete graph is a graph in which each pair of vertices is adjacent
• The complexity of bubble sort is Θ(n2).
• Bubble sort is difficult to parallelize since the algorithm has no concurrency.