Chevron Left
Volver a Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

Opiniones y comentarios de aprendices correspondientes a Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming por parte de Universidad de Stanford

1,189 calificaciones

Acerca del Curso

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

Principales reseñas


26 de abr. de 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.


29 de jun. de 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!

Filtrar por:

76 - 100 de 140 revisiones para Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

por Trung T V

13 de sep. de 2019

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

por Jayana G

14 de ago. de 2021

One of the best courses every CS student should take.

por Pritam M

20 de abr. de 2020

very detailed, very helpful, very much worth the time

por Andre C

10 de jun. de 2019

Good old fav algorithms taught with current problems.

por David

13 de jun. de 2017

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

por John W

11 de sep. de 2017

Still enjoying it -- looking forward to course 4!

por Yuxuan ( G

25 de may. de 2020

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

por shivaranjani g

18 de jun. de 2021

Just perfect course to understand algorithm.

por Neeraj T

5 de jul. de 2019

I really liked the dynamic programming part

por Rishabh K

8 de feb. de 2018

clarity of exposition. stimulating lectures

por Marko D

20 de feb. de 2020

Great approach to a dynamic programming.

por Abdel H D

22 de sep. de 2018

Really great and challenging course!!!!

por Lin M K

27 de mar. de 2018

Very difficult! That's what heroes do.

por Yu G

3 de feb. de 2021

Tough and highly-recommended course.

por Rafael E

26 de jul. de 2018

Another great course from Coursera!

por Александр М

16 de ene. de 2018

Great course! Challenging and fun.

por Hrithwik S

8 de abr. de 2020

Elaborate theory in many aspects.

por Miao Y

28 de ene. de 2017

It's challenging but interesting.

por Code A A

28 de ago. de 2019

Great learning. Quite tough too!

por Minsub L

10 de sep. de 2019

very good course of algorithms

por dynasty919

7 de mar. de 2018

much harder than the past ones

por Ellen Y

22 de may. de 2017

Stellar explanations as usual

por Joseph Z

7 de dic. de 2020

Really hard, but really fun.

por Aakash K

7 de sep. de 2020

Great Course I learnt a lot.

por Haixu L

18 de ago. de 2020

Great course, learned a lot!