学生对 Stanford University 提供的 Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming 的评价和反馈
课程概述
热门审阅
SC
Sep 22, 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.
YA
Feb 3, 2021
This course has wonderful lectures coupled with challenging but rewarding homework problems. It was a wonderful learning experience.
51 - Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming 的 75 个评论（共 150 个）
创建者 Ricardo D
•Dec 31, 2018
Great Pace - good examples - always going to the point - clear and providing good info in regards to the subject in study.
创建者 Brande G
•Jul 3, 2018
A great course, likewise the other courses in the series. It is probably the best series of algorithmic thinking courses.
创建者 Sriram V
•Sep 6, 2020
This specialization gets harder and harder. But the instructor is amazing and the course is designed beautifully.
创建者 Genyu Z
•Aug 21, 2019
It's nice. Teacher can give me inspirations from different point of views, which teaches me a lot. Thanks!
创建者 soroush j
•Jan 29, 2023
This course and dynamic programming is harder than the first two conceptually but rewarding at the end.
创建者 navin m
•Feb 27, 2021
Professor Tim Roughgarden provides an intuitive perspective to Dynamic Programming.
Thank you, Professor.
创建者 Vel T
•May 12, 2024
This course has two of the most difficult programming assignments I have ever encountered. Thank you!
创建者 Garrett S
•Jan 15, 2019
Great material and love the professor, Tim. Some quiz questions are tricky, but liked it overall.
创建者 Yifan Z
•Feb 17, 2018
This part is much harder to understand than the previous parts, but it's salutary actually.
创建者 Bhabaranjana p
•Mar 25, 2017
I am really satisfied by the course .....just love the lecture and slides too :) .....
创建者 Yuanzhan W
•May 13, 2019
This course is harder than the previous two in the specialization but equally fun.
创建者 Kevin H
•Oct 29, 2020
Great Course for really diving into data structures and algorithms. Thanks Tim!
创建者 Omkar J
•Jul 2, 2020
Great Course, and a great Instructor, explains the granularity of and Algorithm
创建者 Luiz C
•Apr 7, 2018
Tim Roughgarden manages to turn a dry topic like "Algos" into a sexy hot one!!
创建者 Rickard A
•Jul 27, 2020
Good course! programming assignments were the most challenging but fun part!
创建者 thomas l
•Jan 10, 2018
Very useful in the product env, but still need more time to understand more
创建者 Nitish P
•Oct 2, 2017
Dynamic Programming is much more clear to me after watching these lectures.
创建者 Fernando J
•Jul 13, 2017
It was a great course, I really want to thank Tim for another great work.
创建者 Jesse D
•Sep 8, 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.
创建者 Chhavi B
•Jun 7, 2020
Well, the way instructor makes you understand, is really great.
创建者 陈松坤
•Mar 31, 2020
Greedy Algos are fuzzy, but funny to do the mind experiments!