Tim Roughgarden

Professor · Computer Science

Profile on Coursera ↗

Catalogue average

4.0

across 4 courses

Range

2.1–4.8

worst course to best course

Reviews read

across those courses

The courses

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
Stanford Online
4.8
Coursera 4.8
Holds up
Shortest Paths Revisited, NP-Complete Problems and What To Do About Them
Stanford Online
4.8
Coursera 4.8
Holds up
Graph Search, Shortest Paths, and Data Structures
Stanford Online
4.2
Coursera 4.8
Padded
Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Stanford Online
2.1
Coursera 4.8
Inflated

Coursera credits Tim Roughgarden with 6 courses; Starisk has scored 4 of them so far.

The average weights each course by the reviews we read, so a course with four readable reviews does not pull as hard as one with twenty. It is still a small sample: 80 reviews in total.

A course taught by several people counts for everyone on it. The score is the same one the course page shows — what the most-upvoted reviews say — not a verdict on the teaching.The method.