Computer Science 271

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 2011 Alistair Sinclair 6.4 / 7 5.9 / 7
Fall 2008 Alistair Sinclair 6.4 / 7 6.4 / 7
Fall 2005 Alistair Sinclair 6.4 / 7 6.3 / 7
Fall 2001 Alistair Sinclair 5.9 / 7 5.7 / 7
Spring 1998 Alistair Sinclair 6.4 / 7 6.1 / 7
Spring 1996 Alistair Sinclair 6.2 / 7 6.0 / 7
Spring 1994 Richard M. Karp 6.5 / 7 5.9 / 7
Spring 1991 Umesh Vazirani 5.3 / 7 5.3 / 7
Fall 1988 Umesh Vazirani 5.7 / 7 5.2 / 7
Overall Rating Teaching Effectiveness How worthwhile was this course?
6.1 / 7 5.9 / 7
[Email HKN about this data] [Info about this page]