The primary topics in this part of the specialization are: data structures (heaps, balanced search trees, hash tables, bloom filters), graph primitives (applications of breadth-first and depth-first search, connectivity, shortest paths), and their applications (ranging from deduplication to social network analysis).
Offered By
Algorithms SpecializationStanford UniversityAbout this Course
49,497 recent views
Learner Career Outcomes
27%
started a new career after completing these courses
35%
got a tangible career benefit from this course
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Course 2 of 4 in the
Flexible deadlines
Reset deadlines in accordance to your schedule.
Intermediate Level
Approx. 15 hours to complete
English
Subtitles: Arabic, French, Portuguese (European), Italian, Vietnamese, German, Russian, English, Spanish
Skills you will gain
GraphsData StructureAlgorithmsHash Table
Learner Career Outcomes
27%
started a new career after completing these courses
35%
got a tangible career benefit from this course
Shareable Certificate
Earn a Certificate upon completion
100% online
Start instantly and learn at your own schedule.
Course 2 of 4 in the
Flexible deadlines
Reset deadlines in accordance to your schedule.
Intermediate Level
Approx. 15 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
Breadth-first and depth-first search; computing strong components; applications.
4 hours to complete
9 videos (Total 162 min), 4 readings, 2 quizzes
3 hours to complete
Week 2
Dijkstra's shortest-path algorithm.
3 hours to complete
4 videos (Total 79 min), 2 readings, 2 quizzes
4 hours to complete
Week 3
Heaps; balanced binary search trees.
4 hours to complete
9 videos (Total 142 min), 1 reading, 2 quizzes
5 hours to complete
Week 4
Hashing; bloom filters.
5 hours to complete
9 videos (Total 171 min), 3 readings, 3 quizzes
Reviews
TOP REVIEWS FROM GRAPH SEARCH, SHORTEST PATHS, AND DATA STRUCTURES
by CSApr 12, 2018
Good course, but instructor does start to move fast and a few walk-throughs in certain spots would be beneficial . However the lack of it makes you do your own research, which is also beneficial.
by DSMar 29, 2020
Awesome course! Professor Roughgarden is fantastic. The material was appropriately challenging. Perfect amount of rigor. Only one minor squabble: the hash problem set is terribly misleading.
by TGNov 30, 2019
It was an awesome experience to learn from such a teacher. Now I have a much clear view of the graph algorithms. I have enjoyed this course. Thanks to Stanford for offering this course.
by HLMar 1, 2021
There is very little hand-holding in this course and no code provided. This really challenges you to implement the ideas taught in the most efficient and appropriate manner possible.
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.
