FREE Course on Disjoint Set Union

Minimum Spanning Tree and Disjoint Set Union - I

In this session, Triveni will discuss about the Disjoint Set Union data-structure and introduce some examples where it can be applied. Analysis of the algorithm will be the focus. Live coding will be used to enhance understanding.

Feb 15, 2021 • 2h 0m

Triveni Mahatha

Minimum Spanning Tree and Disjoint Set Union - II

In this session, Triveni will discuss the Minimum Spanning Tree (MST) problem. And, use the Kruskal's algorithm to solve the MST problem. Focus will be to understand the algorithm clearly. Live coding will be used to enhance learning. Also, the basic knowledge of Graphs and Trees will be preferable.

Feb 16, 2021 • 2h 0m

Triveni Mahatha

Minimum Spanning Tree and Disjoint Set Union - III

In this session, Triveni will discuss the Prim's algorithm to solve the MST problem. Comparison between the Prim's and the Kruskal's algorithm will be drawn as well. Live coding will be used to enhance the learning experience of the learner. Basic understanding of Graphs and Trees is preferable.

Feb 17, 2021 • 2h 0m

Triveni Mahatha

Minimum Spanning Tree and Disjoint Set Union - IV

In this session, some common problems involving the use of DSU data structure will be discussed, for example - detect cycles in a graph. Understanding the concepts will be the focus. Also, scope to improve the time complexity will also be discussed. At the end, some practice problems will also be provided.

Feb 18, 2021 • 2h 0m

Triveni Mahatha