Graph Search, Shortest Paths, and Data Structures

SOE-YCS0010

Stanford School of Engineering


Thumbnail

Description

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 Should Enroll

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.

Time to Complete

4 weeks of study, 4-8 hours/week

Instructor

Tim Roughgarden, Professor of Computer Science