About this Course
26,236 recent views

100% online

Start instantly and learn at your own schedule.

Flexible deadlines

Reset deadlines in accordance to your schedule.

Advanced Level

Approx. 23 hours to complete

Suggested: 4 weeks of study, 4-8 hours/week...


Subtitles: English

Skills you will gain

Python ProgrammingLinear Programming (LP)Np-CompletenessDynamic Programming

100% online

Start instantly and learn at your own schedule.

Flexible deadlines

Reset deadlines in accordance to your schedule.

Advanced Level

Approx. 23 hours to complete

Suggested: 4 weeks of study, 4-8 hours/week...


Subtitles: English

Learners taking this Course are

  • Data Scientists
  • Machine Learning Engineers
  • Software Engineers
  • Traders
  • Data Engineers

Syllabus - What you will learn from this course

5 hours to complete

Flows in Networks

9 videos (Total 72 min), 3 readings, 2 quizzes
9 videos
Network Flows9m
Residual Networks10m
The Ford–Fulkerson Algorithm7m
Slow Example3m
The Edmonds–Karp Algorithm11m
Bipartite Matching11m
Image Segmentation7m
3 readings
Slides and Resources on Flows in Networks10m
Available Programming Languages10m
FAQ on Programming Assignments10m
1 practice exercise
Flow Algorithms10m
5 hours to complete

Linear Programming

10 videos (Total 84 min), 1 reading, 2 quizzes
10 videos
Linear Programming8m
Linear Algebra: Method of Substitution5m
Linear Algebra: Gaussian Elimination10m
(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 Quiz10m
6 hours to complete

NP-complete Problems

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
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 Problems12m
5 hours to complete

Coping with NP-completeness

11 videos (Total 119 min), 1 reading, 2 quizzes
11 videos
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-completeness6m
75 ReviewsChevron Right


started a new career after completing these courses


got a tangible career benefit from this course


got a pay increase or promotion

Top reviews from Advanced Algorithms and Complexity

By EMJan 4th 2018

As usual, complex arguments explained in simple terms!\n\nSome problems are really tough! (e.g. there's a problem from Google Code Jam).\n\nThank you for this course!

By CSAug 26th 2019

Very Very Challenging Course , it test your patience and rewards is extremely satisfying. Lot of learning on a complicated subject of NP-Hard problems.



Alexander S. Kulikov

Visiting Professor
Department of Computer Science and Engineering

Michael Levin

Computer Science

Daniel M Kane

Assistant Professor
Department of Computer Science and Engineering / Department of Mathematics

Neil Rhodes

Adjunct Faculty
Computer Science and Engineering

About University of California San Diego

UC San Diego is an academic powerhouse and economic engine, recognized as one of the top 10 public universities by U.S. News and World Report. Innovation is central to who we are and what we do. Here, students learn that knowledge isn't just acquired in the classroom—life is their laboratory....

About National Research University Higher School of Economics

National Research University - Higher School of Economics (HSE) is one of the top research universities in Russia. Established in 1992 to promote new research and teaching in economics and related disciplines, it now offers programs at all levels of university education across an extraordinary range of fields of study including business, sociology, cultural studies, philosophy, political science, international relations, law, Asian studies, media and communicamathematics, engineering, and more. Learn more on www.hse.ru...

About the Data Structures and Algorithms Specialization

This specialization is a mix of theory and practice: you will learn algorithmic techniques for solving various computational problems and will implement about 100 algorithmic coding problems in a programming language of your choice. No other online course in Algorithms even comes close to offering you a wealth of programming challenges that you may face at your next job interview. To prepare you, we invested over 3000 hours into designing our challenges as an alternative to multiple choice questions that you usually find in MOOCs. Sorry, we do not believe in multiple choice questions when it comes to learning algorithms...or anything else in computer science! For each algorithm you develop and implement, we designed multiple tests to check its correctness and running time — you will have to debug your programs without even knowing what these tests are! It may sound difficult, but we believe it is the only way to truly understand how the algorithms work and to master the art of programming. The specialization contains two real-world projects: Big Networks and Genome Assembly. You will analyze both road networks and social networks and will learn how to compute the shortest route between New York and San Francisco (1000 times faster than the standard shortest path algorithms!) Afterwards, you will learn how to assemble genomes from millions of short fragments of DNA and how assembly algorithms fuel recent developments in personalized medicine....
Data Structures and Algorithms

Frequently Asked Questions

  • Once you enroll for a Certificate, you’ll have access to all videos, quizzes, and programming assignments (if applicable). Peer review assignments can only be submitted and reviewed once your session has begun. If you choose to explore the course without purchasing, you may not be able to access certain assignments.

  • When you enroll in the course, you get access to all of the courses in the Specialization, and you earn a certificate when you complete the work. Your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile. If you only want to read and view the course content, you can audit the course for free.

More questions? Visit the Learner Help Center.