The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees).
This course is part of the Algorithms Specialization
65,506 already enrolled
Offered By
Algorithms SpecializationStanford UniversityAbout this Course
28,362 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 3 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
- Spanning Tree
- Algorithms
- Dynamic Programming
- Greedy Algorithm
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 3 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
Two motivating applications; selected review; introduction to greedy algorithms; a scheduling application; Prim's MST algorithm.
4 hours to complete
16 videos (Total 160 min), 4 readings, 2 quizzes
4 hours to complete
Week 2
Kruskal's MST algorithm and applications to clustering; advanced union-find (optional).
4 hours to complete
16 videos (Total 188 min), 2 readings, 2 quizzes
3 hours to complete
Week 3
Huffman codes; introduction to dynamic programming.
3 hours to complete
11 videos (Total 105 min), 1 reading, 2 quizzes
4 hours to complete
Week 4
Advanced dynamic programming: the knapsack problem, sequence alignment, and optimal binary search trees.
4 hours to complete
10 videos (Total 107 min), 3 readings, 3 quizzes
Reviews
- 5 stars86.51%
- 4 stars11.49%
- 3 stars1.66%
- 2 stars0.08%
- 1 star0.24%
TOP REVIEWS FROM GREEDY ALGORITHMS, MINIMUM SPANNING TREES, AND DYNAMIC PROGRAMMING
by AZMar 10, 2020
A bit more difficult course comparing to the first two parts. Be prepared to spend more times on problem solving and programming assignments.
by YWFeb 3, 2021
This course has wonderful lectures coupled with challenging but rewarding homework problems. It was a wonderful learning experience.
by JFJan 13, 2018
I love Tim's excitement for algorithms. He really stands out as a quality teacher in his selection of content, explanations and enthusiasm.
by SKOct 15, 2017
Fantastic course that covered a good variety of content in sufficient details and delves into the fundamentals without sacrificing clarity.
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.
