Free Online Course: Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming provided by Coursera is a comprehensive online course, which lasts for 4 weeks long, 15 hours worth of material. The course is taught in English and is free of charge. Upon completion of the course, you can receive an e-certificate from Coursera. Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming is taught by Tim Roughgarden.
4 weeks long, 15 hours worth of material
In progress
The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees).
