Chevron Left
Back to Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

Learner Reviews & Feedback for Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming by Stanford University

4.8
stars
1,246 ratings

About the Course

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

Top reviews

RG

Apr 26, 2020

I learned more about Greedy Algorithms and Algorithms to compute MST's and their importance on real world problems. Also I got to start to understand Dynamic Programming in a way I didn't before.

FC

Jun 29, 2018

Tim Roughgarden is a fantastic teacher! He really cares about explaining in a simple manner and also give you useful hints and advices to dive deeper in all the topics of the course. Thanks, Tim!

Filter by:

26 - 50 of 145 Reviews for Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

By Christian K

•

Apr 25, 2021

Great course and best computer science instructor I've ever had (can't say enough good things about Tim). The end of the course (dynamic programming) was harder and kicked my butt a little, but I made it out with a much better grasp of the topics.

By Oleksandr S

•

Feb 17, 2020

It's a hard and challenging course. I'm really excited about the knowledge I gain. The greedy algorithms are really not so easy and you always can make an error. The Union-Find with ranking and Dynamic Programming are the pearl of the Course.

By Anastasia Z

•

Jan 30, 2018

I really liked this course as well as the first two courses from the algorithms specialization. I agree with other reviewers that this course is more challenging, which is a good thing - I learned a lot and enjoyed solving harder problems.

By Kelvin

•

Nov 11, 2017

This course is really challenging compared to previous courses. Problems introduced in Dynamic Programming are harder than I expected and course books they recommended will be needed to understand better about the lecturers of this course.

By Timi

•

Jan 23, 2021

This course has the most intuitive explanation of dynamic programming that I've ever seen. Tim sometimes speaks too fast, but if you slow down the video and take the time to understand what he's saying, you'll learn a lot.

By Rodolphe L

•

Mar 15, 2018

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.

By Huimin M

•

Jan 10, 2021

This course is very useful in deeply understanding the algorithm design and complexity. The problem set is actually very challenging to me. I would say it is the most challenging so far. So go take it.

By Aria B

•

Apr 23, 2020

Like the other courses in this specialization, the material is interesting and coherent. The pace is not fast enough to get lost and not so slow to insult your intelligence. I enjoyed it a lot!

By --

•

Apr 18, 2021

Great course, sometimes hard to understand, especially when teacher uses figures of speech. I want more practical assignments like for sequence alignment and kruskal implementation.

By Shubham C

•

Dec 31, 2020

Best (not one of the best) course available on web to learn theoretical algorithms. You will love it. Enjoy new journey and perspect to view and analyze algorithms. Loved it damn!

By Jephte E

•

Dec 27, 2019

I am very confident in the skills I learned. I have read some books on algorithms but this course makes the application so clear regardless of your programing language.

By Neil S

•

Mar 14, 2020

Very well explained and I learned a lot from the course. Recommended to anyone for learning Algorithms. Some of the problem sets make you think outside the box.

By Charles H

•

Jan 29, 2019

Some assigments are really difficult. Often I was glad to read some tips in the forum. But the course is definitely challenging and makes you learn many things.

By Dustin Z

•

Jan 30, 2021

A very good and challenging course. A great introduction to dynamic programming with many examples to practice and learn multiple programming paradigms.

By 谷心洋

•

Mar 11, 2020

Great course overall, but the problem sets are short of answers or explanations, so sometimes I feel really hard to understander some questions.

By Alexey Z

•

Mar 11, 2020

A bit more difficult course comparing to the first two parts. Be prepared to spend more times on problem solving and programming assignments.

By Johnathan F

•

Jan 14, 2018

I love Tim's excitement for algorithms. He really stands out as a quality teacher in his selection of content, explanations and enthusiasm.

By Shiv K

•

Oct 16, 2017

Fantastic course that covered a good variety of content in sufficient details and delves into the fundamentals without sacrificing clarity.

By Ameen J

•

Feb 9, 2017

I love how clear the videos (and notes) are and re-watching them really helped a lot! I wish there was more discussion on the forms though!

By Subodh C

•

Sep 23, 2017

A more explanatory answer sheet would be helpful. Might need to be secured via limited time login session to avoid leaking on the web.

By Quentin A

•

May 6, 2017

Outstanding course. Prof. Roughgarden is enthusiastic. The lectures, programming problems, and readings build a solid understanding.

By Cole F

•

Mar 11, 2018

More difficult than previous sections of the course, but thoroughly enjoyable. Looking forward to the final iteration of this series!

By Yosef A

•

Feb 4, 2021

This course has wonderful lectures coupled with challenging but rewarding homework problems. It was a wonderful learning experience.

By Qinghua Z

•

Nov 23, 2017

I like this course, though some programming assignments takes me much time. It worth doing it. I learn a lot from this course.

By Ricardo D

•

Dec 31, 2018

Great Pace - good examples - always going to the point - clear and providing good info in regards to the subject in study.