We may earn an affiliate commission when you visit our partners.
Course image
Tim Roughgarden

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.

Read more

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 Roughgarden has been a professor in the Computer Science Department at Stanford University since 2004. He has taught and published extensively on the subject of algorithms and their applications.

Enroll now

Share

Help others find Specialization from Coursera by sharing it with your friends and followers:

What's inside

Four courses

Divide and Conquer, Sorting and Searching, and Randomized Algorithms

(0 hours)
The primary topics covered in this course are: asymptotic notation, sorting and searching, divide and conquer, and randomized algorithms.

Graph Search, Shortest Paths, and Data Structures

(0 hours)
The main topics in this specialization part include: data structures (heaps, search trees, hash tables, bloom filters), graph primitives (BFS/DFS applications, connectivity, shortest paths), and their applications (from deduplication to social network analysis).

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

(0 hours)
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).

Shortest Paths Revisited, NP-Complete Problems and What To Do About Them

(0 hours)
The primary topics in this course are: shortest paths (Bellman-Ford, Floyd-Warshall, Johnson), NP-completeness and its implications for algorithm design, and strategies for dealing with computationally intractable problems (heuristics, local search).

Save this collection

Save Algorithms to your list so you can find it easily later:
Save
Our mission

OpenCourser helps millions of learners each year. People visit us to learn workspace skills, ace their exams, and nurture their curiosity.

Our extensive catalog contains over 50,000 courses and twice as many books. Browse by search, by topic, or even by career interests. We'll match you to the right resources quickly.

Find this site helpful? Tell a friend about us.

Affiliate disclosure

We're supported by our community of learners. When you purchase or subscribe to courses and programs or purchase books, we may earn a commission from our partners.

Your purchases help us maintain our catalog and keep our servers humming without ads.

Thank you for supporting OpenCourser.

© 2016 - 2024 OpenCourser