Computer Science 270

Title	Combinatorial Algorithms and Data Structures
Units	3
Prerequisites	170.
Description	Design and analysis of efficient algorithms for combinatorial problems. Network flow theory, matching theory, matroid theory; augmenting-path algorithms; branch-and-bound algorithms; data structure techniques for efficient implementation of combinatorial algorithms; analysis of data structures; applications of data structure techniques to sorting, searching, and geometric problems.

Sections Instructor Teaching Effectiveness How worthwhile was this course?

Spring 2007 Karp 6.2 / 7 ± 0.3
5.5 / 7 ± 0.5

Spring 2006 Rao 4.1 / 7 ± 1.1
4.6 / 7 ± 1.0

Spring 2005 Papadimitriou 6.1 / 7 ± 0.3
5.8 / 7 ± 0.3

Spring 2004 Rao 4.9 / 7 ± 0.5
5.3 / 7 ± 0.5

Spring 2003 Papadimitriou 5.8 / 7 ± 0.3
5.3 / 7 ± 0.4

Fall 2001 Rao 4.3 / 7 ± 0.4
4.9 / 7 ± 0.5

Spring 2001 Sinclair 6.1 / 7 ± 0.3
5.7 / 7 ± 0.5

Spring 2000 Rao 4.8 / 7 ± 0.6
5.4 / 7 ± 0.5

Spring 1999 Sinclair 5.9 / 7 ± 0.5
5.6 / 7 ± 0.7

Spring 1998 Papadimitriou 6.4 / 7 ± 0.3
6.0 / 7 ± 0.4

Spring 1997 Cohen 4.8 / 7 ± 0.9
5.4 / 7 ± 0.9

Fall 1995 Wolfe 4.1 / 7 ± 1.2
4.3 / 7 ± 1.7

Fall 1994 Sinclair 6.2 / 7 ± 0.4
5.8 / 7 ± 0.4

Spring 1994 Luby 5.6 / 7 ± 1.1
5.0 / 7 ± 2.9

Fall 1993 Lawler 3.5 / 7 ± 0.6
4.0 / 7 ± 0.7

Spring 1993 Lawler 5.0 / 7 ± 2.9
5.5 / 7 ± 2.7

Fall 1992 Wolfe 3.2 / 7 ± 0.6
4.2 / 7 ± 0.5

Fall 1991 Seidel 5.1 / 7 ± 0.8
4.9 / 7 ± 0.8

Fall 1990 Karp 6.2 / 7 ± 0.2
5.0 / 7 ± 0.3

Fall 1989 Lawler 4.9 / 7 ± 0.5
4.6 / 7 ± 0.5

Fall 1988 Bern 5.6 / 7 ± 1.9
3.9 / 7 ± 1.7

Overall Rating Teaching Effectiveness How worthwhile was this course?

Computer Science 270 5.3 / 7 ± 0.0
5.2 / 7 ± 0.0

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