Graph Search, Shortest Paths, and Data Structures (Coursera)

Graph Search, Shortest Paths, and Data Structures (Coursera)
Course Auditing
Categories
Effort
Certification
Languages
Misc

MOOC List is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

Graph Search, Shortest Paths, and Data Structures (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).

Class Deals by MOOC List - Click here and see Coursera's Active Discounts, Deals, and Promo Codes.

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.



10
Average: 10 ( 4 votes )

MOOC List is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

Course Auditing
41.00 EUR/month

MOOC List is learner-supported. When you buy through links on our site, we may earn an affiliate commission.