n topological sort, vertices are visited in which order?Marks : 1Negative Marks : 0Answer hereIn topological orderIn random orderIn descending order of their weightIn ascending order of their weight

Topological sort is equivalent to which of the traversals in trees?Marks : 1Negative Marks : 0Answer hereIn-order traversalPost-order traversalPre-order traversalLevel-order traversal

Which of the following is not an application of topological sorting?Marks : 1Negative Marks : 0Answer hereFinding Cycle in a graphFinding the prerequisite of a taskFinding Deadlock in an Operating SystemOrdered Statistics

Which one of the following is incorrect2 pointsA topological sort of a dag G (V,E) is a linear ordering of all its vertices.If the graph contains a cycle, then no linear ordering is possible.topological sort of a graph as an ordering of its vertices along a curvilinear line so that all directed edges go from left to right.All are correc

If vertices 2, 3 and 4 are added in the queue in the given order during the BFS visit, which vertex will be marked as visited first? Vertex 2 will be marked as visited first. Vertex 3 will be marked as visited first. Vertex 4 will be marked as visited first. None of the three given vertices will be marked as visited first.

What is the purpose of Topological Sorting in graph theory?A) To find the shortest path between two nodesB) To arrange vertices in a linear ordering based on directed edgesC) To calculate the average distance between nodesD) To find the maximum flow in a graph