1
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?
A
$$\Theta(n)$$
B
$$\Theta(n+m)$$
C
$$\Theta(n^2)$$
D
$$\Theta(m^2)$$
2
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
A
k
B
k + 1
C
n-k-1
D
n-k
3
GATE CSE 2003
MCQ (Single Correct Answer)
+1
-0.3
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 h b e
GATE CSE 2003 Data Structures - Graphs Question 24 English What are depth first traversals of the above graph?
A
I, II and IV only
B
I and IV only
C
II, III and IV only
D
I, III and IV only
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Joint Entrance Examination
JEE MainJEE AdvancedWB JEEBITSAT
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN