Chevron Left
返回到 Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

學生對 斯坦福大学 提供的 Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming 的評價和反饋

1,012 個評分
115 條評論


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)....



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.


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!


76 - Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming 的 100 個評論(共 113 個)

創建者 dynasty919

Mar 07, 2018

much harder than the past ones

創建者 Ellen Y

May 22, 2017

Stellar explanations as usual

創建者 Jhon I

Nov 12, 2017

I have only say, fantastic.

創建者 Sergio S

Jul 13, 2019

Great course! It is hard!

創建者 Shuxiao C

Mar 06, 2018

hard but worthwhile

創建者 zhangdi

Dec 06, 2017


創建者 Minyue D

Jul 04, 2017

Awesome Course!!!!!

創建者 Nguyen T

Jul 05, 2017

Pretty challenging

創建者 Frank Z

Nov 27, 2018

Very great class!

創建者 Sui X

Jun 04, 2019

very good course

創建者 Abhishek C

Jul 11, 2018

excellent course

創建者 Rui Z

Sep 05, 2019

excellent! thx

創建者 Frederik D K

Oct 25, 2019

Great course!

創建者 Saurav M

Mar 22, 2019

Nice course

創建者 Zhiping L

Jun 23, 2020


創建者 Madhurya R

Sep 16, 2019

Great job

創建者 Jianghua F

Jan 10, 2018


創建者 francisco i

Mar 30, 2017


創建者 Nguyen K T

Aug 25, 2019


創建者 praveenkumar c

Jun 12, 2019


創建者 Anirudh J

Aug 10, 2018


創建者 Sanket S

Jul 07, 2017


創建者 Georgios K

Feb 01, 2020

A beautiful course, I had already done the other two parts of this series of courses. This course focuses on the Greedy Algorithms and Dynamic Programming. I had not used these two types of algorithms before.

The difficulty of the exercises is not great but there is one programming assignment which is really hard to debug. Nevertheless there are good points in the forum.

Professor and forum members thank you for this beautiful learning experience.

創建者 Brendan E

Jun 17, 2017

This really helped me to understand how to approach problems with a greedy algorithm mindset or a dynamic programming mindset. My only complaint is that week 4 could have used a concrete example for the optimal binary search tree.

創建者 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.