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).
Ce cours fait partie de la Spécialisation Algorithmes
Offert par
À propos de ce cours
Compétences que vous acquerrez
- Spanning Tree
- Algorithms
- Dynamic Programming
- Greedy Algorithm
Offert par
Programme de cours : ce que vous apprendrez dans ce cours
Week 1
Week 2
Week 3
Week 4
Avis
- 5 stars86,43 %
- 4 stars11,51 %
- 3 stars1,64 %
- 2 stars0,16 %
- 1 star0,24 %
Meilleurs avis pour GREEDY ALGORITHMS, MINIMUM SPANNING TREES, AND DYNAMIC PROGRAMMING
As usual with Stanford and Tim Roughgarden, a high-quality course with an informal style but a lot of rigor. The assignments are challenging but doable. Highly recommended.
Very well explained and I learned a lot from the course. Recommended to anyone for learning Algorithms. Some of the problem sets make you think outside the box.
I love Tim's excitement for algorithms. He really stands out as a quality teacher in his selection of content, explanations and enthusiasm.
Fantastic course that covered a good variety of content in sufficient details and delves into the fundamentals without sacrificing clarity.
À propos du Spécialisation Algorithmes

Foire Aux Questions
Quand aurai-je accès aux vidéos de cours et aux devoirs ?
À quoi ai-je droit si je m'abonne à cette Spécialisation ?
Une aide financière est-elle possible ?
D'autres questions ? Visitez le Centre d'Aide pour les Étudiants.