Computer science
Specialization · Computer science
Algorithms Specialization
Specialization by Stanford University (Stanford Online) on Coursera: 4 courses, 57 hours in total. It appears in 3 Mooc Atlas paths.
Stanford University (Stanford Online)IntermediateC, Java, Python
Stated prerequisites: Programming in at least one language (C, Java or Python); familiarity with proofs (induction, contradiction); discrete probability
Show the 4 courses
| Course | Level | Length | Rating (reviews) |
|---|---|---|---|
| Divide and Conquer, Sorting and Searching, and Randomized Algorithms | Intermediate | 15 h | 4.8 (5,342) |
| Graph Search, Shortest Paths, and Data Structures | Intermediate | 14 h | 4.8 (2,002) |
| Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming | Intermediate | 15 h | 4.8 (1,279) |
| Shortest Paths Revisited, NP-Complete Problems and What To Do About Them | Intermediate | 13 h | 4.8 (832) |