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

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

4.8
864 個評分
95 個審閱

課程概述

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

熱門審閱

SW

Feb 25, 2019

One of the best courses to make a student learn DP in a way that enables him/her to think of the subproblems and way to proceed to solving these subproblems. Definitely helpful for me. Thanks.

NT

Jun 14, 2019

As usual with Stanford and Tim Roughgarden, a high-quality course with an informal style but a lot of rigor. The assignments are challenging but doable. Highly recommended.

篩選依據:

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

創建者 Lin M K

Mar 27, 2018

Very difficult! That's what heroes do.

創建者 Nguyen T

Jul 05, 2017

Pretty challenging

創建者 Rishabh K

Feb 08, 2018

clarity of exposition. stimulating lectures

創建者 Damian C

Mar 22, 2018

Excellent Course. I really enjoyed it. Stretched my imagination and analytical capacity to new frontiers. The problems studied during the course stimulate you to learn more about new algorithms and coding, There's so much more to learn now. Many thanks to Professor Roughgarden and his team for making this available. Keep the great work!

創建者 Fernando L C

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!

創建者 Luiz C

Apr 08, 2018

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

創建者 Alexey P

Mar 08, 2017

Tim does an excellent job explaining things at depth and at the same time keeping things interesting. The quizes and programming assignments are well thought and carefully balanced vs the material taught. They force you to stretch just a bit beyond the lectures, which is a good thing IMHO.

And there is a wealth of advanced/optional material for the curious.

創建者 Minyue D

Jul 04, 2017

Awesome Course!!!!!

創建者 Christopher J V

Jan 02, 2018

Tougher material, but very interesting and well laid out.

創建者 zhangdi

Dec 06, 2017

Stanford神课,占坑留名。3/4

創建者 Jonathan H

May 19, 2018

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

創建者 KHANT S Z

Nov 11, 2017

This course is really challenging compared to previous courses. Problems introduced in Dynamic Programming are harder than I expected and course books they recommended will be needed to understand better about the lecturers of this course.

創建者 Bhabaranjan P

Mar 25, 2017

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

創建者 Jianghua F

Jan 10, 2018

WONDERFUL

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

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

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

創建者 Sanket S

Jul 07, 2017

Good

創建者 Julius S

Jun 06, 2017

Good introductory coverage and challenging assignments.

創建者 Feiyu L

Apr 29, 2018

Makes Greedy algorithm and Dynamic Programming so clear to understand.

創建者 Александр М

Jan 16, 2018

Great course! Challenging and fun.

創建者 Shuxiao C

Mar 06, 2018

hard but worthwhile

創建者 John W

Sep 12, 2017

Still enjoying it -- looking forward to course 4!

創建者 Ellen Y

May 22, 2017

Stellar explanations as usual

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