ToDoList

1. Week2 optional problem set
2. Set Cover problem
3. Week3 optional problem set
4. Week4 optional problem set
5. Week5 optional problem set
6. Implemenation your own heap(priority queue)
7. Insertion in a red-black tree
8. Week6 optional problem set
9. DPV book study, go through all of its contents
10. Part2_week1: optional problem; implement your own union find data structure
11. Part2_week2: Problem set 2 Q No.1. Come up with a correct algorithm that compute a max-weight acyclic subgraph for a directed graph
12. Part2_week2: Union find optional lectures; Different union find implementations.  optional problem.
13. Part2_week3: 2 knapsack problem with dynamic programming
14. Part2_week3: Maximum-weight idependent set of a tree using Dynamica Programming