About this Course

149,504 recent views

Learner Career Outcomes

12%

started a new career after completing these courses

19%

got a tangible career benefit from this course

17%

got a pay increase or promotion
100% online
Start instantly and learn at your own schedule.
Flexible deadlines
Reset deadlines in accordance to your schedule.
Intermediate Level
Approx. 63 hours to complete
English

Skills you will gain

GraphsData StructureAlgorithmsData Compression

Learner Career Outcomes

12%

started a new career after completing these courses

19%

got a tangible career benefit from this course

17%

got a pay increase or promotion
100% online
Start instantly and learn at your own schedule.
Flexible deadlines
Reset deadlines in accordance to your schedule.
Intermediate Level
Approx. 63 hours to complete
English

Offered by

Placeholder

Princeton University

Syllabus - What you will learn from this course

Content RatingThumbs Up96%(4,707 ratings)Info
Week
1

Week 1

10 minutes to complete

Introduction

10 minutes to complete
1 video (Total 9 min), 2 readings
1 video
2 readings
Welcome to Algorithms, Part II1m
Lecture Slides
2 hours to complete

Undirected Graphs

2 hours to complete
6 videos (Total 98 min), 2 readings, 1 quiz
6 videos
Graph API14m
Depth-First Search26m
Breadth-First Search13m
Connected Components18m
Graph Challenges14m
2 readings
Overview1m
Lecture Slides
1 practice exercise
Interview Questions: Undirected Graphs (ungraded)30m
10 hours to complete

Directed Graphs

10 hours to complete
5 videos (Total 68 min), 1 reading, 2 quizzes
5 videos
Digraph API4m
Digraph Search20m
Topological Sort 12m
Strong Components20m
1 reading
Lecture Slides
1 practice exercise
Interview Questions: Directed Graphs (ungraded)30m
Week
2

Week 2

2 hours to complete

Minimum Spanning Trees

2 hours to complete
6 videos (Total 85 min), 2 readings, 1 quiz
6 videos
Greedy Algorithm12m
Edge-Weighted Graph API11m
Kruskal's Algorithm12m
Prim's Algorithm33m
MST Context10m
2 readings
Overview1m
Lecture Slides
1 practice exercise
Interview Questions: Minimum Spanning Trees (ungraded)30m
10 hours to complete

Shortest Paths

10 hours to complete
5 videos (Total 85 min), 1 reading, 2 quizzes
5 videos
Shortest Path Properties14m
Dijkstra's Algorithm18m
Edge-Weighted DAGs19m
Negative Weights21m
1 reading
Lecture Slides
1 practice exercise
Interview Questions: Shortest Paths (ungraded)30m
Week
3

Week 3

8 hours to complete

Maximum Flow and Minimum Cut

8 hours to complete
6 videos (Total 72 min), 2 readings, 2 quizzes
6 videos
Ford–Fulkerson Algorithm6m
Maxflow–Mincut Theorem9m
Running Time Analysis8m
Java Implementation14m
Maxflow Applications22m
2 readings
Overview
Lecture Slides
1 practice exercise
Interview Questions: Maximum Flow (ungraded)30m
2 hours to complete

Radix Sorts

2 hours to complete
6 videos (Total 85 min), 1 reading, 1 quiz
6 videos
Key-Indexed Counting12m
LSD Radix Sort15m
MSD Radix Sort13m
3-way Radix Quicksort7m
Suffix Arrays19m
1 reading
Lecture Slides
1 practice exercise
Interview Questions: Radix Sorts (ungraded)30m
Week
4

Week 4

2 hours to complete

Tries

2 hours to complete
3 videos (Total 75 min), 2 readings, 1 quiz
3 videos
Ternary Search Tries22m
Character-Based Operations20m
2 readings
Overview10m
Lecture Slides
1 practice exercise
Interview Questions: Tries (ungraded)30m
10 hours to complete

Substring Search

10 hours to complete
5 videos (Total 75 min), 1 reading, 2 quizzes
5 videos
Brute-Force Substring Search10m
Knuth–Morris–Pratt33m
Boyer–Moore8m
Rabin–Karp16m
1 reading
Lecture Slides10m
1 practice exercise
Interview Questions: Substring Search (ungraded)30m

Reviews

TOP REVIEWS FROM ALGORITHMS, PART II

View all reviews

Frequently Asked Questions

More questions? Visit the Learner Help Center.