About this Course

46,405 recent views

Learner Career Outcomes

25%

started a new career after completing these courses

44%

got a tangible career benefit from this course

25%

got a pay increase or promotion
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Flexible deadlines
Reset deadlines in accordance to your schedule.
Advanced Level
Approx. 27 hours to complete
English

Skills you will gain

Python ProgrammingLinear Programming (LP)Np-CompletenessDynamic Programming

Learner Career Outcomes

25%

started a new career after completing these courses

44%

got a tangible career benefit from this course

25%

got a pay increase or promotion
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Flexible deadlines
Reset deadlines in accordance to your schedule.
Advanced Level
Approx. 27 hours to complete
English

Offered by

Placeholder

University of California San Diego

Placeholder

National Research University Higher School of Economics

Syllabus - What you will learn from this course

Content RatingThumbs Up86%(2,870 ratings)Info
Week
1

Week 1

5 hours to complete

Flows in Networks

5 hours to complete
9 videos (Total 72 min), 4 readings, 2 quizzes
9 videos
Network Flows9m
Residual Networks10m
Maxflow-Mincut7m
The Ford–Fulkerson Algorithm7m
Slow Example3m
The Edmonds–Karp Algorithm11m
Bipartite Matching11m
Image Segmentation7m
4 readings
Slides and Resources on Flows in Networks10m
Rules on the academic integrity in the course10m
Available Programming Languages10m
FAQ on Programming Assignments10m
1 practice exercise
Flow Algorithms30m
Week
2

Week 2

5 hours to complete

Linear Programming

5 hours to complete
10 videos (Total 84 min), 1 reading, 2 quizzes
10 videos
Linear Programming8m
Linear Algebra: Method of Substitution5m
Linear Algebra: Gaussian Elimination10m
Convexity9m
Duality12m
(Optional) Duality Proofs7m
Linear Programming Formulations8m
The Simplex Algorithm10m
(Optional) The Ellipsoid Algorithm6m
1 reading
Slides and Resources on Linear Programming10m
1 practice exercise
Linear Programming Quiz30m
Week
3

Week 3

6 hours to complete

NP-complete Problems

6 hours to complete
16 videos (Total 115 min), 2 readings, 2 quizzes
16 videos
Search Problems9m
Traveling Salesman Problem7m
Hamiltonian Cycle Problem8m
Longest Path Problem1m
Integer Linear Programming Problem3m
Independent Set Problem3m
P and NP4m
Reductions5m
Showing NP-completeness6m
Independent Set to Vertex Cover5m
3-SAT to Independent Set14m
SAT to 3-SAT7m
Circuit SAT to SAT12m
All of NP to Circuit SAT5m
Using SAT-solvers14m
2 readings
Slides and Resources on NP-complete Problems10m
Minisat Installation Guide10m
1 practice exercise
NP-complete Problems30m
Week
4

Week 4

6 hours to complete

Coping with NP-completeness

6 hours to complete
11 videos (Total 119 min), 1 reading, 2 quizzes
11 videos
2-SAT10m
2-SAT: Algorithm12m
Independent Sets in Trees14m
3-SAT: Backtracking11m
3-SAT: Local Search12m
TSP: Dynamic Programming15m
TSP: Branch and Bound9m
Vertex Cover9m
Metric TSP12m
TSP: Local Search6m
1 reading
Slides and Resources on Coping with NP-completeness10m
1 practice exercise
Coping with NP-completeness30m

Reviews

TOP REVIEWS FROM ADVANCED ALGORITHMS AND COMPLEXITY

View all reviews

About the Data Structures and Algorithms Specialization

Data Structures and Algorithms

Frequently Asked Questions

More questions? Visit the Learner Help Center.