Avis et commentaires pour d'étudiants pour Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming par Université de Stanford
À propos du cours
Meilleurs avis
RG
Apr 27, 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.
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!
101 - 109 sur 109 Avis pour Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
par Putcha L N R
•Oct 13, 2018
Amazing course! Great content indeed!
par Siyu Z
•May 14, 2017
Need solution of quiz and final
par Anant K S
•May 22, 2019
A little too difficult.
par Yash G
•Jan 21, 2018
good course
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 Joern K
•Aug 30, 2018
Sometimes badly synchronized, there are also mistakes in the videos which haven't been corrected.
par Zheng W
•Jul 10, 2017
Sometimes the professor speaks too fast.
par Atul V
•Oct 06, 2019
Honestly Speaking, I didn't like the course much. The explanation was quite complicated. I had to learn most of the things from youtube.
par Rishabh T
•May 27, 2019
worst teaching skill
