Stanford University
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
Stanford University

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

This course is part of Algorithms Specialization

Tim Roughgarden

Instructor: Tim Roughgarden

76,842 already enrolled

Course

Gain insight into a topic and learn the fundamentals

4.8

(1,252 reviews)

|

95%

Intermediate level
Some related experience required
15 hours (approximately)
Flexible schedule
Learn at your own pace

Details to know

Earn a career certificate

Add to your LinkedIn profile

Assessments

9 quizzes

Taught in English

Course

Gain insight into a topic and learn the fundamentals

4.8

(1,252 reviews)

|

95%

Intermediate level
Some related experience required
15 hours (approximately)
Flexible schedule
Learn at your own pace

See how employees at top companies are mastering in-demand skills

Placeholder

Build your subject-matter expertise

This course is part of the Algorithms Specialization
When you enroll in this course, you'll also be enrolled in this Specialization.
  • Learn new concepts from industry experts
  • Gain a foundational understanding of a subject or tool
  • Develop job-relevant skills with hands-on projects
  • Earn a shareable career certificate
Placeholder
Placeholder

Earn a career certificate

Add this credential to your LinkedIn profile, resume, or CV

Share it on social media and in your performance review

Placeholder

There are 4 modules in this course

Two motivating applications; selected review; introduction to greedy algorithms; a scheduling application; Prim's MST algorithm.

What's included

16 videos4 readings2 quizzes

Kruskal's MST algorithm and applications to clustering; advanced union-find (optional).

What's included

16 videos2 readings2 quizzes

Huffman codes; introduction to dynamic programming.

What's included

11 videos1 reading2 quizzes

Advanced dynamic programming: the knapsack problem, sequence alignment, and optimal binary search trees.

What's included

10 videos3 readings3 quizzes

Instructor

Instructor ratings
4.8 (75 ratings)
Tim Roughgarden
Stanford University
6 Courses358,736 learners

Offered by

Recommended if you're interested in Algorithms

Why people choose Coursera for their career

Felipe M.
Learner since 2018
"To be able to take courses at my own pace and rhythm has been an amazing experience. I can learn whenever it fits my schedule and mood."
Jennifer J.
Learner since 2020
"I directly applied the concepts and skills I learned from my courses to an exciting new project at work."
Larry W.
Learner since 2021
"When I need courses on topics that my university doesn't offer, Coursera is one of the best places to go."
Chaitanya A.
"Learning isn't just about being better at your job: it's so much more than that. Coursera allows me to learn without limits."

Learner reviews

Showing 3 of 1252

4.8

1,252 reviews

  • 5 stars

    86.66%

  • 4 stars

    11.34%

  • 3 stars

    1.59%

  • 2 stars

    0.15%

  • 1 star

    0.23%

JF
5

Reviewed on Jan 13, 2018

YA
5

Reviewed on Feb 3, 2021

SK
5

Reviewed on Oct 15, 2017

New to Algorithms? Start here.

Placeholder

Open new doors with Coursera Plus

Unlimited access to 7,000+ world-class courses, hands-on projects, and job-ready certificate programs - all included in your subscription

Advance your career with an online degree

Earn a degree from world-class universities - 100% online

Join over 3,400 global companies that choose Coursera for Business

Upskill your employees to excel in the digital economy

Frequently asked questions