About this Course

62,551 recent views

Learner Career Outcomes

41%

started a new career after completing these courses

48%

got a tangible career benefit from this course
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Course 2 of 4 in the
Flexible deadlines
Reset deadlines in accordance to your schedule.
Intermediate Level
Approx. 15 hours to complete
English

Skills you will gain

GraphsData StructureAlgorithmsHash Table

Learner Career Outcomes

41%

started a new career after completing these courses

48%

got a tangible career benefit from this course
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Course 2 of 4 in the
Flexible deadlines
Reset deadlines in accordance to your schedule.
Intermediate Level
Approx. 15 hours to complete
English

Instructor

Offered by

Placeholder

Stanford University

Syllabus - What you will learn from this course

Content RatingThumbs Up93%(2,342 ratings)Info
Week
1

Week 1

4 hours to complete

Week 1

4 hours to complete
9 videos (Total 162 min), 4 readings, 2 quizzes
9 videos
Breadth-First Search (BFS): The Basics14m
BFS and Shortest Paths7m
BFS and Undirected Connectivity13m
Depth-First Search (DFS): The Basics7m
Topological Sort21m
Computing Strong Components: The Algorithm29m
Computing Strong Components: The Analysis26m
Structure of the Web [Optional]18m
4 readings
Week 1 Overview10m
Overview, Resources, and Policies10m
Lecture slides10m
Optional Theory Problems (Week 1)10m
2 practice exercises
Problem Set #130m
Programming Assignment #130m
Week
2

Week 2

3 hours to complete

Week 2

3 hours to complete
4 videos (Total 79 min), 2 readings, 2 quizzes
4 videos
Dijkstra's Algorithm: Examples12m
Correctness of Dijkstra's Algorithm19m
Dijkstra's Algorithm: Implementation and Running Time26m
2 readings
Week 2 Overview10m
Optional Theory Problems (Week 2)10m
2 practice exercises
Problem Set #230m
Programming Assignment #230m
Week
3

Week 3

4 hours to complete

Week 3

4 hours to complete
9 videos (Total 142 min), 1 reading, 2 quizzes
9 videos
Heaps: Operations and Applications18m
Heaps: Implementation Details [Advanced - Optional]20m
Balanced Search Trees: Operations and Applications10m
Binary Search Tree Basics, Part I13m
Binary Search Tree Basics, Part II30m
Red-Black Trees21m
Rotations [Advanced - Optional]7m
Insertion in a Red-Black Tree [Advanced]14m
1 reading
Week 3 Overview10m
2 practice exercises
Problem Set #330m
Programming Assignment #330m
Week
4

Week 4

5 hours to complete

Week 4

5 hours to complete
9 videos (Total 171 min), 3 readings, 3 quizzes
9 videos
Hash Tables: Implementation Details, Part I18m
Hash Tables: Implementation Details, Part II22m
Pathological Data Sets and Universal Hashing Motivation21m
Universal Hashing: Definition and Example [Advanced - Optional]25m
Universal Hashing: Analysis of Chaining [Advanced - Optional]18m
Hash Table Performance with Open Addressing [Advanced - Optional]15m
Bloom Filters: The Basics15m
Bloom Filters: Heuristic Analysis13m
3 readings
Week 4 Overview10m
Optional Theory Problems (Week 4)10m
Info and FAQ for final exam10m
3 practice exercises
Problem Set #430m
Programming Assignment #430m
Final Exam30m

Reviews

TOP REVIEWS FROM GRAPH SEARCH, SHORTEST PATHS, AND DATA STRUCTURES

View all reviews

About the Algorithms Specialization

Algorithms

Frequently Asked Questions

More questions? Visit the Learner Help Center.