Topological Sort
Prerequisites of the Experiment
This experiment requires you to have basic knowledge about:
- The Notion of Directed Acyclic Graphs
- Notion of Time and Space Complexity
- Graphs (Directed and Undirected) and Trees
- Notion of Time and Space complexity
- Notion of Trees and types
- Notion of DFS
And above all, a curiosity to learn and explore!
Overview of the Experiment
- The aim of this experiment is to understand the Topological Sort algorithms - Depth First Search and Kahn's algorithm along with their time and space complexity.
- The experiment features a series of modules with video lectures, interactive demonstrations, simulations, hands-on practice exercises and quizzes for self analysis.
Experiment Modules & their Weightage
| Module | Weightage | Expectation |
|---|---|---|
| Pre-test | 10% | Solve All Questions |
| Topological Sort: DFS Algorithm | 20% | Understand the DFS algorithm |
| Topological Sort: Kahn's Algorithm | 20% | Understand the Kahn's algorithm |
| Analysis | 25% | Understand the time and space complexity |
| Post-test | 25% | Solve all Questions |