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...
1

GATE CSE 2014 Set 3

Numerical
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 _________.
Your Input ________

Answer

Correct Answer is 19
2

GATE CSE 2004

MCQ (Single Correct Answer)
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)
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
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
Write for Us

Do you want to write for us? Help us by contributing to our platform.

Questions Asked from Graphs

On those following papers in Marks 1
Number in Brackets after Paper Indicates No. of Questions
GATE CSE 2016 Set 2 (1)
GATE CSE 2016 Set 1 (1)
GATE CSE 2014 Set 2 (1)
GATE CSE 2014 Set 3 (1)
GATE CSE 2014 Set 1 (1)
GATE CSE 2004 (1)
GATE CSE 2003 (1)

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