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
714 notes
78 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

FC

Jun 30, 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!

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.

Filtrer par :

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

par Nicolas T

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.

par praveen k

Jun 12, 2019

mass

par Andre C

Jun 10, 2019

Good old fav algorithms taught with current problems.

par Sui X

Jun 04, 2019

very good course

par Rishabh T

May 27, 2019

worst teaching skill

par Anant K S

May 22, 2019

A little too difficult.

par Yuanzhan W

May 14, 2019

This course is harder than the previous two in the specialization but equally fun.

par Bianca D

Mar 23, 2019

The forums are not very active, and there are a lot of unanswered questions from months and years ago. It seems like there have not been active staff/mentors in the forums for a while. Also the final exam had two duplicate problems from the problem sets.

par Saurav M

Mar 22, 2019

Nice course

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 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 Garrett S

Jan 16, 2019

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

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 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 Yifeng L

Nov 27, 2018

Course is great. However, for me, there's some lecture I cannot understand so I have to find another course with more explanation.

par Putcha L N R

Oct 13, 2018

Amazing course! Great content indeed!

par Abdel H D

Sep 22, 2018

Really great and challenging course!!!!

par Pawel K S

Sep 21, 2018

Great material, explained very well, but the lack of feedback on tough problem sets can be frustrating;

par Jesse D

Sep 08, 2018

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

par Joern K

Aug 30, 2018

Sometimes badly synchronized, there are also mistakes in the videos which haven't been corrected.

par Nikola G

Aug 18, 2018

Difficult but enriching course! Really helpful to me :D

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 Anirudh J

Aug 10, 2018

NICE

par Yiming Z

Jul 31, 2018

Harder than the first two courses and I really enjoy it!