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 2023 | Jelani Nelson | ||
| Spring 2021 | Prasad Raghavendra | ||
| Spring 2017 | Satish Rao | ||
| Spring 2016 | Christos Papadimitriou | ||
| Spring 2015 | Lap Chi Lau | ||
| Spring 2013 | Satish Rao | ||
| Spring 2010 | Richard M. Karp | ||
| Fall 2008 | Richard M. Karp | ||
| Spring 2008 | Satish Rao | ||
| Spring 2007 | Richard M. Karp | ||
| Spring 2006 | Satish Rao | ||
| Spring 2005 | Christos Papadimitriou | ||
| Spring 2004 | Satish Rao | ||
| Fall 2001 | Satish Rao | ||
| Spring 2001 | Alistair Sinclair | ||
| Spring 2000 | Satish Rao | ||
| Spring 1999 | Alistair Sinclair | ||
| Spring 1998 | Christos Papadimitriou | ||
| Spring 1997 | Edith Cohen | ||
| Fall 1995 | David Wolfe | ||
| Fall 1994 | Alistair Sinclair | ||
| Spring 1994 | Michael Luby | ||
| Fall 1993 | Eugene Lawler | ||
| Spring 1993 | Eugene Lawler | ||
| Fall 1992 | David Wolfe | ||
| Fall 1991 | Raimund Seidel | ||
| Fall 1990 | Richard M. Karp | ||
| Fall 1989 | Eugene Lawler | ||
| Fall 1988 | M. Bern | ||
| Overall Rating | Teaching Effectiveness | How worthwhile was this course? | |