GATE Computer Science (CS) 2021 Shift 2 Solved Paper

© examsiri.com

Question : 56 of 65

Marks: +1, -0

Consider the following directed graph:

Which of the following is/are correct about the graph?

The graph does not have a strongly connected component.
For each pair of vertices u and v, there is a directed path from u to v.
The graph does not have a topological order.
A depth-first traversal starting at vertex S classifies three directed edges as back edges.

Go to Question:

Prev Question

Next Question