About this Course
49,722 recent views

100% online

Start instantly and learn at your own schedule.

Flexible deadlines

Reset deadlines in accordance to your schedule.

Intermediate Level

Approx. 17 hours to complete

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

English

Subtitles: English

Skills you will gain

Graph TheoryGraphsGraph Algorithms
Learners taking this Course are
  • Data Scientists
  • Software Engineers
  • Machine Learning Engineers
  • Technical Leads
  • Biostatisticians

100% online

Start instantly and learn at your own schedule.

Flexible deadlines

Reset deadlines in accordance to your schedule.

Intermediate Level

Approx. 17 hours to complete

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

English

Subtitles: English

Syllabus - What you will learn from this course

Week
1
4 hours to complete

Decomposition of Graphs 1

5 videos (Total 43 min), 3 readings, 1 quiz
5 videos
Representing Graphs9m
Exploring Graphs14m
Connectivity5m
Previsit and Postvisit Orderings7m
3 readings
Welcome10m
Slides and External References10m
Slides and External References10m
Week
2
4 hours to complete

Decomposition of Graphs 2

4 videos (Total 36 min), 1 reading, 1 quiz
4 videos
Topological Sort9m
Strongly Connected Components7m
Computing Strongly Connected Components10m
1 reading
Slides and External References10m
Week
3
4 hours to complete

Paths in Graphs 1

8 videos (Total 55 min), 1 reading, 1 quiz
8 videos
Breadth-First Search7m
Breadth-First Search (continued)6m
Implementation and Analysis9m
Proof of Correctness7m
Proof of Correctness (continued)5m
Shortest-Path Tree6m
Reconstructing the Shortest Path3m
1 reading
Slides and External References10m
Week
4
5 hours to complete

Paths in Graphs 2

12 videos (Total 86 min), 2 readings, 1 quiz
12 videos
Naive Algorithm10m
Dijkstra's Algorithm: Intuition and Example7m
Dijkstra's Algorithm: Implementation3m
Dijkstra's Algorithm: Proof of Correctness4m
Dijkstra's Algorithm: Running Time7m
Currency Exchange6m
Currency Exchange: Reduction to Shortest Paths8m
Bellman-Ford Algorithm6m
Bellman-Ford Algorithm: Proof of Correctness6m
Negative Cycles7m
Infinite Arbitrage10m
2 readings
Slides and External References10m
Slides and External References10m
4.7
192 ReviewsChevron Right

38%

started a new career after completing these courses

29%

got a tangible career benefit from this course

17%

got a pay increase or promotion

Top reviews from Algorithms on Graphs

By CSJul 1st 2019

Excellent Course for anyone looking to expertise Graph Algorithm. Professor's explained each problem and algorithm in a very easy to learn approach. Grades are tough and yet func to get challenged.

By CCOct 7th 2018

Good balance between theory and practice. The assignments are well thought to measure the understanding of videos, which I had to watch many times to grasp the hidden tips from the instructor.

Instructors

Avatar

Alexander S. Kulikov

Visiting Professor
Department of Computer Science and Engineering
Avatar

Michael Levin

Lecturer
Computer Science
Avatar

Daniel M Kane

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

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.