1
GATE CSE 2021 Set 1
Numerical
+1
-0

Consider the following undirected graph with edge weights as shown:

GATE CSE 2021 Set 1 Data Structures - Graphs Question 5 English
The number of minimum-weight spanning trees of the graph is ______

Your input ____
2
GATE CSE 2016 Set 2
Numerical
+1
-0
Breadth First Search $$(BFS)$$ is started on a binary tree beginning from the root vertex. There is a vertex $$t$$ at a distance four from the root. If t is the $$n$$-th vertex in this $$BFS$$ traversal, then the maximum possible value of $$n$$ is ___________.
Your input ____
3
GATE CSE 2016 Set 1
Numerical
+1
-0
Consider the following directed graph: GATE CSE 2016 Set 1 Data Structures - Graphs Question 11 English

The number of different topological orderings of the vertices of the graph is ________________.

Your input ____
4
GATE CSE 2014 Set 3
Numerical
+1
-0
Suppose depth first search is executed on the graph below starting at some unknown vertex. Assume that a recursive call to visit a vertex is made only after first checking that the vertex has not been visited earlier. Then the maximum possible recursion depth (including the initial call) is _________. GATE CSE 2014 Set 3 Data Structures - Graphs Question 27 English
Your input ____
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP