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
1
answer
1
MadeEasy Test Series: Algorithms  Graph Algorithms
asked
Dec 14, 2016
in
Algorithms
by
rahul sharma 5
Boss
(
25.3k
points)

141
views
madeeasytestseries
algorithms
graphalgorithms
shortestpath
dijkstrasalgorithm
+1
vote
1
answer
2
MadeEasy Test Series: Algorithms  Time Complexity
#plz check??
asked
Dec 12, 2016
in
Algorithms
by
Hradesh patel
Loyal
(
6.3k
points)

123
views
madeeasytestseries
algorithms
graphalgorithms
timecomplexity
+3
votes
2
answers
3
shortest path
Let P be a shortest path from some vertex s to some other vertex t in a directed graph. If the weight of each edge in the graph is increased by one, P will still be a shortest path from s to t. T/F
asked
Dec 6, 2016
in
Algorithms
by
dd
Veteran
(
57k
points)

340
views
graphalgorithms
shortestpath
graphtheory
+1
vote
3
answers
4
Find shortest path
asked
Nov 27, 2016
in
Algorithms
by
Rakesh K
Active
(
1.8k
points)

768
views
graphalgorithms
shortestpath
algorithms
graphtheory
dynamicprogramming
multistagegraph
+1
vote
0
answers
5
GATE199014
The following algorithm (written in pseudopascal) work on an undirected graph G program Explore (G) procedure Visit (u) begin if Adj (u) is not empty {comment:Adj (u) is the list of edges incident to u} then begin Select an edge from Adj (u); ... edges, given that each vertex can be accessed and removed from LIST in constant time. Also show that all edges of the graph are traversed.
asked
Nov 26, 2016
in
Algorithms
by
makhdoom ghaya
Boss
(
30.2k
points)

243
views
gate1990
descriptive
graphalgorithms
unsolved
+27
votes
3
answers
6
GATE200582b
Let $s$ and $t$ be two vertices in a undirected graph $G=(V,E)$ having distinct positive edge weights. Let $[X,Y]$ be a partition of $V$ such that $s \in X$ and $t \in Y$. Consider the edge $e$ having the minimum weight amongst all those edges that have ... weighted spanning tree a weighted shortest path from $s$ to $t$ an Euler walk from $s$ to $t$ a Hamiltonian path from $s$ to $t$
asked
Nov 14, 2016
in
Algorithms
by
jothee
Veteran
(
105k
points)

1.8k
views
gate2005
algorithms
graphalgorithms
normal
0
votes
0
answers
7
Gate 2016
Let G be aweighted connected undirected graph with distinct positive edge weights.If every edge weight is increased by the same value,then which of the following statements is/are TRUE? P: Minimum spanning tree of G does notchange Q: Shortest path between any pair of ... (D) Both PandQ answer is a. why not D ,I think Shortest path between any pair of vertices will also not change.
asked
Nov 6, 2016
in
Algorithms
by
vishwa ratna
Active
(
2.3k
points)

83
views
graphalgorithms
+5
votes
1
answer
8
Dijkstra's algorithm
What is the time complexity of Dijkstra’s algorithm if it is implemented using AVL Tree instead of Priority Queue over a graph G = (V, E)?
asked
Nov 5, 2016
in
Algorithms
by
vaishali jhalani
Active
(
4.7k
points)

857
views
algorithms
dijkstrasalgorithm
graphalgorithms
shortestpath
0
votes
0
answers
9
graph
Time taken in adding/removing an edge to/from adjacent list ?
asked
Nov 5, 2016
in
Algorithms
by
vaishali jhalani
Active
(
4.7k
points)

88
views
algorithms
graphalgorithms
+1
vote
1
answer
10
Dijkstra's Agorithm
When the graph contain negetive weight edges but no negetive weight cycle, in this case can dijkstra leads to incorrect result?
asked
Nov 4, 2016
in
Algorithms
by
vaishali jhalani
Active
(
4.7k
points)

333
views
algorithms
dijkstrasalgorithm
graphalgorithms
shortestpath
0
votes
1
answer
11
graph algorithm
Can we use DFS to detect the negetive weight cycle in a directed graph?
asked
Nov 4, 2016
in
Algorithms
by
vaishali jhalani
Active
(
4.7k
points)

113
views
algorithms
graphalgorithms
dfs
+2
votes
1
answer
12
minimum spanning tree
asked
Nov 4, 2016
by
vaishali jhalani
Active
(
4.7k
points)

92
views
algorithms
graphalgorithms
minimumspanningtrees
0
votes
0
answers
13
Kerala PSC AP Exam
Let G be a weighted undirected graph and e be an edge with mazimum weight in G. suppose there is a minimum weight spanning tree in G containing edge e. which of the following statements are always true? A) There exists a cutset in G having all edges of maximum ... G having all edges of maximum weight C) Edge e cannot be contained in a cycle D) All edges in G have the same weight
asked
Oct 27, 2016
in
DS
by
Sankaranarayanan P.N
Boss
(
11k
points)

78
views
graphtheory
minimumspanningtrees
graphalgorithms
+4
votes
2
answers
14
shortest path
asked
Oct 26, 2016
in
Algorithms
by
jenny101
Active
(
1.1k
points)

294
views
shortestpath
graphalgorithms
algorithms
+2
votes
1
answer
15
Shortest path length
asked
Oct 26, 2016
in
Algorithms
by
jenny101
Active
(
1.1k
points)

185
views
graphalgorithms
shortestpath
+14
votes
1
answer
16
MadeEasy Test Series: Algorithms  Graph Algorithms
For the graph given below Dijkstra's algorithm does not provide correct shortest path tree. Suppose a new graph that is different only in weight between Q to S is created. The number of values of edge [Q to S] that ensures that Dijkstra's provide the ... tree where the values of edge (Q to S) ∈ [20, 20] and P' is the source vertex are ______.
asked
Sep 24, 2016
in
Algorithms
by
User007
Active
(
1.5k
points)

853
views
madeeasytestseries
algorithms
graphalgorithms
shortestpath
dijkstrasalgorithm
+3
votes
1
answer
17
UGCNETDec2015III20
FloydWarshall algorithm utilizes _____ to solve the allpairs shortest paths problem on a directed graph in ____ time Greedy algorithm, $\theta(V^3)$ Greedy algorithm, $\theta(V^2 lgn)$ Dynamic programming, $\theta(V^3)$ Dynamic programming, $\theta(V^2 lgn)$
asked
Aug 9, 2016
in
Others
by
jothee
Veteran
(
105k
points)

646
views
ugcnetdec2015iii
graphalgorithms
+2
votes
1
answer
18
Is Bellman Ford Dynamic Programming approach ?
Is bellman ford a dynamic programming approach? If yes, what is the reason behind it? How do we find an optimal substructure and overlapping sub problems in this ?
asked
Jul 22, 2016
in
Algorithms
by
Khyati Tuli
(
157
points)

2.7k
views
algorithms
shortestpath
graphalgorithms
+1
vote
0
answers
19
MadeEasy Test Series 2015: Algorithms  Graph Algorithms
Here i have option III is doubt.how option III always correct.one counter example is if i choose a tree where s is root node and v1& v2 are its child node then above question property i.e the vertices V1 and V2 that are simultaneously ... from vertex s in a digraph is satisfies.but there is no any path from v1 to v2 or from v2 to v1.
asked
Jul 19, 2016
in
Algorithms
by
dileswar sahu
Active
(
1.1k
points)

152
views
madeeasytestseries
algorithms
graphalgorithms
dfs
+3
votes
1
answer
20
Bellman Ford Variation in Data Structures, tricky test ?
We have a Directed Graph with 100 vertexes. v1 > v2 > ... v100 and all edges weights is equal to 1. we want to used bellmanford for finding all shortest paths from v1 to other vertexes. this algorithm in each ... and maximum of steps in this problem? ُSolution says 2 and 100. anyone can say how the min and max steps is calculated?
asked
Jul 10, 2016
in
DS
by
Sara Nimlon
(
141
points)

472
views
algorithms
datastructure
graphalgorithms
shortestpath
+3
votes
2
answers
21
All pair shortest path
Algorithm which solves the all pair shortest path problem is A)Dijkstra's algorithm B)Floyd's algorith C)Prim's algorithmm D)Warshall's algorithm
asked
Jun 24, 2016
in
DS
by
vivekpinto07
(
229
points)

2.5k
views
graphalgorithms
graphtheory
+9
votes
3
answers
22
ISRO200780
Djikstra’s algorithm is used to Create LSAs Flood an internet with information Calculate the routing tables Create a link state database
asked
Jun 10, 2016
in
Algorithms
by
jothee
Veteran
(
105k
points)

2.7k
views
isro2007
algorithms
graphalgorithms
shortestpath
dijkstrasalgorithm
0
votes
2
answers
23
IISCCSAResearchTest6
Someone claims that Kruskal's algorithm for finding minimum spanning tree can return different spanning trees for the same input graph $G$. Do you agree with the claim? If so, why? If not, argue briefly why the claim is incorrect.
asked
Jun 8, 2016
in
Algorithms
by
jothee
Veteran
(
105k
points)

192
views
iisccsaresearch2016
descriptive
algorithms
graphalgorithms
minimumspanningtrees
iiscinterview
+1
vote
1
answer
24
ISI2014PCBCS3b
Let $G = (V, E)$ be an undirected weighted graph with all edge weights being positive. Design an efficient algorithm to find the maximum spanning tree of $G$.
asked
May 31, 2016
in
Algorithms
by
jothee
Veteran
(
105k
points)

215
views
descriptive
isi2014pcbcs
algorithms
spanningtree
graphalgorithms
+4
votes
1
answer
25
CMI2012B05b
Given an undirected weighted graph $G = (V, E)$ with nonnegative edge weights, we can compute a minimum cost spanning tree $T = (V, E')$. We can also compute, for a given source vertex $s \epsilon V$ , the shortest paths from s to every ... claim the statement is true or a counterexample if the statement is false. All the shortest paths from $s$ to the other vertices are unchanged.
asked
May 27, 2016
in
Algorithms
by
jothee
Veteran
(
105k
points)

308
views
cmi2012
descriptive
algorithms
graphalgorithms
minimumspanningtrees
+3
votes
0
answers
26
CMI2013B05
You are going abroad and you have to complete a number of formalities before you leave. Each task takes a full day to complete. Fortunately, you have an army of friends to help you and each task can be done by either you or any of ... . Model this problem formally using graphs. Describe an efficient algorithm for the problem and analyze the worstcase complexity of your algorithm.
asked
May 23, 2016
in
Algorithms
by
jothee
Veteran
(
105k
points)

50
views
cmi2013
descriptive
algorithms
graphalgorithms
+1
vote
1
answer
27
CMI2012B05a
Given an undirected weighted graph $G = (V, E)$ with nonnegative edge weights, we can compute a minimum cost spanning tree $T = (V, E')$. We can also compute, for a given source vertex $s \epsilon V$ , the shortest paths from s to every other vertex ... if you claim the statement is true or a counterexample if the statement is false. $T$ is still a minimum cost spanning tree of $G$.
asked
May 23, 2016
in
Algorithms
by
jothee
Veteran
(
105k
points)

69
views
cmi2012
descriptive
algorithms
graphalgorithms
minimumspanningtrees
+1
vote
1
answer
28
CMI2011B05
Let $G=(V,E)$ be a undirected graph. We say $S \subseteq V$ is a clique if and only if for all $u,\: v \: \in S$, the edge $(u, v)$ is in $E$. Now let $G=(V,E)$ be a graph in which each vertex has degree at most 5. Give an algorithm to find the largest clique in $G$. What is the complexity of your algorithm?
asked
May 19, 2016
in
Algorithms
by
jothee
Veteran
(
105k
points)

77
views
cmi2011
descriptive
algorithms
graphalgorithms
timecomplexity
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
Linear Algebra Important Points
GATE 2020
OFFICIAL GATE MOCK TEST RELEASED
IIITH: Winter Research Admissions 2019 (For Spring 2020)
TIFR and JEST exam
Follow @csegate
Recent questions tagged graphalgorithms
Recent Blog Comments
It's a question not a post..
i also don't have any pdf, actually, I added the...
i don't have , if you have upload it
@mohan123 Do you have all standard book...
bro can be upload all standard book questions in...
50,647
questions
56,475
answers
195,396
comments
100,381
users