About this Course

47,145 recent views

Learner Career Outcomes

30%

started a new career after completing these courses

36%

got a tangible career benefit from this course

11%

got a pay increase or promotion
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Course 3 of 4 in the
Flexible deadlines
Reset deadlines in accordance to your schedule.
Intermediate Level
Approx. 15 hours to complete
English

Skills you will gain

Spanning TreeAlgorithmsDynamic ProgrammingGreedy Algorithm

Learner Career Outcomes

30%

started a new career after completing these courses

36%

got a tangible career benefit from this course

11%

got a pay increase or promotion
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Course 3 of 4 in the
Flexible deadlines
Reset deadlines in accordance to your schedule.
Intermediate Level
Approx. 15 hours to complete
English

Instructor

Offered by

Placeholder

Stanford University

Syllabus - What you will learn from this course

Content RatingThumbs Up95%(1,931 ratings)Info
Week
1

Week 1

4 hours to complete

Week 1

4 hours to complete
16 videos (Total 160 min), 4 readings, 2 quizzes
16 videos
Application: Sequence Alignment8m
Introduction to Greedy Algorithms12m
Application: Optimal Caching10m
Problem Definition5m
A Greedy Algorithm12m
Correctness Proof - Part I6m
Correctness Proof - Part II4m
Handling Ties [Advanced - Optional]7m
MST Problem Definition11m
Prim's MST Algorithm7m
Correctness Proof I15m
Correctness Proof II8m
Proof of Cut Property [Advanced - Optional]11m
Fast Implementation I14m
Fast Implementation II9m
4 readings
Week 1 Overview10m
Overview, Resources, and Policies10m
Lecture slides10m
Optional Theory Problems (Week 1)10m
2 practice exercises
Problem Set #130m
Programming Assignment #130m
Week
2

Week 2

4 hours to complete

Week 2

4 hours to complete
16 videos (Total 188 min), 2 readings, 2 quizzes
16 videos
Correctness of Kruskal's Algorithm9m
Implementing Kruskal's Algorithm via Union-Find I9m
Implementing Kruskal's Algorithm via Union-Find II13m
MSTs: State-of-the-Art and Open Questions [Advanced - Optional]9m
Application to Clustering11m
Correctness of Clustering Algorithm9m
Lazy Unions [Advanced - Optional]10m
Union-by-Rank [Advanced - Optional]12m
Analysis of Union-by-Rank [Advanced - Optional]14m
Path Compression [Advanced - Optional]14m
Path Compression: The Hopcroft-Ullman Analysis I [Advanced - Optional]9m
Path Compression: The Hopcroft-Ullman Analysis II [Advanced - Optional]11m
The Ackermann Function [Advanced - Optional]16m
Path Compression: Tarjan's Analysis I [Advanced - Optional]14m
Path Compression: Tarjan's Analysis II [Advanced - Optional]13m
2 readings
Week 2 Overview10m
Optional Theory Problems (Week 2)10m
2 practice exercises
Problem Set #230m
Programming Assignment #230m
Week
3

Week 3

3 hours to complete

Week 3

3 hours to complete
11 videos (Total 105 min), 1 reading, 2 quizzes
11 videos
Problem Definition10m
A Greedy Algorithm16m
A More Complex Example4m
Correctness Proof I10m
Correctness Proof II12m
Introduction: Weighted Independent Sets in Path Graphs7m
WIS in Path Graphs: Optimal Substructure9m
WIS in Path Graphs: A Linear-Time Algorithm9m
WIS in Path Graphs: A Reconstruction Algorithm6m
Principles of Dynamic Programming7m
1 reading
Week 3 Overview10m
2 practice exercises
Problem Set #330m
Programming Assignment #330m
Week
4

Week 4

4 hours to complete

Week 4

4 hours to complete
10 videos (Total 107 min), 3 readings, 3 quizzes
10 videos
A Dynamic Programming Algorithm9m
Example [Review - Optional]12m
Optimal Substructure13m
A Dynamic Programming Algorithm12m
Problem Definition12m
Optimal Substructure9m
Proof of Optimal Substructure6m
A Dynamic Programming Algorithm I9m
A Dynamic Programming Algorithm II9m
3 readings
Week 4 Overview10m
Optional Theory Problems (Week 4)10m
Info and FAQ for final exam10m
3 practice exercises
Problem Set #430m
Programming Assignment #430m
Final Exam30m

Reviews

TOP REVIEWS FROM GREEDY ALGORITHMS, MINIMUM SPANNING TREES, AND DYNAMIC PROGRAMMING

View all reviews

About the Algorithms Specialization

Algorithms

Frequently Asked Questions

More questions? Visit the Learner Help Center.