About the content
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).
- Week 1 - Week 1
Two motivating applications; selected review; introduction to greedy algorithms; a scheduling application; Prim's MST algorithm.
- Week 2 - Week 2
Kruskal's MST algorithm and applications to clustering; advanced union-find (optional).
- Week 3 - Week 3
Huffman codes; introduction to dynamic programming.
- Week 4 - Week 4
Advanced dynamic programming: the knapsack problem, sequence alignment, and optimal binary search trees.
Coursera is a digital company offering massive open online course founded by computer teachers Andrew Ng and Daphne Koller Stanford University, located in Mountain View, California.
Coursera works with top universities and organizations to make some of their courses available online, and offers courses in many subjects, including: physics, engineering, humanities, medicine, biology, social sciences, mathematics, business, computer science, digital marketing, data science, and other subjects.