- Stanford University
- 4 weeks
- 4-8 hours/week
- Paid Certificate Available
- Part of:
- Algorithms | Coursera
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).
Who is this class for: Learners with at least a little bit of programming experience who want to learn the essentials of algorithms. In a University computer science curriculum, this course is typically taken in the third year.
Breadth-first and depth-first search; computing strong components; applications.
Dijkstra's shortest-path algorithm.
Heaps; balanced binary search trees.
Hashing; bloom filters.
- Go to Course: