Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

SOE-YCS0011

Stanford School of Engineering


Thumbnail

Description

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).

Who Should Enroll

Learners with at least a little bit of programming experience who want to learn the essentials of algorithms. In a University computer science curriculum, this course is typically taken in the third year.

Time Commitment

4 weeks of study, 4-8 hours/week

Instructor

Tim Roughgarden, Professor of Computer Science