Chevron Left
Voltar para Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

Comentários e feedback de alunos de Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming da instituição Universidade de Stanford

1,189 classificações

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

Melhores avaliações


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!


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.

Filtrar por:

51 — 75 de 139 Avaliações para o Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

por navin m

27 de fev de 2021

Professor Tim Roughgarden provides an intuitive perspective to Dynamic Programming.

Thank you, Professor.

por Garrett S

15 de jan de 2019

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

por Yifan Z

18 de fev de 2018

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

por Bhabaranjana p

25 de mar de 2017

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

por Yuanzhan W

13 de mai de 2019

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

por Kevin H

29 de out de 2020

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

por Omkar J

3 de jul de 2020

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

por Luiz C

8 de abr de 2018

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

por Rickard A

27 de jul de 2020

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

por tao L

10 de jan de 2018

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

por Nitish P

2 de out de 2017

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

por Fernando J

13 de jul de 2017

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

por Jesse D

8 de set de 2018

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

por Feiyu L

29 de abr de 2018

Makes Greedy algorithm and Dynamic Programming so clear to understand.

por Katrina C

17 de abr de 2020

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

por Jonathan H

19 de mai de 2018

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

por Oleg B

21 de mar de 2020

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

por Chhavi B

7 de jun de 2020

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

por Sucre C

31 de mar de 2020

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

por Masashi K

17 de out de 2020

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

por Christopher J V

2 de jan de 2018

Tougher material, but very interesting and well laid out.

por Yiming Z

31 de jul de 2018

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

por Barunkumar M

30 de jul de 2017

Very good course material with practical implementation.

por Nikola G

18 de ago de 2018

Difficult but enriching course! Really helpful to me :D

por Julius S

6 de jun de 2017

Good introductory coverage and challenging assignments.