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
38,266 already enrolled
Offered By
Algorithms SpecializationStanford UniversityAbout this Course
17,672 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.
Course 4 of 4 in the
Intermediate Level
Approx. 14 hours to complete
English
Subtitles: Arabic, French, Portuguese (European), Italian, Vietnamese, German, Russian, English, Spanish
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.
Course 4 of 4 in the
Intermediate Level
Approx. 14 hours to complete
English
Subtitles: Arabic, French, Portuguese (European), Italian, Vietnamese, German, Russian, English, Spanish
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.
Syllabus - What you will learn from this course
4 hours to complete
Week 1
The Bellman-Ford algorithm; all-pairs shortest paths.
4 hours to complete
14 videos (Total 151 min), 4 readings, 2 quizzes
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
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
4 hours to complete
Week 4
Local search algorithms for NP-complete problems; the wider world of algorithms.
4 hours to complete
11 videos (Total 124 min), 3 readings, 3 quizzes
Reviews
- 5 stars85.29%
- 4 stars12.90%
- 3 stars1.16%
- 2 stars0.51%
- 1 star0.12%
TOP REVIEWS FROM SHORTEST PATHS REVISITED, NP-COMPLETE PROBLEMS AND WHAT TO DO ABOUT THEM
by MLNov 12, 2019
very interesting course in Algorithms Specialization.
It is sufficient to arouse interest in studying advance algorithm.
Thank you for your teaching, Professor Tim.
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 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!
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.
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.
