The primary topics in this part of the specialization are: shortest paths (Bellman-Ford, Floyd-Warshall, Johnson), NP-completeness and what it means for the algorithm designer, and strategies for coping with computationally intractable problems (analysis of heuristics, local search).
This course is part of the Algorithms Specialization
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Offered By
About this Course
28,915 recent views
Learner Career Outcomes
62%
started a new career after completing these courses
50%
got a tangible career benefit from this course
12%
got a pay increase or promotion
Skills you will gain
Data StructureAlgorithmsNp-CompletenessDynamic Programming
Learner Career Outcomes
62%
started a new career after completing these courses
50%
got a tangible career benefit from this course
12%
got a pay increase or promotion
100% online
Start instantly and learn at your own schedule.
Course 4 of 4 in the
Flexible deadlines
Reset deadlines in accordance to your schedule.
Intermediate Level
Approx. 19 hours to complete
Suggested: 4 weeks of study, 4-8 hours/week
English
Subtitles: English
Syllabus - What you will learn from this course
3 hours to complete
Week 1
The Bellman-Ford algorithm; all-pairs shortest paths.
3 hours to complete
14 videos (Total 151 min), 4 readings, 2 quizzes
14 videos
Optimal Substructure10m
The Basic Algorithm I8m
The Basic Algorithm II10m
Detecting Negative Cycles9m
A Space Optimization12m
Internet Routing I [Optional]11m
Internet Routing II [Optional]6m
Problem Definition7m
Optimal Substructure12m
The Floyd-Warshall Algorithm13m
A Reweighting Technique14m
Johnson's Algorithm I11m
Johnson's Algorithm II11m
4 readings
Week 1 Overview10m
Overview, Resources, and Policies10m
Lecture Slides10m
Optional Theory Problems (Week 1)10m
2 practice exercises
Problem Set #110m
Programming Assignment #12m
3 hours to complete
Week 2
NP-complete problems and exact algorithms for them.
3 hours to complete
11 videos (Total 122 min), 2 readings, 2 quizzes
11 videos
Reductions and Completeness13m
Definition and Interpretation of NP-Completeness I10m
Definition and Interpretation of NP-Completeness II7m
The P vs. NP Question9m
Algorithmic Approaches to NP-Complete Problems12m
The Vertex Cover Problem8m
Smarter Search for Vertex Cover I9m
Smarter Search for Vertex Cover II7m
The Traveling Salesman Problem14m
A Dynamic Programming Algorithm for TSP12m
2 readings
Week 2 Overview10m
Optional Theory Problems (Week 2)10m
2 practice exercises
Problem Set #210m
Programming Assignment #22m
2 hours to complete
Week 3
Approximation algorithms for NP-complete problems.
2 hours to complete
6 videos (Total 68 min), 1 reading, 2 quizzes
6 videos
Analysis of a Greedy Knapsack Heuristic I7m
Analysis of a Greedy Knapsack Heuristic II9m
A Dynamic Programming Heuristic for Knapsack11m
Knapsack via Dynamic Programming, Revisited10m
Ananysis of Dynamic Programming Heuristic15m
1 reading
Week 3 Overview10m
2 practice exercises
Problem Set #310m
Programming Assignment #32m
3 hours to complete
Week 4
Local search algorithms for NP-complete problems; the wider world of algorithms.
3 hours to complete
11 videos (Total 124 min), 3 readings, 3 quizzes
11 videos
The Maximum Cut Problem II9m
Principles of Local Search I8m
Principles of Local Search II10m
The 2-SAT Problem14m
Random Walks on a Line16m
Analysis of Papadimitriou's Algorithm14m
Stable Matching [Optional]15m
Matchings, Flows, and Braess's Paradox [Optional]13m
Linear Programming and Beyond [Optional]11m
Epilogue1m
3 readings
Week 4 Overview10m
Optional Theory Problems (Week 4)10m
Info and FAQ for final exam10m
3 practice exercises
Problem Set #410m
Programming Assignment #42m
Final Exam20m
Reviews
4.8
TOP REVIEWS FROM SHORTEST PATHS REVISITED, NP-COMPLETE PROBLEMS AND WHAT TO DO ABOUT THEM
by AAFeb 27, 2017
This challenging course improves understanding of algorithms and is intellectually stimulating. I learnt the theory behind algorithms and how they are applied to solve real world problems.
by ASAug 22, 2018
This is the most challenging course in this specialization. Assignments as well as test questions require good amount of thinking.\n\nOne of the best courses I did on Coursera.
by MLNov 12, 2019
very interesting course in Algorithms Specialization.\n\nIt is sufficient to arouse interest in studying advance algorithm.\n\nThank you for your teaching, Professor Tim.
by JEDec 27, 2019
I am very confident in the skills I learned. I have read some books on algorithms but this course makes the application so clear regardless of your programing language.
by KADec 13, 2019
Great course, great explanation from instructor. I loved how Tim Roughgarden explains algorithms. Course Load was just right for me. Great experience!
by JFJan 13, 2018
I love Tim's excitement for algorithms. He really stands out as a quality teacher in his selection of content, explanations and enthusiasm.
by LCMay 1, 2018
Fantastic course by a fantastic Teacher, Prof. Roughgarden manages to turn the dry subject of Algorithms into a hot sexy one!!
by SAMar 15, 2020
A really well-crafted specialization. Has something for everyone from a beginner to an advanced Computer Science student.
by YWMar 3, 2018
unlike previous 3 courses\n\nsome of course 4's quiz problems are really difficult and not sure how to approach...
by ASFeb 25, 2019
Nice course, a lot of information in short time. I think is need more time than 4 weeks to finish this course.
by XNov 30, 2019
Great course in general, got the chance to dive a little deeper into the world of computer science.
by PRJun 24, 2018
Great one for people with advanced understanding! Others will find it slightly hard to follow!
by YZAug 12, 2018
Really happy to finish this specialization and I will still study algorithms in the future.
by PVNov 22, 2017
Thank you do much, this has been an amazing journey! Best Algorithms course online 11/10!
by ABApr 29, 2017
Thoroughly enjoyed this course! Problems and assignments are quite challenging but doable
by SMMar 22, 2019
good course give deep insight of algorithms esp knapsack, nearest neighbor algorithm
by BLJan 6, 2019
this course is harder than other 3 courses, but it is very worth to take it.
by SJJul 23, 2017
This is the most challenging course of all the courses in the specialization
by ARAug 3, 2019
NP complete problems, How to tackle such exponential time problems.
by JSJun 5, 2017
Good introductory coverage and challenging assignments.
Offered by
Stanford University
The Leland Stanford Junior University, commonly referred to as Stanford University or Stanford, is an American private research university located in Stanford, California on an 8,180-acre (3,310 ha) campus near Palo Alto, California, United States.
About the Algorithms Specialization
Algorithms are the heart of computer science, and the subject has countless practical applications as well as intellectual depth. This specialization is an introduction to algorithms for learners with at least a little programming experience. The specialization is rigorous but emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details. After completing this specialization, you will be well-positioned to ace your technical interviews and speak fluently about algorithms with other programmers and computer scientists.
About the instructor: Tim Roughgarden has been a professor in the Computer Science Department at Stanford University since 2004. He has taught and published extensively on the subject of algorithms and their applications.
Frequently Asked Questions
When will I have access to the lectures and assignments?
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.
What will I get if I subscribe to this Specialization?
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.
What is the refund policy?
Is financial aid available?
More questions? Visit the Learner Help Center.
