Chevron Left
Retour à Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

Avis et commentaires pour l'étudiant pour Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming par Université de Stanford

4.8
850 notes
92 avis

À propos du cours

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

Meilleurs avis

SW

Feb 25, 2019

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.

NT

Jun 14, 2019

As usual with Stanford and Tim Roughgarden, a high-quality course with an informal style but a lot of rigor. The assignments are challenging but doable. Highly recommended.

Filtrer par :

1 - 25 sur 89 Examens pour Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

par Dilyan M

Dec 10, 2018

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.

par Frank Z

Nov 27, 2018

Very great class!

par Ricardo D

Jan 01, 2019

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

par Garrett S

Jan 16, 2019

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

par Sachin G W

Feb 25, 2019

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.

par Saurav M

Mar 22, 2019

Nice course

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

par Abhishek C

Jul 11, 2018

excellent course

par Jesse D

Sep 08, 2018

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

par Abdel H D

Sep 22, 2018

Really great and challenging course!!!!

par Anirudh J

Aug 10, 2018

NICE

par Ashish D S

Aug 13, 2018

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!

par Nikola G

Aug 18, 2018

Difficult but enriching course! Really helpful to me :D

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

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

par Alexey P

Mar 08, 2017

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.

par Minyue D

Jul 04, 2017

Awesome Course!!!!!

par zhangdi

Dec 06, 2017

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

par Christopher J V

Jan 02, 2018

Tougher material, but very interesting and well laid out.

par Jonathan H

May 19, 2018

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

par KHANT S Z

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.

par Bhabaranjan P

Mar 25, 2017

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

par Jianghua F

Jan 10, 2018

WONDERFUL

par Ameen J

Feb 09, 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!

par Ahmad B E

Jun 16, 2017

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.