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
All Activity
Questions
Unanswered
Tags
Categories
Users
Ask a Question
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
Recent questions tagged kruskalsalgorithm
0
votes
1
answer
1
GEEKS FOR GEEKS GATE 2017 MOCK
If Kruskal’s algorithm is used for finding a minimum spanning tree of a weighted graph G with n vertices and m edges and edge weights are already given in a sorted list, then, What will be the time complexity to compute the minimum cost spanning tree given that union and find operations take amortized O(1) ? A O(m logn) B O(n) C O(m) D O(n logm)
asked
Jun 9
in
Algorithms
by
Hirak
Active
(
3.4k
points)

79
views
kruskalsalgorithm
graphalgorithms
greedyalgorithm
datastructure
0
votes
1
answer
2
NTA NET DEC 2018 Q30
asked
Dec 25, 2018
in
Algorithms
by
Sanjay Sharma
Boss
(
48.2k
points)

125
views
kruskalsalgorithm
0
votes
2
answers
3
please explain also..
asked
Nov 10, 2018
in
Algorithms
by
Mak Indus
(
147
points)

54
views
algorithms
kruskalsalgorithm
0
votes
1
answer
4
Kruskal Algorithm
Complexity of Kruskal's algorithm for finding the minimum spanning tree of an undirected graph containing n vertices and m edges if the edges are unsorted is _______ ______________________________________________________________________________ If elements are sorted we do with Union Find algo with ... is $log^{*}V$ Now from here can we derive it for unsorted edges? for ref: here
asked
Jun 30, 2018
in
Algorithms
by
srestha
Veteran
(
113k
points)

161
views
algorithms
mst
kruskalsalgorithm
+5
votes
1
answer
5
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, 2018
in
Algorithms
by
sunil sarode
Active
(
1.2k
points)

423
views
algorithms
spanningtree
kruskalsalgorithm
primsalgorithm
+3
votes
2
answers
6
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
(
50.4k
points)

1.9k
views
algorithms
graphalgorithms
kruskalsalgorithm
primsalgorithm
0
votes
1
answer
7
doubt
Find the no. of minimum cost spanning tree using Kruskal’s or Primus algorithm i am getting "4" but the answer is given "5" ...verify please
asked
Jan 19, 2017
in
Algorithms
by
Prateek kumar
Loyal
(
8.4k
points)

171
views
kruskalsalgorithm
algorithms
+1
vote
1
answer
8
Analysis OF Kruskal's Algorithm
I have seen many varients of complexities using diferent data structures in implementing Kruskal 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
Active
(
1.9k
points)

2.7k
views
algorithms
kruskalsalgorithm
+2
votes
3
answers
9
#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
(
169
points)

523
views
minimumspanningtrees
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
ISI MTECH CS 2019 INTERVIEW EXPERIENCE
IIT HYDERABAD MTECH TA INTERVIEW EXPERIENCE
How to prepare for GATE with a fulltime job??
Interview Experience at IISc
All subject Gate notes from Standard Books!!
Follow @csegate
Recent questions tagged kruskalsalgorithm
Recent Blog Comments
received the GO books in good conditions!! thanks
Sir please update your stocks, when it will be...
Yes. Stock is over with Indiapost.
But on Amazon the stock is there and a way too...
49,830
questions
54,735
answers
189,349
comments
80,096
users