Algorithms

Offered By: Stanford University via Coursera

Course Description

Overview

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.

Syllabus

Course 1: Divide and Conquer, Sorting and Searching, and Randomized Algorithms
- Offered by Stanford University. The primary topics in this part of the specialization are: asymptotic ("Big-oh") notation, sorting and ... Enroll for free.

Course 2: Graph Search, Shortest Paths, and Data Structures
- Offered by Stanford University. The primary topics in this part of the specialization are: data structures (heaps, balanced search trees, ... Enroll for free.

Course 3: Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
- Offered by Stanford University. The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning ... Enroll for free.

Course 4: Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
- Offered by Stanford University. The primary topics in this part of the specialization are: shortest paths (Bellman-Ford, Floyd-Warshall, ... Enroll for free.

Courses

68 reviews
15 hours 25 minutes
View details

The primary topics in this part of the specialization are: asymptotic ("Big-oh") notation, sorting and searching, divide and conquer (master method, integer and matrix multiplication, closest pair), and randomized algorithms (QuickSort, contraction algorithm for min cuts).
0 reviews
14 hours 41 minutes
View details

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).
0 reviews
13 hours 27 minutes
View details

The primary topics in this part of the specialization are: shortest paths (Bellman-Ford, Floyd-Warshall, Johnson), NP-completeness and what it means for the algorithm designer, and strategies for coping with computationally intractable problems (analysis of heuristics, local search).
1 review
13 hours 32 minutes
View details

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

Taught by

Tim Roughgarden