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,193 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:

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

von Yifeng L

27. Nov. 2018

von Diego F

15. Aug. 2022

von Chris S

29. Mai 2018

von Pawel K S

20. Sep. 2018

von Andrey

15. Mai 2017

von Navneet K C

6. Sep. 2021

von Tianyi Z

17. Juli 2018

von PLN R

13. Okt. 2018

von Siyu Z

14. Mai 2017

von Anant K S

22. Mai 2019

von Yash G

21. Jan. 2018

von Bianca D

23. März 2019

von Joern K

30. Aug. 2018

von Zheng W

10. Juli 2017

von Atul V

6. Okt. 2019