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
40,299 already enrolled
Offered By
About this Course
15,692 recent views
Flexible deadlines
Reset deadlines in accordance to your schedule.
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Coursera Labs
Includes hands on learning projects.
Learn more about Coursera Labs Course 4 of 4 in the
Intermediate Level
Approx. 13 hours to complete
English
Skills you will gain
- Data Structure
- Algorithms
- Np-Completeness
- Dynamic Programming
Flexible deadlines
Reset deadlines in accordance to your schedule.
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Coursera Labs
Includes hands on learning projects.
Learn more about Coursera Labs Course 4 of 4 in the
Intermediate Level
Approx. 13 hours to complete
English
Offered by
Syllabus - What you will learn from this course
4 hours to complete
Week 1
4 hours to complete
14 videos (Total 151 min), 4 readings, 2 quizzes
3 hours to complete
Week 2
3 hours to complete
11 videos (Total 122 min), 2 readings, 2 quizzes
2 hours to complete
Week 3
2 hours to complete
6 videos (Total 68 min), 1 reading, 2 quizzes
4 hours to complete
Week 4
4 hours to complete
11 videos (Total 124 min), 3 readings, 3 quizzes
Reviews
- 5 stars85.38%
- 4 stars12.83%
- 3 stars1.14%
- 2 stars0.50%
- 1 star0.12%
TOP REVIEWS FROM SHORTEST PATHS REVISITED, NP-COMPLETE PROBLEMS AND WHAT TO DO ABOUT THEM
by BGJul 6, 2018
Excellent course! Bravo to the teacher for the commitment provided in this course. Kind regards.
by SWAug 9, 2020
Excellent course! The lectures provide clear and rigorous explanations, and the coding exercises are appropriately challenging.
by HPMay 5, 2020
learn a lot about algorithmic complexity class and lot's of such a beautiful algorithm. Thank you sir for sharing your knowledge with us.
by PSSep 8, 2021
Great Pace - good examples - always going to the point - clear and providing good information.
About the Algorithms Specialization

Frequently Asked Questions
When will I have access to the lectures and assignments?
What will I get if I subscribe to this Specialization?
Is financial aid available?
More questions? Visit the Learner Help Center.