Online Course
Graph Search, Shortest Paths, and Data Structures
- Provider Coursera
- Cost Free Online Course (Audit)
- Session Upcoming
- Language English
- Certificate Paid Certificate Available
- Duration 4 weeks long
- Learn more about MOOCs
Taken this course? Share your experience with other students. Write review
This course is part of:
Overview
Class Central Tips
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).
Syllabus
Week 1
-Breadth-first and depth-first search; computing strong components; applications.
Week 2
-Dijkstra's shortest-path algorithm.
Week 3
-Heaps; balanced binary search trees.
Week 4
-Hashing; bloom filters.
-Breadth-first and depth-first search; computing strong components; applications.
Week 2
-Dijkstra's shortest-path algorithm.
Week 3
-Heaps; balanced binary search trees.
Week 4
-Hashing; bloom filters.
Taught by
Tim Roughgarden
Tags
Help Center
Most commonly asked questions about Coursera
Reviews for Coursera's Graph Search, Shortest Paths, and Data Structures Based on 0 reviews
- 5 star 0%
- 4 star 0%
- 3 star 0%
- 2 star 0%
- 1 star 0%
Did you take this course? Share your experience with other students.
Write a review
Never Stop Learning!
