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).
Overview
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.
Taught by
Tim Roughgarden
