1
GATE CSE 2014 Set 2
MCQ (Single Correct Answer)
+1
-0.3
Consider the tree arcs of a BFS traversal from a source node W in an unweighted, connected,
undirected graph. The tree T formed by the tree arcs is a data structure for computing
2
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 23 English](https://imagex.cdn.examgoal.net/c5yrlo5gKE380tMi3/1GpsgJX5JFVOTDwpqgstKyajEZBel/lSeHlB0VwRP8QVlVWeX78M/uploadfile.jpg)
![GATE CSE 2014 Set 3 Data Structures - Graphs Question 23 English](https://imagex.cdn.examgoal.net/c5yrlo5gKE380tMi3/1GpsgJX5JFVOTDwpqgstKyajEZBel/lSeHlB0VwRP8QVlVWeX78M/uploadfile.jpg)
Your input ____
3
GATE CSE 2014 Set 1
MCQ (Single Correct Answer)
+1
-0.3
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 on G, when G is represented as an adjacency matrix?
4
GATE CSE 2004
MCQ (Single Correct Answer)
+1
-0.3
In a depth-first traversal of a graph G with n vertices,k edges are marked as tree edges. The number of connected components in G is
Questions Asked from Graphs (Marks 1)
Number in Brackets after Paper Indicates No. of Questions
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