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).
Dieser Kurs ist Teil der Spezialisierung Spezialisierung Algorithmen
von
Über diesen Kurs
Kompetenzen, die Sie erwerben
- Graphs
- Data Structure
- Algorithms
- Hash Table
Lehrplan - Was Sie in diesem Kurs lernen werden
Week 1
Week 2
Week 3
Week 4
Bewertungen
- 5 stars86,17 %
- 4 stars11,48 %
- 3 stars1,71 %
- 2 stars0,25 %
- 1 star0,36 %
Top-Bewertungen von GRAPH SEARCH, SHORTEST PATHS, AND DATA STRUCTURES
Hope the professor could teach more about hashing and give a detailed implementation of some data structures or supply some interface template code.
Good course, but instructor does start to move fast and a few walk-throughs in certain spots would be beneficial . However the lack of it makes you do your own research, which is also beneficial.
It was an awesome experience to learn from such a teacher. Now I have a much clear view of the graph algorithms. I have enjoyed this course. Thanks to Stanford for offering this course.
Awesome course! Professor Roughgarden is fantastic. The material was appropriately challenging. Perfect amount of rigor. Only one minor squabble: the hash problem set is terribly misleading.
Über den Spezialisierung Algorithmen

Häufig gestellte Fragen
Wann erhalte ich Zugang zu den Vorträgen und Aufgaben?
Was bekomme ich, wenn ich diese Spezialisierung abonniere?
Ist finanzielle Unterstützung möglich?
Haben Sie weitere Fragen? Besuchen Sie das Learner Help Center.