Kruskals algorithm Video Lecture | Algorithms - Computer Science Engineering (CSE)

81 videos|80 docs|33 tests

Top Courses for Computer Science Engineering (CSE)

FAQs on Kruskals algorithm Video Lecture - Algorithms - Computer Science Engineering (CSE)

1. What is Kruskal's algorithm used for?
Ans. Kruskal's algorithm is used to find the minimum spanning tree of a connected, edge-weighted graph.
2. How does Kruskal's algorithm work?
Ans. Kruskal's algorithm works by sorting the edges of the graph by their weights, then adding the edges in increasing order of weight while ensuring that no cycle is formed.
3. What is the time complexity of Kruskal's algorithm?
Ans. The time complexity of Kruskal's algorithm is O(E log E), where E is the number of edges in the graph.
4. When should Kruskal's algorithm be preferred over Prim's algorithm?
Ans. Kruskal's algorithm is preferred when the graph is sparse (has fewer edges) as it has a better time complexity than Prim's algorithm in such cases.
5. Can Kruskal's algorithm handle disconnected graphs?
Ans. Yes, Kruskal's algorithm can handle disconnected graphs by considering each connected component separately and finding the minimum spanning tree for each component.
81 videos|80 docs|33 tests
Explore Courses for Computer Science Engineering (CSE) exam
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
10M+ students study on EduRev
Related Searches

study material

,

past year papers

,

Kruskals algorithm Video Lecture | Algorithms - Computer Science Engineering (CSE)

,

Objective type Questions

,

mock tests for examination

,

Exam

,

pdf

,

Free

,

ppt

,

Sample Paper

,

shortcuts and tricks

,

video lectures

,

Viva Questions

,

Kruskals algorithm Video Lecture | Algorithms - Computer Science Engineering (CSE)

,

Kruskals algorithm Video Lecture | Algorithms - Computer Science Engineering (CSE)

,

practice quizzes

,

MCQs

,

Previous Year Questions with Solutions

,

Important questions

,

Summary

,

Semester Notes

,

Extra Questions

;