Categories
Effort
Certification
Languages
Misc
MOOC List is learner-supported. When you buy through links on our site, we may earn an affiliate commission.
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).
MOOC List is learner-supported. When you buy through links on our site, we may earn an affiliate commission.
Course 2 of 4 in the Algorithms Specialization.
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.
MOOC List is learner-supported. When you buy through links on our site, we may earn an affiliate commission.
MOOC List is learner-supported. When you buy through links on our site, we may earn an affiliate commission.