Course can be found in Coursera
Quiz answers and notebook for quick search can be found in my blog SSQ
- Week 1:
- Greedy algorithm;
- Prim's Minimum Spanning Tree;
- Implementation based on jupyter notebook.
- Week 2:
- Kruskal's MST algorithm;
- applications to clustering;
- Implementation based on jupyter notebook;
- advanced union-find (optional).
- Week 3:
- Huffman's Algorithm;
- introduction to dynamic programming (max weight independent set);
- Implementation based on jupyter notebook.
- Week 4:
- Knapsack Algorithm;
- Implementation based on jupyter notebook;
- Sequence alignment;
- Optimal binary search trees.