Which of the following is true about Kruskal and Prim MST algorithms? Assume that Prim is implemented for adjacency list representation using Binary Heap and Kruskal is implemented using union by rank.
  • a)
    Worst case time complexity of both algorithms is same.
  • b)
    Worst case time complexity of Kruskal is better than Prim
  • c)
    Worst case time complexity of Prim is better than Kruskal
Correct answer is option 'A'. Can you explain this answer?
Related Test: Greedy MCQ - 1

Computer Science Engineering (CSE) Question

Can you answer this question?

People are searching for an answer to this question.
This discussion on Which of the following is true about Kruskal and Prim MST algorithms? Assume that Prim is implemented for adjacency list representation using Binary Heap and Kruskal is implemented using union by rank.a)Worst case time complexity of both algorithms is same.b)Worst case time complexity of Kruskal is better than Primc)Worst case time complexity of Prim is better than KruskalCorrect answer is option 'A'. Can you explain this answer? is done on EduRev Study Group by Computer Science Engineering (CSE) Students. The Questions and Answers of Which of the following is true about Kruskal and Prim MST algorithms? Assume that Prim is implemented for adjacency list representation using Binary Heap and Kruskal is implemented using union by rank.a)Worst case time complexity of both algorithms is same.b)Worst case time complexity of Kruskal is better than Primc)Worst case time complexity of Prim is better than KruskalCorrect answer is option 'A'. Can you explain this answer? are solved by group of students and teacher of Computer Science Engineering (CSE), which is also the largest student community of Computer Science Engineering (CSE). If the answer is not available please wait for a while and a community member will probably answer this soon. You can study other questions, MCQs, videos and tests for Computer Science Engineering (CSE) on EduRev and even discuss your questions like Which of the following is true about Kruskal and Prim MST algorithms? Assume that Prim is implemented for adjacency list representation using Binary Heap and Kruskal is implemented using union by rank.a)Worst case time complexity of both algorithms is same.b)Worst case time complexity of Kruskal is better than Primc)Worst case time complexity of Prim is better than KruskalCorrect answer is option 'A'. Can you explain this answer? over here on EduRev! Apart from being the largest Computer Science Engineering (CSE) community, EduRev has the largest solved Question bank for Computer Science Engineering (CSE).