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

( 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

Operations Analytics
4.9 (384 Reviews)

- Provider: Coursera
- Time: 12h

Free

Data Structures and Performance
4.8 (323 Reviews)

- Provider: Coursera
- Time: 28h

Free

Algorithms for DNA Sequencing
4.8 (94 Reviews)

- Provider: Coursera
- Time: 22h

Free

Excel/VBA for Creative Problem Solving, Part 2

Excel/VBA for Creative Problem Solving, Part 2
4.8 (86 Reviews)

- Provider: Coursera
- Time: 25h

Free

Master the Coding Interview: Data Structures + Algorithms

Master the Coding Interview: Data Structures + Algorithms (2021)
4.7 (312 Reviews)

- Provider: Udemy
- Time: 19h

$11.99

All data structures and algorithms courses

Reviews

4.7

83 total reviews

5 star 4 star 3 star 2 star 1 star

Write a Review

By Erin W on 27-May-19

worst teaching skill

By Ciqiao W on 6-Oct-19

Honestly Speaking, I didn't like the course much. The explanation was quite complicated. I had to learn most of the things from youtube.

By Lawrence K on 10-Jul-17

Sometimes the professor speaks too fast.

By Joshua C B A on 30-Aug-18

Sometimes badly synchronized, there are also mistakes in the videos which haven't been corrected.

By P S P on 23-Mar-19

The forums are not very active, and there are a lot of unanswered questions from months and years ago. It seems like there have not been active staff/mentors in the forums for a while. Also the final exam had two duplicate problems from the problem sets.

By Claver M on 22-May-19

A little too difficult.

By Niti J on 13-Oct-18

Amazing course! Great content indeed!

By Chung J D D E on 17-Jul-18

Not bad programming tests. At least it made me try

By Naval k s on 17-Jun-17

This really helped me to understand how to approach problems with a greedy algorithm mindset or a dynamic programming mindset. My only complaint is that week 4 could have used a concrete example for the optimal binary search tree.

By Israel B on 14-May-17