1
GATE CSE 2025 Set 2
MCQ (More than One Correct Answer)
+1
-0

Which of the following statements regarding Breadth First Search (BFS) and Depth First Search (DFS) on an undirected simple graph G is/are TRUE?

A
A DFS tree of $G$ is a Shortest Path tree of $G$.
B
Every non-tree edge of $G$ with respect to a DFS tree is a forward/back edge.
C
If $(u, v)$ is a non-tree edge of $G$ with respect to a BFS tree, then the distances from the source vertex $s$ to $u$ and $v$ in the BFS tree are within $\pm 1$ of each other.
D
Both BFS and DFS can be used to find the connected components of $G$.
2
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 ____
3
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 ____
4
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 ____
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP