Chevron Left
Вернуться к Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

Отзывы учащихся о курсе Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming от партнера Стэнфордский университет

Оценки: 1,073
Рецензии: 125

О курсе

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

Лучшие рецензии

29 июня 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 апр. 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.

Фильтр по:

51–75 из 122 отзывов о курсе Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

автор: Fernando J

13 июля 2017 г.

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

автор: Jesse D

8 сент. 2018 г.

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

автор: Feiyu L

29 апр. 2018 г.

Makes Greedy algorithm and Dynamic Programming so clear to understand.

автор: Katrina C

17 апр. 2020 г.

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

автор: Jonathan H

19 мая 2018 г.

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

автор: Oleg B

21 мар. 2020 г.

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

автор: Chhavi B

7 июня 2020 г.

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

автор: Sucre C

31 мар. 2020 г.

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

автор: Christopher J V

2 янв. 2018 г.

Tougher material, but very interesting and well laid out.

автор: Yiming Z

31 июля 2018 г.

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

автор: BARUN K M

30 июля 2017 г.

Very good course material with practical implementation.

автор: Nikola G

18 авг. 2018 г.

Difficult but enriching course! Really helpful to me :D

автор: Julius S

6 июня 2017 г.

Good introductory coverage and challenging assignments.

автор: Trung T V

13 сент. 2019 г.

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

автор: Pritam M

20 апр. 2020 г.

very detailed, very helpful, very much worth the time

автор: Andre C

10 июня 2019 г.

Good old fav algorithms taught with current problems.

автор: David H

13 июня 2017 г.

I like MOOCs that force you to think and do the math.

автор: John W

11 сент. 2017 г.

Still enjoying it -- looking forward to course 4!

автор: Yuxuan ( G

25 мая 2020 г.

What can I say! (again) Such a wonderful course

автор: Neeraj T

5 июля 2019 г.

I really liked the dynamic programming part

автор: Rishabh K

8 февр. 2018 г.

clarity of exposition. stimulating lectures

автор: Marko D

20 февр. 2020 г.

Great approach to a dynamic programming.

автор: Abdel H D

22 сент. 2018 г.

Really great and challenging course!!!!

автор: Lin M K

27 мар. 2018 г.

Very difficult! That's what heroes do.