Chevron Left
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming に戻る

スタンフォード大学(Stanford University) による Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming の受講者のレビューおよびフィードバック

4.8
1,170件の評価
139件のレビュー

コースについて

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
2020年4月26日

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
2018年6月29日

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!

フィルター:

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming: 51 - 75 / 137 レビュー

by Garrett S

2019年1月15日

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

by Yifan Z

2018年2月18日

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

by Bhabaranjana p

2017年3月25日

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

by Yuanzhan W

2019年5月13日

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

by Kevin H

2020年10月29日

Great Course for really diving into data structures and algorithms. Thanks Tim!

by Omkar K J

2020年7月3日

Great Course, and a great Instructor, explains the granularity of and Algorithm

by Luiz C

2018年4月8日

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

by Rickard A

2020年7月27日

Good course! programming assignments were the most challenging but fun part!

by tao L

2018年1月10日

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

by Nitish P

2017年10月2日

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

by Fernando J

2017年7月13日

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

by Jesse D

2018年9月8日

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

by Feiyu L

2018年4月29日

Makes Greedy algorithm and Dynamic Programming so clear to understand.

by Katrina C

2020年4月17日

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

by Jonathan H

2018年5月19日

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

by Oleg B

2020年3月21日

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

by Chhavi B

2020年6月7日

Well, the way instructor makes you understand, is really great.

by Sucre C

2020年3月31日

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

by Masashi K

2020年10月17日

The hurdles were high, but the content was very rewarding.

by Christopher J V

2018年1月2日

Tougher material, but very interesting and well laid out.

by Yiming Z

2018年7月31日

Harder than the first two courses and I really enjoy it!

by Barunkumar M

2017年7月30日

Very good course material with practical implementation.

by Nikola G

2018年8月18日

Difficult but enriching course! Really helpful to me :D

by Julius S

2017年6月6日

Good introductory coverage and challenging assignments.

by Trung T V

2019年9月13日

Thank you, teacher! This course is very helpful to me.