Chevron Left
Retour à Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

Avis et commentaires pour d'étudiants pour Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming par Université de Stanford

4.8
étoiles
1,178 évaluations
141 avis

À propos du cours

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

Meilleurs avis

RG

26 avr. 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

29 juin 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!

Filtrer par :

76 - 100 sur 139 Avis pour Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

par Trung T V

13 sept. 2019

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

par Jayana G

14 août 2021

One of the best courses every CS student should take.

par Pritam M

20 avr. 2020

very detailed, very helpful, very much worth the time

par Andre C

10 juin 2019

Good old fav algorithms taught with current problems.

par David

13 juin 2017

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

par John W

11 sept. 2017

Still enjoying it -- looking forward to course 4!

par Yuxuan ( G

25 mai 2020

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

par shivaranjani g

18 juin 2021

Just perfect course to understand algorithm.

par Neeraj T

5 juil. 2019

I really liked the dynamic programming part

par Rishabh K

8 févr. 2018

clarity of exposition. stimulating lectures

par Marko D

20 févr. 2020

Great approach to a dynamic programming.

par Abdel H D

22 sept. 2018

Really great and challenging course!!!!

par Lin M K

27 mars 2018

Very difficult! That's what heroes do.

par Yu G

3 févr. 2021

Tough and highly-recommended course.

par Rafael E

26 juil. 2018

Another great course from Coursera!

par Александр М

16 janv. 2018

Great course! Challenging and fun.

par Hrithwik S

8 avr. 2020

Elaborate theory in many aspects.

par Miao Y

28 janv. 2017

It's challenging but interesting.

par Code A A

28 août 2019

Great learning. Quite tough too!

par Minsub L

10 sept. 2019

very good course of algorithms

par dynasty919

7 mars 2018

much harder than the past ones

par Ellen Y

22 mai 2017

Stellar explanations as usual

par Joseph Z

7 déc. 2020

Really hard, but really fun.

par Aakash K

7 sept. 2020

Great Course I learnt a lot.

par Haixu L

18 août 2020

Great course, learned a lot!