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

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
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
Recent questions tagged dfs
–1
vote
0
answers
1
DFS (explain)
asked
1 day
ago
in
DS
by
balaganesh
(
111
points)

11
views
dfs
0
votes
0
answers
2
DFS Tree
Consider the tree arcs of a DFS traversal from a source node W in an unweighted, connected, undirected, acyclic graph. The tree T formed by the tree arcs is a data structure for computing 1. the shortest path between every pair of vertices. 2. the shortest path from W ... the graph. 3. the shortest paths from W to only those nodes that are leaves of T. 4. the longest path in the graph.
asked
Sep 1
in
Algorithms
by
K ANKITH KUMAR
(
173
points)

52
views
dfs
algorithms
graphalgorithms
0
votes
0
answers
3
DFSArticulation Point and Bridges
I want to find the articulation point and bridges in the above graph. Further for each vertex $v$ I want to compute $v.low=$min $\left \{ v.d, w.d \right \}$ where $v.d$=discovery time of vertex v $w.d$=discovery time of vertex w, ( ... help me with the values of v.low ? Because based on v.low I will be further able to solve articulation point and bridge problem.
asked
Aug 28
in
DS
by
Ayush Upadhyaya
Boss
(
12.6k
points)

26
views
graph
dfs
algorithms
0
votes
1
answer
4
Topological ordering and DFS
If we apply Topological and DFS traversal. Is there any intersection of ordering? Please explain.
asked
Aug 26
in
Algorithms
by
Rishav Kumar Singh
Active
(
4.2k
points)

36
views
topologicalsort
dfs
+1
vote
0
answers
5
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
in
DS
by
Na462
Loyal
(
5.7k
points)

25
views
dfs
datastructure
graphalgorithms
+1
vote
2
answers
6
Test Datastructure
We are provided with an undirected connected graph such that weight of all the edges is equal to some constant k. We wish to find the shortest distance between given pair of nodes. Which of the following statements is(are) true? I. We can use Depth First Search to ... correct result only if the given graph is a tree. Only I and II Only II and IV Only III and IV Only II and III
asked
Aug 11
in
Algorithms
by
Prince Sindhiya
Active
(
2.7k
points)

62
views
dfs
bfs
0
votes
0
answers
7
DFS BFS
Please give an example i didn't get it The depth of any DFS tree rooted at a vertex is at least as much as the depth of any BFS tree rooted at the same vertex.
asked
Aug 2
in
Algorithms
by
Rishav Kumar Singh
Active
(
4.2k
points)

24
views
dfs
bfs
algorithms
0
votes
0
answers
8
DFS algorithms
state TRUE or FALSE. and why Running a DFS on an undirected graph G = (V;E) always produces the same number of cross edges, no matter what order the vertex list V is in and no matter what order the adjacency lists for each vertex are in.
asked
Aug 2
in
Algorithms
by
Rishav Kumar Singh
Active
(
4.2k
points)

16
views
dfs
graphalgorithms
+3
votes
1
answer
9
DFS Algo
Is following statement true/false? A DFS of a directed graph always produces the same number of tree edges, i.e., independent of the order in which vertices are considered for DFS. Answer is FALSE please explain
asked
Jul 30
in
Algorithms
by
Rishav Kumar Singh
Active
(
4.2k
points)

32
views
dfs
algorithms
+1
vote
1
answer
10
#Algorithms #DFS
Consider the tree arcs of a $DFS$ 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 the shortest path between every pair of vertices. the shortest path from $W$ ... in the graph. the shortest paths from $W$ to only those nodes that are leaves of $T$. the longest path in the graph.
asked
May 28
in
Algorithms
by
iarnav
Loyal
(
8.1k
points)

84
views
algorithms
graphalgorithms
graphtheory
dfs
0
votes
0
answers
11
#Algorithms #DFS How to find if a directed graph G is strongly connected using DFS in one pass?
asked
May 13
in
Algorithms
by
iarnav
Loyal
(
8.1k
points)

56
views
graphtheory
algorithms
dfs
graphalgorithms
0
votes
1
answer
12
DFS Traversal
If DFS algorithm applied starting from vertex A' which uses stack data structure then the height of stack is needed in worst case for DFS traversal is ________? Soln. Its a simple piece of cake we just need to find that path which leads to maximum nodes ... 0 and when to start counting with 1 because such type of ambiguous question always let my question go wrong and its painful :(
asked
May 6
in
Algorithms
by
Na462
Loyal
(
5.7k
points)

67
views
dfs
algorithms
graphalgorithms
0
votes
0
answers
13
DFS Modification
How DFS(Depth First Search) modification is used to find whether a graph is planar or not ?
asked
Mar 21
in
Algorithms
by
ankitgupta.1729
Loyal
(
7.2k
points)

123
views
dfs
algorithms
graphalgorithms
shaisimonson
0
votes
0
answers
14
DFSAlgorithm
Let T be a depth first search tree in an undirected graph G. Vertices u and ν are leaves of this tree T. The degrees of both u and ν in G are at least 2. In such case in the graph there will be two cycles : One Cycle will contain u and other one v. There cannot be a graph containig a single cycle and containing both u and v and also satisfy above Constraint. Am I right?
asked
Feb 18
in
Algorithms
by
Na462
Loyal
(
5.7k
points)

128
views
dfs
algorithms
graphalgorithms
+2
votes
1
answer
15
Back edge,tree edge,forward edges in BFS
asked
Jan 27
in
DS
by
MIRIYALA JEEVAN KUMA
Active
(
2k
points)

389
views
algorithms
bfs
dfs
graphalgorithms
programminginc
datastructure
+1
vote
0
answers
16
DFS depth first search
asked
Jan 25
in
DS
by
budhu
(
139
points)

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

67
views
dfs
+2
votes
0
answers
18
made easy test series
For a directed graph, the absence of back edges in a DFS tree can have cycle. true or fale.please explain with an example.
asked
Jan 10
in
Algorithms
by
jaig
(
211
points)

52
views
madeeasytestseries
algorithms
dfs
+2
votes
1
answer
19
Ace testseries
How TO SOLVE?
asked
Jan 10
in
Algorithms
by
Deepak Mokili
(
307
points)

43
views
algorithms
dfs
+1
vote
0
answers
20
Test Series
Choose the correct option, from the following: I) We can find the cycle in the graph using BFS. II) We can find the cycle in the graph using DFS. III)Both Correct IV)Both wrong
asked
Jan 10
in
Programming
by
ankit_thawal
Active
(
2.1k
points)

37
views
dfs
cycle
0
votes
0
answers
21
made easy test series
asked
Jan 4
in
Algorithms
by
rohit vishkarma
Junior
(
935
points)

84
views
graph
dfs
+1
vote
1
answer
22
ace test series
asked
Dec 27, 2017
in
Algorithms
by
rohit vishkarma
Junior
(
935
points)

55
views
dfs
0
votes
0
answers
23
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.6k
points)

61
views
dfs
0
votes
0
answers
24
DFS times
asked
Dec 12, 2017
in
Programming
by
Shivam Chauhan
Loyal
(
8.9k
points)

85
views
dfs
algorithms
0
votes
1
answer
25
#Graphs #DS BFS AND DFS Question?
Can BFS and DFS both work cyclic and acyclic graphs?! Kindly explain for each of 'em. Thank you!
asked
Dec 9, 2017
in
Algorithms
by
iarnav
Loyal
(
8.1k
points)

272
views
algorithms
bfs
dfs
graphalgorithms
datastructure
+1
vote
1
answer
26
DFS Depth First Search
asked
Dec 3, 2017
in
Algorithms
by
Shubham Kumar Gupta
Junior
(
561
points)

88
views
dfs
algorithms
graphalgorithms
datastructure
0
votes
2
answers
27
DFS , how to slove it?
asked
Nov 18, 2017
in
DS
by
Parshu gate
Active
(
4.9k
points)

181
views
dfs
algorithms
graphalgorithms
datastructure
0
votes
0
answers
28
techtud
Let G is a graph with n vertices and m edges. Consider following statements : i. In DFS traversal, number of tree edges produced is independent of selection of starting vertex. ii. In BFS traversal, number of tree edges produced is independent of selection of starting vertex. iii. ... B) Only statements (ii) and (iii) are correct (C) Statements (ii) and (iv) both are wrong (D) None of these
asked
Nov 7, 2017
in
Computer Networks
by
Manoja Rajalakshmi A
Active
(
3.7k
points)

126
views
computernetworks
dfs
bfs
+1
vote
1
answer
29
Depth first search
Consider the following graph G. Modified DFS on G applied as follows: • Starting vertex is ‘p’. • Vertex is visited based on alphabetic order. • Vertices are visited in order p, q, r, s, t, v. • It works same as DFS except the visiting order restriction What is the number of back edges during the above DFS traversal on G ______________
asked
Nov 7, 2017
in
Algorithms
by
shivangi5
Active
(
1.4k
points)

163
views
dfs
0
votes
0
answers
30
Single source softest path via DFS
Hi Guys, BFS could be used for finding single source shortest path in unweighted graph. But could we use DFS also ? Please share your valuable opinion. PS: I think after little bit modification DFS could also be used but it's running time will increase.
asked
Nov 4, 2017
in
Algorithms
by
Chhotu
Boss
(
11k
points)

41
views
graphalgorithms
algorithms
dfs
Page:
1
2
next »
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
Read/Unread questions
kvs pgt
Algorithms GO Classroom
Programming and DS GO Classroom
Discrete Mathematics GO Classroom
Follow @csegate
Gatecse
Recent questions tagged dfs
Recent Blog Comments
following link is Kvs_Pgt_Question Paper...
@Arjun sir how to remove such post? should i hide...
[email protected]
.Plz do share @Sanjay sharma
Please post it as question
This is blog area post it as question
39,815
questions
46,793
answers
140,928
comments
58,858
users