The primary topics in this part of the specialization are: data structures (heaps, balanced search trees, hash tables, bloom filters), graph primitives (applications of breadth-first and depth-first search, connectivity, shortest paths), and their applications (ranging from deduplication to social network analysis).
À propos de ce cours
Compétences que vous acquerrez
- 5 stars86,19 %
- 4 stars11,46 %
- 3 stars1,71 %
- 2 stars0,26 %
- 1 star0,36 %
Meilleurs avis pour GRAPH SEARCH, SHORTEST PATHS, AND DATA STRUCTURES
Focused on principles and motivations behind algorithms. You might forget an algorithm you learned, but you will definitely be able to come up with one quickly after this course.
This is an excellent course. Though the assignments are quite challenging, it is rewarding to complete them. Professor Roughgarden's explanations are wonderful.
Thanks a lot to Prof Roughgarden for great lectures, to course mentors and fellow students for fruitful discussions. It was a hard, but insanely informative course.
Very well put together course. Problem sets are tricky; however, by the end of the course, you feel quite accomplished and comfortable dealing with graphs and basic data structures.
À 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.