The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
DFS depth first search
+2
votes
107
views
datastructure
dfs
graphalgorithms
graphconnectivity
asked
Jan 25, 2018
in
DS
by
budhu
(
139
points)

107
views
answer
comment
0
Option C
0
please provide complete explanation. in (c), R was discovered before Q, then how can it finish before Q?
0
You can see it here
https://www.geeksforgeeks.org/iterativedepthfirsttraversal/
0
yes, got it. thanks
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Prev. Qn. in Sub.
Next Qn. in Sub. →
← Prev.
Next →
Related questions
+1
vote
1
answer
1
DFS Depth First Search
asked
Dec 3, 2017
in
Algorithms
by
Shubham Kumar Gupta
(
443
points)

111
views
dfs
algorithms
graphalgorithms
datastructure
+1
vote
1
answer
2
Depth First Search: Finding if The graph is connected
Better Explanation??
asked
Dec 8, 2018
in
DS
by
pradeepchaudhary
Active
(
1.2k
points)

43
views
datastructure
dfs
graphalgorithms
+2
votes
0
answers
3
Depth first search
The maximum number of edges possible with UDG of n nodes,when DFS call on any random node in the graph result in stack size of 5. i.e. 5 function calls present in stack simultaneously are ......... Ans. 10
asked
Aug 21, 2018
in
DS
by
Na462
Loyal
(
6.8k
points)

135
views
dfs
datastructure
graphalgorithms
0
votes
0
answers
4
Depth First Search (DFS)
Consider the following sequence of nodes for the undirected graph given below$:$ $(1)PQSTWVUR$ $(2)PQRSTUWV$ $(3)PQRTUSVW$ A Depth First Search (DFS) is started at node $P.$The nodes are listed in the order they are first visited. Which all of the above are possible outputs$?$ $A)Only (2)$ $B)(1) and (2)$ $C)(2) and (3)$ $D)(1) and (2)$
asked
Nov 13, 2018
in
Algorithms
by
Lakshman Patel RJIT
Veteran
(
51.1k
points)

68
views
algorithms
graphalgorithms
dfs
0
votes
0
answers
5
Depth First Search
asked
Nov 7, 2018
in
Programming
by
Na462
Loyal
(
6.8k
points)

178
views
dfs
datastructure
graphalgorithms
+2
votes
0
answers
6
DFS Depth First Search
If we backtrack in DFS ,then doesn't statement 1 becomes true ?
asked
Jan 13, 2018
in
Graph Theory
by
Pawan Kumar 2
Active
(
4.2k
points)

82
views
dfs
0
votes
0
answers
7
DFS Depth First Search
Shouldn't ans be none ? If no where did I go wrong? kindly help
asked
Dec 25, 2017
in
Algorithms
by
Pawan Kumar 2
Active
(
4.2k
points)

80
views
dfs
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Resource to Learn Graph Theory Interactively
Recruitment to the post of Scientist/Engineer 'SC' (Electronics, Mechanical and Computer Science)
Standard Videos for Calculus
Standard Videos for Linear Algebra
Standard Videos for Graph Theory
All categories
General Aptitude
1.8k
Engineering Mathematics
7.3k
Digital Logic
2.9k
Programming and DS
4.9k
Programming
3.5k
DS
1.3k
Algorithms
4.4k
Theory of Computation
6.1k
Compiler Design
2.1k
Operating System
4.2k
Databases
4.1k
CO and Architecture
3.4k
Computer Networks
4.1k
Non GATE
1.6k
Others
1.8k
Admissions
595
Exam Queries
576
Tier 1 Placement Questions
23
Job Queries
72
Projects
17
Follow @csegate
Recent Blog Comments
It takes some time to update.
I have done the payment but when I check payment...
Awesome!
Yes sir the pdf is not yet given , lease provide...
Is Go book still available in Rs 1600 .I want to...
50,339
questions
55,765
answers
192,354
comments
90,815
users