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
Recent questions tagged graphalgorithms
+1
vote
0
answers
1
MadeEasy Test Series 2018: Algorithms  Graph Algorithms
A) S1 only B) S1 and S2 only C) S1 and S3 only D) All statements are true.
asked
Jan 8, 2018
in
Algorithms
by
Abhishek Kumar Singh
Junior
(
829
points)

95
views
algorithms
graphalgorithms
madeeasytestseries2018
madeeasytestseries
+2
votes
0
answers
2
Ace Test series: Algorithms  Graph Algorithms
asked
Jan 6, 2018
in
Algorithms
by
smsubham
Loyal
(
9.9k
points)

93
views
acetestseries
minimumspanningtrees
graphalgorithms
algorithms
+2
votes
0
answers
3
Ace Test series: Algorithms  Graph Algorithms
asked
Jan 6, 2018
in
Algorithms
by
smsubham
Loyal
(
9.9k
points)

91
views
acetestseries
algorithms
graphalgorithms
+2
votes
0
answers
4
Ace Test series: Algorithms  Spanning Tree
Am getting 7. The answer given is 10. A  B , A  D , D  E , E  C are the edges i have included.
asked
Jan 6, 2018
in
Algorithms
by
smsubham
Loyal
(
9.9k
points)

107
views
acetestseries
graphalgorithms
algorithms
spanningtree
minimumspanningtrees
+1
vote
0
answers
5
Dijkstra’s algorithms
Consider a weighted, directed acyclic graph G = (V,E,w) in which edges that leave the source vertex s may have negative weights and all other edge weights are nonnegative. Does Dijkstra’s algorithm correctly compute the shortestpath weight δ(s,t) from s to every vertex t in this graph? Justify your answer
asked
Jan 3, 2018
in
Algorithms
by
pranab ray
Junior
(
779
points)

106
views
algorithms
dijkstrasalgorithm
graphalgorithms
+1
vote
0
answers
6
MadeEasy Test Series: Algorithms  Spanning Tree
can someone provide a detailed solution of this??
asked
Jan 1, 2018
in
Algorithms
by
Kalpataru Bose
(
401
points)

248
views
madeeasytestseries
algorithms
graphalgorithms
spanningtree
minimumspanningtrees
greedyalgorithm
+2
votes
0
answers
7
Minimum Spanning Tree
Which of the following are correct for Minimum Spanning Tree from graph G with unique weights, with the weight function w: E→R (more than one possible) If we divide all weights by some non zero value MST will be unchanged (answer for both positive ... ) If we add or subtract all weights by some number MST will remain unchanged. (answer for both positive and negative values)
asked
Dec 25, 2017
in
Algorithms
by
smsubham
Loyal
(
9.9k
points)

134
views
algorithms
minimumspanningtrees
mst
graphalgorithms
0
votes
1
answer
8
shortest path
Read the following statements below For all the below questions consider the graph as simple and has positive weight edges. (i) Let the cost of the shortest path between two nodes is S.If the weight of every edge in the graph is doubled then weight of the ... We can use Kruskal's algorithm to find Minimum spanning tree of a directed graph . How many of the above statements are true.
asked
Dec 13, 2017
in
Algorithms
by
VIKAS TIWARI
Junior
(
697
points)

210
views
algorithms
shortestpath
graphalgorithms
negativecycles
0
votes
0
answers
9
BFS traversal sequence
Starting vertex is : $V_1$ Find the BFS traversal sequence
asked
Dec 12, 2017
in
Algorithms
by
Tuhin Dutta
Loyal
(
9.8k
points)

109
views
algorithms
bfs
graphalgorithms
datastructure
+4
votes
2
answers
10
TIFR2018B13
Let $n\geq 3,$ and let $G$ be a simple, connected, undirected graph with the same number $n$ of vertices and edges. Each edge of $G$ has a distinct real weight associated with it. Let $T$ be the minimum weight spanning tree of $G.$ Which of the following statements is ... weight edge of $C$ is not in $T.$ $T$ can be found in $O(n)$ time from the adjacency list representation of $G.$
asked
Dec 10, 2017
in
Algorithms
by
Arjun
Veteran
(
425k
points)

394
views
tifr2018
graphalgorithms
minimumspanningtrees
+6
votes
1
answer
11
TIFR2018B9
Let $G=(V,E)$ be a DIRECTED graph, where each edge $\large e$ has a positive weight $\large\omega(e),$ and all vertices can be reached from vertex $\large s.$ For each vertex $\large v,$ let $\large \phi(v)$ be the length of the shortest path from $\large s$ ... If $P$ is NOT a shortest path in $G,$ then $\omega'(P)<2\times \omega(P).$ All of the above options are necessarily TRUE.
asked
Dec 10, 2017
in
Algorithms
by
Arjun
Veteran
(
425k
points)

333
views
tifr2018
graphalgorithms
shortestpath
0
votes
1
answer
12
#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.3k
points)

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

117
views
dfs
algorithms
graphalgorithms
datastructure
0
votes
1
answer
14
MadeEasy Workbook: Algorithms  Graph Algorithms
asked
Dec 1, 2017
in
Algorithms
by
aaru14
(
493
points)

128
views
algorithms
graphalgorithms
madeeasybooklet
0
votes
1
answer
15
MadeEasy Subject Test: Algorithms  Graph Algorithms
complexity of kruskal algorithum for finding the minimum cost spanning tree of an undirected graph contain n vertices and m edges if the edge are already sorted.??
asked
Nov 30, 2017
in
Algorithms
by
aaru14
(
493
points)

99
views
madeeasytestseries
algorithms
graphalgorithms
0
votes
1
answer
16
Breadth first Search
asked
Nov 26, 2017
in
Algorithms
by
VS
Boss
(
10.6k
points)

150
views
bfs
graphalgorithms
+1
vote
2
answers
17
DFS , how to slove it?
asked
Nov 18, 2017
in
DS
by
Parshu gate
Active
(
3.1k
points)

269
views
dfs
algorithms
graphalgorithms
datastructure
+2
votes
3
answers
18
Prims algorithm
Consider the following graph and Assume node ‘P’ as the starting vertex for Prim’s algorithm. Which of the following can be the correct order of edges in which they are added to construct Minimum Spanning Tree (MST)? PQ, PX, XV, VU, UR, RS, RW, ST PQ, PX, XV, VU, UR, RW, RS, ST PQ, QR, RW, WV, VX, VU, RS, ST PQ, QR, RW, RS, VX, VU, WV, ST
asked
Nov 17, 2017
in
Algorithms
by
Parshu gate
Active
(
3.1k
points)

473
views
algorithms
primsalgorithm
graphalgorithms
+1
vote
0
answers
19
doubt regarding bridge
Whether we can find a bridge in a graph with the help of different types edges like forward edge, backward edge and cross edge? Please tell logic in algorithm.
asked
Nov 16, 2017
in
Algorithms
by
Diksha Aswal
Junior
(
779
points)

33
views
graphalgorithms
+2
votes
2
answers
20
Testbook Test Series: Algorithms  Graph Algorithms
(1). Both BFS and DFS require $\Omega (N)$ storage for their operation. (2). If we double the weight of every edge in the Graph shortest path between any two vertices will not change. Which of the following is/are True ? (and in every question of shortest path we have to think about negative weight ?)
asked
Nov 7, 2017
in
Algorithms
by
Mr_22B
Active
(
1.2k
points)

315
views
algorithms
testbooktestseries
graphalgorithms
+2
votes
1
answer
21
Bellman Ford
A pseudo code for Bellman Ford where each edge is relaxed k times where k>=1. Let the graph G be a simple connected and undirected graph . Let number of vertices be V, and number of edges be E . int i=1; for( i=1;i<=k;i++) { For each edge (u,v) ... . (ii) For proper running of the algorithm k can be equal to V1. (iii) For proper running of the algorithm k must be equal to E.
asked
Nov 6, 2017
in
Algorithms
by
shaurya vardhan
Active
(
2.1k
points)

238
views
algorithms
bellmanford
shortestpath
graphalgorithms
negativecycles
0
votes
1
answer
22
BFS TRAVERSAL
asked
Nov 5, 2017
in
DS
by
Parshu gate
Active
(
3.1k
points)

86
views
bfs
algorithms
graphalgorithms
0
votes
0
answers
23
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
(
13.4k
points)

47
views
graphalgorithms
algorithms
dfs
+1
vote
0
answers
24
Bellman Ford Algorithm (Edge sequence and convergence of algo.)
Hi Guys, As everyone knows Bellman Ford Algorithm works on DP approach. The algorithm calculate shortest paths in bottomup manner. It first calculates the shortest distances which have atmost one edge in the path. Then, ... is your opinion ? Refer > http://www.geeksforgeeks.org/dynamicprogrammingset23bellmanfordalgorithm/
asked
Nov 3, 2017
in
Algorithms
by
Chhotu
Boss
(
13.4k
points)

306
views
algorithms
shortestpath
bellmanford
graphalgorithms
+3
votes
2
answers
25
MadeEasy Subject Test: Algorithms  Graph Algorithms
Consider vertices V1 and V2 that are simultaneously on function call stack at some point during DFS from vertex s. Which of the following are always true for this digraph ? 1. There exists a directed path from s to V1 and s to ... only statement 3 is correct......How can we say that statement 1 is also correct please someone explain the reason
asked
Nov 1, 2017
in
Algorithms
by
Shivi rao
Junior
(
529
points)

180
views
madeeasytestseries
algorithms
graphalgorithms
0
votes
1
answer
26
DFS: Practice Exercise
Q1. Consider the following DFS algorithm for cycle detection in a graph. DFS(G) for each vertex u Belongs G.V u.color = WHITE U.pi = NIL time = 0 for each vertex u Belongs G.V if u.color == WHITE DFSVISIT(G , u) DFSVISIT(G, u) time = ... DFS tree if we draw an edge from one leaf node to another leaf node then that edge is called cross edge. Is this statement is true ??
asked
Oct 28, 2017
in
Algorithms
by
Shubhanshu
Boss
(
18.2k
points)

114
views
algorithms
graphalgorithms
dfs
+2
votes
0
answers
27
DFS: certain nodes not pushed to the stack.
Which of the following are true: 1. DFS continues to visited first unvisited successor of each node as long as possible. 2. Certain nodes are pushed into the stack. 3. DFS first visits all the immediate successors of a node before moving to their ... nodes are pushed into the stack. 3. False  this happens in BFS not in DFS. 4. True  Iterative DFS.
asked
Oct 20, 2017
in
Algorithms
by
Shubhanshu
Boss
(
18.2k
points)

224
views
algorithms
dfs
graphalgorithms
datastructure
+1
vote
0
answers
28
DFS: number of nodes not pushed into the stack.
I have seen these following question: Number of Vertices pushed more than once. https://gateoverflow.in/5296/numberofvsthatarepushedmorethanonceinadfs https://gateoverflow.in/98484/dfsusingstack Vertices not pushed ... and every vertex pushed exactly once into the stack http://www.geeksforgeeks.org/depthfirsttraversalforagraph/.
asked
Oct 19, 2017
in
Programming
by
Shubhanshu
Boss
(
18.2k
points)

798
views
algorithms
graphalgorithms
dfs
datastructure
0
votes
1
answer
29
Graph
How to solve this question ? Plz describe the detailed solution .
asked
Sep 30, 2017
in
Algorithms
by
ashwina
Active
(
1.7k
points)

87
views
algorithms
graphalgorithms
0
votes
0
answers
30
Floydwarshall for longest path problem
I have few doubts related to Longest distance problem. From Wikipedia > The NPhardness of the unweighted longest path problem can be shown using a reduction from the Hamiltonian path problem: a graph G has a ... normal algorithm as asked in (https://stackoverflow.com/questions/42500120/floydwarshallforlongestdistanceforundirectedgraph)
asked
Sep 8, 2017
in
Algorithms
by
Chhotu
Boss
(
13.4k
points)

537
views
graphalgorithms
dynamicprogramming
Page:
« prev
1
2
3
4
5
6
7
8
9
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
ECIL Interview Experience
Linear Algebra Important Points
GATE 2020
OFFICIAL GATE MOCK TEST RELEASED
IIITH: Winter Research Admissions 2019 (For Spring 2020)
Follow @csegate
Recent questions tagged graphalgorithms
Recent Blog Comments
Ok sir. Actually pricing on Flipkart is 200 less...
NO.
Is this application open for 2020 graduates i.e....
@Ayush Upadhyaya sir any approximate idea...
@Ayush Upadhyaya Thank you so much! ^_^
50,645
questions
56,596
answers
195,824
comments
102,072
users