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

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

1,178 évaluations
141 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


29 juin 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!


26 avr. 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.

Filtrer par :

51 - 75 sur 139 Avis pour Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

par navin m

27 févr. 2021

Professor Tim Roughgarden provides an intuitive perspective to Dynamic Programming.

Thank you, Professor.

par Garrett S

15 janv. 2019

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

par Yifan Z

18 févr. 2018

This part is much harder to understand than the previous parts, but it's salutary actually.

par Bhabaranjana p

25 mars 2017

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

par Yuanzhan W

13 mai 2019

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

par Kevin H

29 oct. 2020

Great Course for really diving into data structures and algorithms. Thanks Tim!

par Omkar J

3 juil. 2020

Great Course, and a great Instructor, explains the granularity of and Algorithm

par Luiz C

8 avr. 2018

Tim Roughgarden manages to turn a dry topic like "Algos" into a sexy hot one!!

par Rickard A

27 juil. 2020

Good course! programming assignments were the most challenging but fun part!

par tao L

10 janv. 2018

Very useful in the product env, but still need more time to understand more

par Nitish P

2 oct. 2017

Dynamic Programming is much more clear to me after watching these lectures.

par Fernando J

13 juil. 2017

It was a great course, I really want to thank Tim for another great work.

par Jesse D

8 sept. 2018

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

par Feiyu L

29 avr. 2018

Makes Greedy algorithm and Dynamic Programming so clear to understand.

par Katrina C

17 avr. 2020

Dr. Roughgarden's explanations and examples are so great and helpful!

par Jonathan H

19 mai 2018

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

par Oleg B

21 mars 2020

Great course. A lot to learn. Syllabus is compressed, but clear.

par Chhavi B

7 juin 2020

Well, the way instructor makes you understand, is really great.

par Sucre C

31 mars 2020

Greedy Algos are fuzzy, but funny to do the mind experiments!

par Masashi K

17 oct. 2020

The hurdles were high, but the content was very rewarding.

par Christopher J V

2 janv. 2018

Tougher material, but very interesting and well laid out.

par Yiming Z

31 juil. 2018

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

par Barunkumar M

30 juil. 2017

Very good course material with practical implementation.

par Nikola G

18 août 2018

Difficult but enriching course! Really helpful to me :D

par Julius S

6 juin 2017

Good introductory coverage and challenging assignments.