NEW
New Website Launch
Experience the best way to solve previous year questions with mock tests (very detailed analysis), bookmark your favourite questions, practice etc...
VISIT NOW

GATE CSE

Graphs

Data Structures

Previous Years Questions

Marks 1

More
Breadth First Search $$(BFS)$$ is started on a binary tree beginning from the root vertex. There is a vertex $$t$$ at a ...
GATE CSE 2016 Set 2
Consider the following directed graph: The number of different topological orderings of the vertices of the graph is ...
GATE CSE 2016 Set 1
Consider the tree arcs of a BFS traversal from a source node W in an unweighted, connected, undirected graph. The tree T...
GATE CSE 2014 Set 2
Let G be a graph with n vertices and m edges. What is the tightest upper bound on the running time of Depth First Search...
GATE CSE 2014 Set 1
Suppose depth first search is executed on the graph below starting at some unknown vertex. Assume that a recursive call ...
GATE CSE 2014 Set 3
In a depth-first traversal of a graph G with n vertices,k edges are marked as tree edges. The number of connected compon...
GATE CSE 2004
Consider the following graph among the following sequences I. a b e g h f II. a b f e h g III. a b f h g e IV. a f g...
GATE CSE 2003

Marks 2

More
Let G = (V, E) be a directed, weighted graph with weight function w: E $$ \to $$ R. For some function f: V $$ \to $$ R, ...
GATE CSE 2020
Let $$G$$ be a graph with $$100!$$ vertices, with each vertex labelled by a distinct permutation of the numbers $$1,2, …...
GATE CSE 2018
Let $$G$$ be a simple undirected graph. Let $${T_D}$$ be a depth first search tree of $$G.$$ Let $${T_B}$$ be a breadth ...
GATE CSE 2018
In an adjacency list representation of an undirected simple graph $$G = (V,E),$$ each edge $$(u, v)$$ has two adjacency ...
GATE CSE 2016 Set 2
Let $$G$$ be a connected undirected graph of $$100$$ vertices and $$300$$ edges. The weight of a minimum spanning tree o...
GATE CSE 2015 Set 3
Let G = (V, E) be a simple undirected graph, and s be a particular vertex in it called the source. For $$x \in V$$, let ...
GATE CSE 2015 Set 1
Let G be a weighted graph with edge weights greater than one and G' be the graph constructed by squaring the weights of ...
GATE CSE 2012
Consider a complete undirected graph with vertex set {0,1,2,3,4}. Entry Wij in the matrix W below is the weight of the e...
GATE CSE 2010
Consider a complete undirected graph with vertex set {0,1,2,3,4}. Entry Wij in the matrix W below is the weight of the e...
GATE CSE 2010
Consider the following sequence of nodes for the undirected graph given below. 1.a b e f d g c 2.a b e f c g d 3.a d ...
GATE CSE 2008
What is the largest integer m such that every simple connected graph with n vertices and n edges contains at least m dif...
GATE CSE 2007
Let T be a depth-first search tree in an undirected graph G. Vertices u and v are leaves of this tree T. The degrees of ...
GATE CSE 2006
Let T be a depth first search tree in an undirected graph G. Vertices u and v are leaves of this tree T. The degrees of ...
GATE CSE 2006
Consider the depth-first-search of an undirected graph with 3 vertices P, Q, and R. Let discovery time d(u) represent th...
GATE CSE 2006
How many undirected graphs (not necessarily connected) can be constructed out of a given set V = { v1,v2,........,vn } o...
GATE CSE 2001
Consider an undirected unweighted graph G. Let a breadth-first traversal of G be done starting from a node r. Let d(r, u...
GATE CSE 2001
Let G be an undirected graph. Consider a depth-first traversal of G, and let T be the resulting depth-first search tree....
GATE CSE 2000

Joint Entrance Examination

JEE Main JEE Advanced WB JEE

Graduate Aptitude Test in Engineering

GATE CSE GATE ECE GATE EE GATE ME GATE CE GATE PI GATE IN

Medical

NEET

CBSE

Class 12