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
992 évaluations
112 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

FC

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!

RG

Apr 27, 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.

Filtrer par :

51 - 75 sur 109 Avis pour Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

par Christopher J V

Jan 02, 2018

Tougher material, but very interesting and well laid out.

par Yiming Z

Jul 31, 2018

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

par BARUN K M

Jul 30, 2017

Very good course material with practical implementation.

par Nikola G

Aug 18, 2018

Difficult but enriching course! Really helpful to me :D

par Julius S

Jun 06, 2017

Good introductory coverage and challenging assignments.

par Vo T T

Sep 13, 2019

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

par Pritam M

Apr 20, 2020

very detailed, very helpful, very much worth the time

par Andre C

Jun 10, 2019

Good old fav algorithms taught with current problems.

par David H

Jun 13, 2017

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

par John W

Sep 12, 2017

Still enjoying it -- looking forward to course 4!

par Yuxuan ( G

May 25, 2020

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

par Neeraj T

Jul 05, 2019

I really liked the dynamic programming part

par Rishabh K

Feb 08, 2018

clarity of exposition. stimulating lectures

par Marko D

Feb 20, 2020

Great approach to a dynamic programming.

par Abdel H D

Sep 22, 2018

Really great and challenging course!!!!

par Lin M K

Mar 27, 2018

Very difficult! That's what heroes do.

par Rafael E

Jul 26, 2018

Another great course from Coursera!

par Александр М

Jan 16, 2018

Great course! Challenging and fun.

par Hrithwik S

Apr 09, 2020

Elaborate theory in many aspects.

par YangMiao

Jan 29, 2017

It's challenging but interesting.

par amosnier

Aug 28, 2019

Great learning. Quite tough too!

par Minsub L

Sep 10, 2019

very good course of algorithms

par dynasty919

Mar 07, 2018

much harder than the past ones

par Ellen Y

May 22, 2017

Stellar explanations as usual

par Jhon I

Nov 12, 2017

I have only say, fantastic.