CS 170

Computer Science 170

[Email HKN about this data] [Info about this page]
TitleEfficient Algorithms and Intractable Problemstrend
Instructors in ChargeManuel Blum, Alistair Sinclair, Umesh Vazirani
Units4
Prerequisites61B, Mathematics 55.
DescriptionConcept and basic techniques in the design and analysis of algorithms; models of computation; lower bounds; algorithms for optimum search trees, balanced trees and UNION-FIND algorithms; numerical and algebraic algorithms; combinatorial algorithms. Turing machines, how to count steps, deterministic and nondeterministic Turing machines, NP-completeness. Unsolvable and intractable problems.
Newsgroupucb.class.cs170

Sections Instructor Teaching EffectivenessHow worthwhile was this course?
Spring 2009Wagner6.7/ 7 ± 0.1
6.6/ 7 ± 0.2
Fall 2008Rao4.6/ 7 ± 0.3
5.3/ 7 ± 0.4
Spring 2008Rao4.0/ 7 ± 0.5
5.5/ 7 ± 0.4
Fall 2007Papadimitriou6.3/ 7 ± 0.2
6.3/ 7 ± 0.2
Spring 2007Demmel4.8/ 7 ± 0.4
5.7/ 7 ± 0.4
Fall 2006Papadimitriou (1/2)5.8/ 7 ± 0.4
5.9/ 7 ± 0.4
Fall 2006Vazirani (2/2)5.8/ 7 ± 0.4
6.1/ 7 ± 0.4
Spring 2006Sinclair6.3/ 7 ± 0.2
6.1/ 7 ± 0.3
Fall 2005Jordan6.1/ 7 ± 0.2
6.0/ 7 ± 0.3
Spring 2005Papadimitriou (1/2)6.1/ 7 ± 0.3
5.6/ 7 ± 0.4
Spring 2005Trevisan (2/2)4.6/ 7 ± 0.4
5.4/ 7 ± 0.5
Fall 2004Myers4.6/ 7 ± 0.5
5.3/ 7 ± 0.5
Spring 2004Papadimitriou (1/2)5.9/ 7 ± 0.2
5.7/ 7 ± 0.3
Spring 2004Vazirani (2/2)5.6/ 7 ± 0.3
5.7/ 7 ± 0.3
Fall 2003Rao5.5/ 7 ± 0.3
5.9/ 7 ± 0.3
Spring 2003Wagner6.5/ 7 ± 0.1
6.2/ 7 ± 0.2
Fall 2002Henzinger5.5/ 7 ± 0.3
6.0/ 7 ± 0.3
Spring 2002Rao5.2/ 7 ± 0.3
5.6/ 7 ± 0.3
Fall 2001Trevisan4.5/ 7 ± 0.3
5.7/ 7 ± 0.2
Spring 2001Demmel (1/2)5.4/ 7 ± 0.3
5.4/ 7 ± 0.3
Spring 2001Shewchuk (2/2)5.0/ 7 ± 0.4
5.2/ 7 ± 0.4
Fall 2000Clancy5.0/ 7 ± 0.2
5.4/ 7 ± 0.3
Spring 2000Clancy4.9/ 7 ± 0.3
5.3/ 7 ± 0.3
Fall 1999Demmel5.2/ 7 ± 0.3
5.1/ 7 ± 0.4
Spring 1999Papadimitriou (1/2)5.3/ 7 ± 0.3
5.1/ 7 ± 0.3
Spring 1999Vazirani (2/2)5.3/ 7 ± 0.3
5.1/ 7 ± 0.3
Fall 1998Papadimitriou (1/2)5.5/ 7 ± 0.2
5.4/ 7 ± 0.3
Fall 1998Vazirani (2/2)5.3/ 7 ± 0.2
5.2/ 7 ± 0.3
Spring 1998Demmel5.2/ 7 ± 0.3
4.8/ 7 ± 0.3
Fall 1997Papadimitriou4.9/ 7 ± 0.3
4.9/ 7 ± 0.3
Spring 1997Vazirani5.8/ 7 ± 0.4
5.7/ 7 ± 0.3
Fall 1996 Section 1Vazirani4.7/ 7 ± 0.4
4.4/ 7 ± 0.4
Fall 1996 Section 2Papadimitriou4.5/ 7 ± 0.3
4.4/ 7 ± 0.4
Spring 1996Wolfe5.6/ 7 ± 0.2
5.3/ 7 ± 0.3
Fall 1995 Section 1Vazirani4.8/ 7 ± 0.5
4.8/ 7 ± 0.6
Fall 1995 Section 2Vazirani5.3/ 7 ± 0.5
5.2/ 7 ± 0.4
Spring 1995 Section 1Wolfe5.6/ 7 ± 0.4
5.0/ 7 ± 0.5
Spring 1995 Section 2Wolfe6.0/ 7 ± 0.4
5.6/ 7 ± 0.6
Fall 1994 Section 1Kenyon4.8/ 7 ± 0.5
4.5/ 7 ± 0.7
Fall 1994 Section 2Kenyon4.1/ 7 ± 0.5
3.9/ 7 ± 0.5
Spring 1994 Section 1Manuel Blum6.0/ 7 ± 0.4
5.3/ 7 ± 0.7
Spring 1994 Section 2Manuel Blum6.0/ 7 ± 0.4
5.3/ 7 ± 0.7
Fall 1993 Section 1Ranade5.2/ 7 ± 0.3
5.6/ 7 ± 0.4
Fall 1993 Section 2Ranade5.4/ 7 ± 0.3
5.2/ 7 ± 0.4
Spring 1993 Section 1Manuel Blum5.6/ 7 ± 0.4
5.0/ 7 ± 0.5
Spring 1993 Section 2Manuel Blum6.1/ 7 ± 0.3
5.6/ 7 ± 0.4
Fall 1992 Section 1Ranade5.0/ 7 ± 0.4
5.0/ 7 ± 0.4
Fall 1992 Section 2Ranade4.7/ 7 ± 0.4
4.4/ 7 ± 0.5
Spring 1992 Section 1Seidel5.5/ 7 ± 0.3
4.8/ 7 ± 0.5
Spring 1992 Section 2Seidel5.0/ 7 ± 0.4
4.6/ 7 ± 0.5
Fall 1991 Section 1Canny3.9/ 7 ± 0.5
3.9/ 7 ± 0.4
Fall 1991 Section 2Canny4.5/ 7 ± 0.3
4.3/ 7 ± 0.5
Spring 1991 Section 1Canny4.0/ 7 ± 0.3
3.6/ 7 ± 0.4
Spring 1991 Section 2Canny4.2/ 7 ± 0.6
4.0/ 7 ± 0.6
Fall 1990Gill4.5/ 7 ± 0.4
4.3/ 7 ± 0.3
Spring 1990 Section 1Seidel3.4/ 7 ± 0.9
4.2/ 7 ± 0.8
Spring 1990 Section 2Seidel3.7/ 7 ± 0.5
3.7/ 7 ± 0.5
Fall 1989Manuel Blum6.2/ 7 ± 0.2
5.5/ 7 ± 0.3
Spring 1989Karp5.9/ 7 ± 0.3
5.3/ 7 ± 0.3
Fall 1988 Section 1Gill4.7/ 7 ± 0.5
4.9/ 7 ± 0.5
Fall 1988 Section 2Gill5.1/ 7 ± 0.7
4.7/ 7 ± 0.7

   
Overall Rating Teaching EffectivenessHow worthwhile was this course?
Computer Science 170 5.3/ 7 ± 0.0
5.5/ 7 ± 0.0

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


Powered by GoodProfOrNot.