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).
This course is part of the Algorithms Specialization
About this Course
Skills you will gain
- Data Structure
- Hash Table
Syllabus - What you will learn from this course
- 5 stars86.14%
- 4 stars11.52%
- 3 stars1.71%
- 2 stars0.25%
- 1 star0.36%
TOP REVIEWS FROM GRAPH SEARCH, SHORTEST PATHS, AND DATA STRUCTURES
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.
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
I like the handwritten slides during the lecture. It reminds me of actually sitting in class and the professor developing the material on the chalk board live. Very cool.
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.