WEEK 6

Greedy - 30th March 2022

1. Prim’s Algorithm
   Given a weighted undirected graph. Find the sum of weights of edges of a Minimum Spanning Tree using Prims Algorithm.

2. Kruskal’s Algorithm
   Given a weighted undirected graph. Find the sum of weights of edges of a Minimum Spanning Tree.

3. Huffman Coding
   Given a set of n characters and their frequencies. Find out their codes using Huffman encoding. Consider left child = 0, right child = 1