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
62,551 recent views
Learner Career Outcomes
41%
started a new career after completing these courses
48%
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: French, Portuguese (Brazilian), Russian, English, Spanish
Skills you will gain
GraphsData StructureAlgorithmsHash Table
Learner Career Outcomes
41%
started a new career after completing these courses
48%
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: French, Portuguese (Brazilian), 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
9 videos
Breadth-First Search (BFS): The Basics14m
BFS and Shortest Paths7m
BFS and Undirected Connectivity13m
Depth-First Search (DFS): The Basics7m
Topological Sort21m
Computing Strong Components: The Algorithm29m
Computing Strong Components: The Analysis26m
Structure of the Web [Optional]18m
4 readings
Week 1 Overview10m
Overview, Resources, and Policies10m
Lecture slides10m
Optional Theory Problems (Week 1)10m
2 practice exercises
Problem Set #130m
Programming Assignment #130m
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 videos
Dijkstra's Algorithm: Examples12m
Correctness of Dijkstra's Algorithm19m
Dijkstra's Algorithm: Implementation and Running Time26m
2 readings
Week 2 Overview10m
Optional Theory Problems (Week 2)10m
2 practice exercises
Problem Set #230m
Programming Assignment #230m
4 hours to complete
Week 3
Heaps; balanced binary search trees.
4 hours to complete
9 videos (Total 142 min), 1 reading, 2 quizzes
9 videos
Heaps: Operations and Applications18m
Heaps: Implementation Details [Advanced - Optional]20m
Balanced Search Trees: Operations and Applications10m
Binary Search Tree Basics, Part I13m
Binary Search Tree Basics, Part II30m
Red-Black Trees21m
Rotations [Advanced - Optional]7m
Insertion in a Red-Black Tree [Advanced]14m
1 reading
Week 3 Overview10m
2 practice exercises
Problem Set #330m
Programming Assignment #330m
5 hours to complete
Week 4
Hashing; bloom filters.
5 hours to complete
9 videos (Total 171 min), 3 readings, 3 quizzes
9 videos
Hash Tables: Implementation Details, Part I18m
Hash Tables: Implementation Details, Part II22m
Pathological Data Sets and Universal Hashing Motivation21m
Universal Hashing: Definition and Example [Advanced - Optional]25m
Universal Hashing: Analysis of Chaining [Advanced - Optional]18m
Hash Table Performance with Open Addressing [Advanced - Optional]15m
Bloom Filters: The Basics15m
Bloom Filters: Heuristic Analysis13m
3 readings
Week 4 Overview10m
Optional Theory Problems (Week 4)10m
Info and FAQ for final exam10m
3 practice exercises
Problem Set #430m
Programming Assignment #430m
Final Exam30m
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 GMMay 21, 2018
assignments didn't seem as interesting or complex as class 1, besides week 1 of class 2. Lecture material was high quality however, and the advanced optional material is appreciated
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?
Access to lectures and assignments depends on your type of enrollment. If you take a course in audit mode, you will be able to see most course materials for free. To access graded assignments and to earn a Certificate, you will need to purchase the Certificate experience, during or after your audit. If you don't see the audit option:
- The course may not offer an audit option. You can try a Free Trial instead, or apply for Financial Aid.
- The course may offer 'Full Course, No Certificate' instead. This option lets you see all course materials, submit required assessments, and get a final grade. This also means that you will not be able to purchase a Certificate experience.
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.
Is financial aid available?
Yes, Coursera provides financial aid to learners who cannot afford the fee. Apply for it by clicking on the Financial Aid link beneath the "Enroll" button on the left. You'll be prompted to complete an application and will be notified if you are approved. You'll need to complete this step for each course in the Specialization, including the Capstone Project. Learn more.
Will I earn university credit for completing the Course?
This Course doesn't carry university credit, but some universities may choose to accept Course Certificates for credit. Check with your institution to learn more. Online Degrees and Mastertrack™ Certificates on Coursera provide the opportunity to earn university credit.
More questions? Visit the Learner Help Center.
