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.
Recent questions tagged primsalgorithm
+2
votes
0
answers
1
TEST SERIES
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 to which they are added to construct Minimum Spanning Tree (MST)? PQ, QR, RW, RS, VX, VU, WV, ST PQ, QR, RW, WV, VX, VU, RS, ST PQ, PX, XV, VU, UR, RS, RW, ST PQ, PX, XV, VU, UR, RW, RS, ST PLEASE EXPLAIN.
asked
Jan 8
in
Algorithms
by
ankit_thawal
Loyal
(
2.5k
points)

81
views
primsalgorithm
spanningtree
minimumspanningtrees
greedyalgorithm
+5
votes
1
answer
2
How many MST is possible?
Given graph using Prim’s or Kruskal’s algorithm, find out that how many distinct minimum cost spanning trees are possible___? My answer was 1 and given is 2 ,what I am missing ? Edit:I had confirmed with it and answer is only one tree possible.
asked
Jan 2
in
Algorithms
by
sunil sarode
Active
(
1.3k
points)

115
views
algorithms
spanningtree
kruskalsalgorithm
primsalgorithm
+1
vote
2
answers
3
Regarding prims algo
Hello, I have doubt regarding prims algorithm 1)should we choose the lowest cost edge and then implement algo further? 2)Or we choose any vertex and then lowest cost edge of that vertex?
asked
Nov 24, 2017
in
DS
by
JPranavc
(
161
points)

39
views
algorithms
primsalgorithm
+1
vote
2
answers
4
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
Boss
(
6.5k
points)

150
views
algorithms
primsalgorithm
graphalgorithms
+1
vote
0
answers
5
MST Kruskal
First statement is False because complexity will be O(E2). I think the second statement is true? But not sure
asked
Nov 2, 2017
in
Algorithms
by
Shivam Chauhan
Boss
(
9.3k
points)

72
views
algorithms
mst
timecomplexity
primsalgorithm
+1
vote
0
answers
6
Prim's algorithm for MST
Assuming that the graph can contain repeated edge weights, we have a single tree at any instance when applying Prim's algorithm. Justify this statement.
asked
Oct 30, 2017
in
Algorithms
by
just_bhavana
Veteran
(
12.9k
points)

117
views
primsalgorithm
algorithms
+1
vote
1
answer
7
Analysis Of Prims Algorithm Time Complexity
Explain Prims Algorithm Analysis Of Time Complexity How does $\mathcal{O}(VlogV + ElogV)=\mathcal{O}(ElogV)$
asked
Sep 22, 2017
in
Algorithms
by
pC
Veteran
(
24.4k
points)

334
views
algorithms
primsalgorithm
timecomplexity
conceptualquestion
theory
0
votes
0
answers
8
Self Doubt (Graphs)
How to understand this: For a connected graph, V = O(E)) SOURCE http://www.geeksforgeeks.org/greedyalgorithmsset5primsmstforadjacencylistrepresentation/ prims algorithm time complexity for adjacency list representation. Also same is given in CLRS but no reason
asked
Sep 12, 2017
in
Algorithms
by
Anshul Shankar
Active
(
1.7k
points)

55
views
primsalgorithm
clrs
+1
vote
0
answers
9
prims algo from cormen
Here the graph that I was trying to find MST using algo in cormen.(If you need algo to ask, I supposed you have it) Algorithms uses min queue in process, my dobut is when it came to choice b/w vertex 'c' and 'd' as at that time both will ... wrong answer, so prism deal with this case? If you need algo I will given you, or just please refer chapter 23 cormen prim's algorithm.
asked
Aug 5, 2017
in
Algorithms
by
bhuv
Loyal
(
3.5k
points)

133
views
graphalgorithms
primsalgorithm
algorithms
+3
votes
2
answers
10
Difference between Kruskal's and Prim's algorithm ?
It may be the case that "Kruskal's Algorithm may not maintain connectivity while Prim's algorithm always does that" ? Any example which favours this ?
asked
Jan 24, 2017
in
Algorithms
by
Kapil
Veteran
(
51.6k
points)

1.4k
views
algorithms
graphalgorithms
kruskalsalgorithm
primsalgorithm
0
votes
0
answers
11
Prim's Algorithm
I am getting B and C both. Answer is given as C. Where am I wrong?
asked
Jan 24, 2017
in
Algorithms
by
Samujjal Das
Veteran
(
10.7k
points)

221
views
primsalgorithm
algorithms
0
votes
2
answers
12
virtualgate2015 algorithm
I think all options are wrong
asked
Jan 11, 2017
in
Algorithms
by
Purple
Loyal
(
4.3k
points)

167
views
virtualgate
testseries
spanningtree
minimumspanningtrees
primsalgorithm
0
votes
0
answers
13
Targate
Here it is mentioned as a queue and not a priority queue ,what would be the answer ?
asked
Jan 5, 2017
in
Algorithms
by
Harsh181996
Loyal
(
4.1k
points)

43
views
algorithms
graphalgorithms
primsalgorithm
0
votes
0
answers
14
virtual gate
both B and C correct order of prims algo?
asked
Dec 30, 2016
in
Algorithms
by
firki lama
Active
(
1.1k
points)

48
views
testseries
virtualgate
primsalgorithm
+2
votes
0
answers
15
Analysis Of Prims Algorithm
I have seen many varients of complexities using diferent data structures in implementing Prims Agorithm. Can you pls post standard algorithm and tells me in details how to derive the complexities. Please also mention the variations possibles when data structure changes and How will effect the complexity taking Best case and Worst case senarios .
asked
Dec 18, 2016
in
Algorithms
by
PEKKA
Loyal
(
2.6k
points)

220
views
algorithms
primsalgorithm
+2
votes
3
answers
16
#algorithm
Can Prim's and Kruskal's algorithm yield different minimum spanning trees? Explain why or why not.
asked
Oct 26, 2016
in
Algorithms
by
Geet
(
391
points)

354
views
minimumspanningtree
algorithms
kruskalsalgorithm
primsalgorithm
To see more, click for the
full list of questions
or
popular tags
.
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
My GATE journey
Believe..!!
Need a Serious Career Advice
Failure... ?
Applying to NUS
Follow @csegate
Gatecse
Recent questions tagged primsalgorithm
Recent Blog Comments
Congrats and Best of luck for life ahead :)
Congrats and Best of luck for life ahead :)
Congratulations @Hemant :) I am so happy for u. ...
Have u taken any online coaching ??
Same is for me. I am getting score 584. 2017 ...
34,239
questions
40,932
answers
116,230
comments
39,846
users