CourseraData Structures and AlgorithmsFree courseCertificate

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

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.About the instructor: Tim Ro

4.7

83 reviews

Created by: Tim Roughgarden

Quality Score

Content Quality

Video Quality

Qualified Instructor

Course Pace

Course Depth & Coverage

Overall Score : 94 / 100

Course Description

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).

Time: 22h

Instructor Details

Tim Roughgarden

4.7 Rating
83 Reviews

Tim Roughgarden is a Professor of Computer Science and (by courtesy) Management Science and Engineering at Stanford University. He received a BS in Applied Mathematics from Stanford in 1997, and a PhD in Computer Science from Cornell in 2002. His research interests include the many connections between computer science and economics, as well as the design, analysis, applications, and limitations of algorithms. For his research, he has been awarded the ACM Grace Murray Hopper Award, the Presidential Early Career Award for Scientists and Engineers (PECASE), the Kalai Prize in Computer Science and Game Theory, the Shapley Lecturership of the Game Theory Society, the Social Choice and Welfare Prize, INFORM's Optimization Prize for Young Researchers, the Mathematical Programming Society's Tucker Prize, the EATCS-SIGACT GAdel Prize, and a Guggenheim Fellowship.

More Data Structures and Algorithms courses

Python Data Structures
5.0 (367 Reviews)

- Provider: Coursera
- Time: 11h

Free

JavaScript Data Structures & Algorithms + LEETCODE Exercises (2026)
4.9 (4,131 Reviews)

- Provider: Udemy
- Time: 9.6h

$119.99

Operations Analytics
4.9 (384 Reviews)

- Provider: Coursera
- Time: 12h

Free

Data Structures & Algorithms: Coding Interview Masterclass (2026)
4.8 (15,900 Reviews)

- Provider: Udemy
- Time: 10.8h

$99.99

Master the Coding Interview: Big Tech (FAANG) Interviews (2026)
4.8 (6,000 Reviews)

- Provider: Udemy
- Time: 36.8h

$109.99

Mastering critical SKILLS in Algorithms using C++: Part 1 (2023)
4.8 (598 Reviews)

- Provider: Udemy
- Time: 18.9h

$84.99

All Data Structures and Algorithms courses

Reviews

4.7

83 reviews in total

Select a bar to show only those reviews.Select the bar again to show every rating.

Write a review

By 唐鸣昊 on 11-Nov-19

Very interesting. I learned a lot of new things. 5 stars!Just a few things that could be improved:-- The video and its audio are not really synchronized (maybe because the video is pretty old)-- The subtitles are not good. Even the english ones were not written by someone who knows what the professor is talking about...Nowadays there are better solutions to validate whether someone solved a programming task. geeksforgeeks.org and hackerrank.com for example just execute the program with test input.But all in all: Very positive experience.

By Roshan N on 7-Nov-19

I'm absolutely happy with the time that I spent on this course. Now I finished my third course on the Algorithms Specialization from Tim Roughgarden. I love the instructor the way he speaks is amazing. Zero uhmms absolutely zero schmschm. Amazing! I'm looking forward to start the fourth course of the specialization which is the final one. It's been 2 and a half months since I started the Algorithms Specialization. Thanks for such a great content.

By Dawoud A on 25-Oct-19