Database-Management-System
March 8, 2025GATE-2024-CS1(Forenoon)
March 9, 2025BFS-and-DFS
| Question 14 |
Consider the following directed graph.
Suppose a depth-first traversal of this graph is performed, assuming that whenever there is a choice, the vertex earlier in the alphabetical order is to be chosen. Suppose the number of tree edges is T, the number of back edges is B and the number of cross edges is C. Then
Suppose a depth-first traversal of this graph is performed, assuming that whenever there is a choice, the vertex earlier in the alphabetical order is to be chosen. Suppose the number of tree edges is T, the number of back edges is B and the number of cross edges is C. Then
| B = 1, C = 1, and T = 4. | |
| B = 0, C = 2, and T = 4. | |
| B = 2, C = 1, and T = 3. | |
| B = 1, C = 2, and T = 3 | |
| B = 2, C = 2, and T = 1. |
Correct Answer: D
Subscribe
Login
0 Comments