Comentários e feedback de alunos de Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming da instituição Universidade de Stanford

The course was excellent. I did not have enough time for all the optional videos, but I still feel like I learned a ton and I can always come back to them later, which is great. This specialization feels like it's getting a little easier for me with every course, which means that it's very well constructed and doing what it's supposed to do.

Very great class!

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

Great material and love the professor, Tim. Some quiz questions are tricky, but liked it overall.

One of the best courses to make a student learn DP in a way that enables him/her to think of the subproblems and way to proceed to solving these subproblems. Definitely helpful for me. Thanks.

Nice course

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.

excellent course

The most difficult course in the specialization so far. I learned a lot.

Really great and challenging course!!!!

NICE

Excellent course, I found this course hard as compared to earlier two courses. Many of the Lectures needs to be viewed twice to understand to my minimum level of satisfaction. Quizzes make sure that you understand concepts well and programming assignments are excellent!

Difficult but enriching course! Really helpful to me :D

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

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.

Tim does an excellent job explaining things at depth and at the same time keeping things interesting. The quizes and programming assignments are well thought and carefully balanced vs the material taught. They force you to stretch just a bit beyond the lectures, which is a good thing IMHO.

And there is a wealth of advanced/optional material for the curious.

Awesome Course!!!!!

Stanford神课，占坑留名。3/4

Tougher material, but very interesting and well laid out.

One of the best specializations on this site. Highly recommended!

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.

I am really satisfied by the course .....just love the lecture and slides too :) .....

WONDERFUL

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!

Great course for who is willing to learn new algorithms and having hard time to learn them alone by reading text box. The explanation is easy and clear. And the material is essential for who want to get started in greedy algorithms and dynamic programming.