Minimum Spanning Trees
Introduction
Prerequisites of the Experiment
This experiment requires you to have basic knowledge about :
- The Notion of Sorting
- Notion of Time and Space complexity
- Notion of Min and Max heaps
- Notion of Trees and types
- Concept of Union find algorithm
And above all, a curiosity to learn and explore..!
Overview of the Experiment
- The aim of this experiment is to understand the concept of MST, its time and space complexity against Kruskal's and Prim's algorithms
- The experiment features a series of modules with video lectures, interactive demonstrations, simulations, hands-on practice exercises and quizzes for self analysis.
Experiment Modules and Weightage
Module | Weightage | Expectation |
---|---|---|
Pre Test | 5% | Solve All Questions |
MST | 10% | Understand concept of MST |
Kruskal's Algorithm | 20% | Understand the Kruskal's Algorithm |
Analysis of Kruskal's | 15% | Understand the time and space complexity |
Prim's Algorithm | 20% | Understand the Prim's Algorithm |
Analysis of Prim's | 15% | Understand the time and space complexity |
Post Test | 10% | Solve all Questions |