1
GATE CSE 2018
MCQ (Single Correct Answer)
+2
-0.6
Let $$G$$ be a simple undirected graph. Let $${T_D}$$ be a depth first search tree of $$G.$$ Let $${T_B}$$ be a
breadth first search tree of $$G.$$ Consider the following statements.
$$(I)$$ No edge of $$G$$ is a cross edge with respect to $${T_D}.$$ ($$A$$ cross edge in $$G$$ is between
$$\,\,\,\,\,\,\,\,$$ two nodes neither of which is an ancestor of the other in $${T_D}.$$)
$$(II)$$ For every edge $$(u,v)$$ of $$G,$$ if $$u$$ is at depth $$i$$ and $$v$$ is at depth $$j$$ in $${T_B}$$, then
$$\,\,\,\,\,\,\,\,\,\,\,$$ $$\left| {i - j} \right| = 1.$$
Which of the statements above must necessarily be true?
2
GATE CSE 2018
Numerical
+2
-0
Let $$G$$ be a graph with $$100!$$ vertices, with each vertex labelled by a distinct permutation of the numbers $$1,2, β¦ , 100.$$ There is an edge between vertices $$u$$ and $$v$$ if and only if the label of $$u$$ can be obtained by swapping two adjacent numbers in the label of $$v.$$ Let $$π¦$$ denote the degree of a vertex in $$G,$$ and $$π§$$ denote the number of connected components in $$G.$$ Then, $$π¦ + 10π§ =$$ _____.
Your input ____
3
GATE CSE 2016 Set 2
MCQ (Single Correct Answer)
+2
-0.6
In an adjacency list representation of an undirected simple graph $$G = (V,E),$$ each edge $$(u, v)$$ has two adjacency list entries: $$[v]$$ in the adjacency list of $$u,$$ and $$[u]$$ in the adjacency list of $$v.$$ These are called twins of each other. A twin pointer is a pointer from an adjacency list entry to its twin. If $$|E| = m$$ and $$|V| = n,$$ and the memory size is not a constraint, what is the time complexity of the most efficient algorithm to set the twin pointer in each entry in each adjacency list?
4
GATE CSE 2015 Set 3
Numerical
+2
-0
Let $$G$$ be a connected undirected graph of $$100$$ vertices and $$300$$ edges. The weight of a minimum spanning tree of $$G$$ is $$500.$$ When the weight of each edge of $$G$$ is increased by five, the weight of a minimum spanning tree becomes ________.
Your input ____
Questions Asked from Graphs (Marks 2)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE 2025 Set 2 (1)
GATE CSE 2025 Set 1 (1)
GATE CSE 2024 Set 1 (1)
GATE CSE 2020 (1)
GATE CSE 2018 (2)
GATE CSE 2016 Set 2 (1)
GATE CSE 2015 Set 3 (1)
GATE CSE 2015 Set 1 (1)
GATE CSE 2012 (1)
GATE CSE 2010 (2)
GATE CSE 2008 (1)
GATE CSE 2007 (1)
GATE CSE 2006 (3)
GATE CSE 2001 (2)
GATE CSE 2000 (1)
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages