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

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming, Stanford University

4.8
Оценки: 591
Рецензии: 68

Об этом курсе

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

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

автор: JP

Oct 20, 2018

Great learning experience!!!\n\nI love dynamic p the most.\n\nAssignment 4 is so challenging that it takes me a week to finish the program and debug it!!!

автор: JF

Jan 14, 2018

I love Tim's excitement for algorithms. He really stands out as a quality teacher in his selection of content, explanations and enthusiasm.

Фильтр по:

Рецензии: 65

автор: Frank Zhu

Nov 27, 2018

Very great class!

автор: Yifeng Luo

Nov 27, 2018

Course is great. However, for me, there's some lecture I cannot understand so I have to find another course with more explanation.

автор: Putcha Lakshmi Narasimha Rahul

Oct 13, 2018

Amazing course! Great content indeed!

автор: Abdel Hechavarria Diaz

Sep 22, 2018

Really great and challenging course!!!!

автор: Pawel Kazimierz Socha

Sep 21, 2018

Great material, explained very well, but the lack of feedback on tough problem sets can be frustrating;

автор: Jesse Durham

Sep 08, 2018

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

автор: Joern Kottmann

Aug 30, 2018

Sometimes badly synchronized, there are also mistakes in the videos which haven't been corrected.

автор: Nikola Georgiev

Aug 18, 2018

Difficult but enriching course! Really helpful to me :D

автор: Ashish Dattatray Sarode

Aug 13, 2018

Excellent course, I found this course hard as compared to earlier two courses. Many of the Lectures needs to be viewed twice to understand to my minimum level of satisfaction. Quizzes make sure that you understand concepts well and programming assignments are excellent!

автор: Anirudh Jain

Aug 10, 2018

NICE