Computer Science 271

[Email HKN about this data] [Info about this page]

Title	Randomness and Computation
Units	3
Prerequisites	170 and at least one course numbered 270-279.
Description	Computational applications of randomness and computational theories of randomness. Approximate counting and uniform generation of combinatorial objects, rapid convergence of random walks on expander graphs, explicit construction of expander graphs, randomized reductions, Kolmogorov complexity, pseudo-random number generation, semi-random sources.

Sections Instructor Teaching Effectiveness How worthwhile was this course?

Fall 2005 Sinclair 6.4 / 7 ± 0.2
6.3 / 7 ± 0.3

Fall 2001 Sinclair 5.9 / 7 ± 0.5
5.7 / 7 ± 0.5

Spring 1998 Sinclair 6.4 / 7 ± 0.6
6.1 / 7 ± 0.7

Spring 1996 Sinclair 6.2 / 7 ± 0.4
6.0 / 7 ± 0.4

Spring 1994 Karp 6.5 / 7 ± 0.3
5.9 / 7 ± 0.3

Spring 1991 Vazirani 5.3 / 7 ± 0.8
5.3 / 7 ± 0.5

Fall 1988 Vazirani 5.7 / 7 ± 0.7
5.2 / 7 ± 1.1

Overall Rating Teaching Effectiveness How worthwhile was this course?

Computer Science 271 6.2 / 7 ± 0.1
5.9 / 7 ± 0.1

Hint: You can click on the colored rating bars to see detailed statistics on a particular rating.