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
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
One of the greatest courses on this website. However, I believe this course will be more approachable if it contains more practical guide such as sample solution for algorithms.
This is an excellent course. Though the assignments are quite challenging, it is rewarding to complete them. Professor Roughgarden's explanations are wonderful.
Excellent video lectures. Great forums that discuss the problems and programming assignments. Challenging material, with satisfying rewards on finding solutions.
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.