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).
About this Course
Skills you will gain
- 5 stars86.19%
- 4 stars11.46%
- 3 stars1.71%
- 2 stars0.26%
- 1 star0.36%
TOP REVIEWS FROM GRAPH SEARCH, SHORTEST PATHS, AND DATA STRUCTURES
assignments didn't seem as interesting or complex as class 1, besides week 1 of class 2. Lecture material was high quality however, and the advanced optional material is appreciated
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.
The best algorithms course available. More on the theoretical side which in my opinion is more important, if theory is understood, implementation becomes second nature.
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.
About the Algorithms Specialization
Frequently Asked Questions
When will I have access to the lectures and assignments?
What will I get if I subscribe to this Specialization?
Is financial aid available?
More questions? Visit the Learner Help Center.