Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
Get a Reminder
| Rating | 4.7★ based on 95 ratings |
|---|---|
| Length | 5 weeks |
| Effort | 4 weeks of study, 4-8 hours/week |
| Starts | Jun 26 (44 weeks ago) |
| Cost | $79 |
| From | Stanford University via Coursera |
| Instructor | Tim Roughgarden |
| Download Videos | On all desktop and mobile devices |
| Language | English |
| Subjects | Programming Mathematics |
| Tags | Computer Science Algorithms Math And Logic |
Get a Reminder
Similar Courses
What people are saying
dynamic programming
Makes Greedy algorithm and Dynamic Programming so clear to understand.
By far the best lectures on dynamic programming that I've seen.
Dynamic Programming is much more clear to me after watching these lectures.
Excellent lectures on Dynamic Programming!
This really helped me to understand how to approach problems with a greedy algorithm mindset or a dynamic programming mindset.
And the material is essential for who want to get started in greedy algorithms and dynamic programming.
I really liked the dynamic programming part As usual with Stanford and Tim Roughgarden, a high-quality course with an informal style but a lot of rigor.
The Union-Find with ranking and Dynamic Programming are the pearl of the Course.
This course focuses on the Greedy Algorithms and Dynamic Programming.
Read more
first two courses
stimulating lectures I really liked this course as well as the first two courses from the algorithms specialization.
I would call this an intermediate level course and would recommend that this be done after the first two courses in the specialization.Coming to the quality of lectures.
Read more
harder than
I thought this course was kind of harder than the 2 previous one in the specialization (mainly the problems sets which require way more thinking)It's a very good quality course to strenghten the basics, but in depth.
much harder than the past ones hard but worthwhile This part is much harder to understand than the previous parts, but it's salutary actually.
Read more
very good
While i thought the algorithms are very good - It could use just a small amount of expansion on the specifics and background.
Very good course material with practical implementation.
very good course of algorithms excellent!
Read more
tim roughgarden
Tim Roughgarden manages to turn a dry topic like "Algos" into a sexy hot one!!
Tim Roughgarden is a fantastic teacher!
Read more
programming assignments
Stanford神课，占坑留名。3/4 I like this course, though some programming assignments takes me much time.
The quizes and programming assignments are well thought and carefully balanced vs the material taught.
Read more
Careers
An overview of related careers and their average salaries in the US. Bars indicate income percentile.
NATCEP Primary Instructor $43k
Educator-primary $54k
Primary Graphic Designer $54k
Trending topics reporter $58k
Primary Care Need $62k
Instructor for Continuing Ed Division in Communication and PR Topics $67k
Primary Care Clinician $68k
Primary Stitcher/First Hand $72k
Primary guitar technician $78k
Assistant Primary Therapist 1 $85k
Primary Care Physicians $114k
Primary Technical Writer $116k
Write a review
Your opinion matters. Tell us what you think.
Please login to leave a review
| Rating | 4.7★ based on 95 ratings |
|---|---|
| Length | 5 weeks |
| Effort | 4 weeks of study, 4-8 hours/week |
| Starts | Jun 26 (44 weeks ago) |
| Cost | $79 |
| From | Stanford University via Coursera |
| Instructor | Tim Roughgarden |
| Download Videos | On all desktop and mobile devices |
| Language | English |
| Subjects | Programming Mathematics |
| Tags | Computer Science Algorithms Math And Logic |
Similar Courses
Sorted by relevance
Like this course?
Here's what to do next:
- Save this course for later
- Get more details from the course provider
- Enroll in this course
