Chevron Left
Zurück zu Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

Bewertung und Feedback des Lernenden für Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming von Stanford University

4.8
Sterne
1,190 Bewertungen

Über den Kurs

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-Bewertungen

FC

29. Juni 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!

RG

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

Filtern nach:

51 - 75 von 140 Bewertungen für Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

von navin m

27. Feb. 2021

Professor Tim Roughgarden provides an intuitive perspective to Dynamic Programming.

Thank you, Professor.

von Garrett S

15. Jan. 2019

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

von Yifan Z

18. Feb. 2018

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

von Bhabaranjan p

25. März 2017

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

von Yuanzhan W

13. Mai 2019

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

von Kevin H

29. Okt. 2020

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

von Omkar J

3. Juli 2020

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

von Luiz C

8. Apr. 2018

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

von Rickard A

27. Juli 2020

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

von tao L

10. Jan. 2018

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

von Nitish P

2. Okt. 2017

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

von Fernando J

13. Juli 2017

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

von Jesse D

8. Sep. 2018

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

von Feiyu L

29. Apr. 2018

Makes Greedy algorithm and Dynamic Programming so clear to understand.

von Katrina C

17. Apr. 2020

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

von Jonathan H

19. Mai 2018

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

von Oleg B

21. März 2020

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

von Chhavi B

7. Juni 2020

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

von Sucre C

31. März 2020

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

von Masashi K

17. Okt. 2020

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

von Christopher J V

2. Jan. 2018

Tougher material, but very interesting and well laid out.

von Yiming Z

31. Juli 2018

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

von Barunkumar M

30. Juli 2017

Very good course material with practical implementation.

von Nikola G

18. Aug. 2018

Difficult but enriching course! Really helpful to me :D

von Julius S

6. Juni 2017

Good introductory coverage and challenging assignments.