Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
Offered By: Stanford University via Coursera
Course Description
Overview
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).
Syllabus
- Week 1
- Two motivating applications; selected review; introduction to greedy algorithms; a scheduling application; Prim's MST algorithm.
- Week 2
- Kruskal's MST algorithm and applications to clustering; advanced union-find (optional).
- Week 3
- Huffman codes; introduction to dynamic programming.
- Week 4
- Advanced dynamic programming: the knapsack problem, sequence alignment, and optimal binary search trees.
Taught by
Tim Roughgarden
Tags
Related Courses
Algorithms: Design and Analysis, Part 2Stanford University via Coursera Discrete Optimization
University of Melbourne via Coursera Conception et mise en œuvre d'algorithmes.
École Polytechnique via Coursera Computability, Complexity & Algorithms
Georgia Institute of Technology via Udacity Discrete Inference and Learning in Artificial Vision
École Centrale Paris via Coursera