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).
This course is part of the Algorithms Specialization
73,779 already enrolled
Offered By
Algorithms SpecializationStanford UniversityAbout this Course
35,171 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 2 of 4 in the
Intermediate Level
Approx. 15 hours to complete
English
Subtitles: Arabic, French, Portuguese (European), Italian, Vietnamese, German, Russian, English, Spanish
Skills you will gain
- Graphs
- Data Structure
- Algorithms
- Hash Table
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 2 of 4 in the
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
- 5 stars86.17%
- 4 stars11.52%
- 3 stars1.72%
- 2 stars0.20%
- 1 star0.36%
TOP REVIEWS FROM GRAPH SEARCH, SHORTEST PATHS, AND DATA STRUCTURES
by SLNov 2, 2019
Hope the professor could teach more about hashing and give a detailed implementation of some data structures or supply some interface template code.
by ACAug 1, 2020
Tim really did an awesome job preparing the lectures for this course. Material was presented quickly, efficiently, and engagingly. I highly recommend this class.
by KSAug 31, 2018
Learning algorithms is a must for all computer scientists. This course propels you on the path and kindles the spirit of inquiry and knack for finding better solutions.
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.
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.
