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

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

4.8
990 個評分
112 條評論

課程概述

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

熱門審閱

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!

篩選依據:

26 - Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming 的 50 個評論(共 109 個)

創建者 Alexey Z

Mar 11, 2020

A bit more difficult course comparing to the first two parts. Be prepared to spend more times on problem solving and programming assignments.

創建者 Johnathan F

Jan 14, 2018

I love Tim's excitement for algorithms. He really stands out as a quality teacher in his selection of content, explanations and enthusiasm.

創建者 Shiv K

Oct 16, 2017

Fantastic course that covered a good variety of content in sufficient details and delves into the fundamentals without sacrificing clarity.

創建者 Ameen J

Feb 09, 2017

I love how clear the videos (and notes) are and re-watching them really helped a lot! I wish there was more discussion on the forms though!

創建者 Subodh C

Sep 23, 2017

A more explanatory answer sheet would be helpful. Might need to be secured via limited time login session to avoid leaking on the web.

創建者 Quentin A

May 06, 2017

Outstanding course. Prof. Roughgarden is enthusiastic. The lectures, programming problems, and readings build a solid understanding.

創建者 Cole F

Mar 12, 2018

More difficult than previous sections of the course, but thoroughly enjoyable. Looking forward to the final iteration of this series!

創建者 Qinghua Z

Nov 23, 2017

I like this course, though some programming assignments takes me much time. It worth doing it. I learn a lot from this course.

創建者 Ricardo D

Jan 01, 2019

Great Pace - good examples - always going to the point - clear and providing good info in regards to the subject in study.

創建者 Brande G

Jul 03, 2018

A great course, likewise the other courses in the series. It is probably the best series of algorithmic thinking courses.

創建者 Genyu Z

Aug 21, 2019

It's nice. Teacher can give me inspirations from different point of views, which teaches me a lot. Thanks!

創建者 Garrett S

Jan 16, 2019

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

創建者 Yifan Z

Feb 18, 2018

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

創建者 Bhabaranjan P

Mar 25, 2017

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

創建者 Yuanzhan W

May 14, 2019

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

創建者 Luiz C

Apr 08, 2018

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

創建者 tao L

Jan 10, 2018

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

創建者 Nitish P

Oct 02, 2017

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

創建者 Fernando J

Jul 14, 2017

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

創建者 Jesse D

Sep 08, 2018

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

創建者 Feiyu L

Apr 29, 2018

Makes Greedy algorithm and Dynamic Programming so clear to understand.

創建者 Katrina C

Apr 17, 2020

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

創建者 Jonathan H

May 19, 2018

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

創建者 Oleg B

Mar 21, 2020

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

創建者 Sucre C

Mar 31, 2020

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