| Current Quarter |
 |
Autumn, 2010 (Ruzzo) |
 |
| Prerequisites |
|
CSE 321 |
|
| Standard Syllabus |
|
CSE 322 |
|
| Previous Quarters |
|
Spring, 2010 (Rao) |
|
Winter, 2010 (Ruzzo) |
|
Autumn, 2009 (Beame) |
|
Spring, 2009 (Bacon) |
|
Winter, 2009 (Ladner) |
|
Autumn, 2008 (Bacon) |
|
Spring, 2008 (Bacon) |
|
Winter, 2008 (Beame) |
|
Autumn, 2007 (Ruzzo) |
|
Spring, 2007 (Nobody) |
|
Winter, 2007 (Beame) |
|
Autumn, 2006 (Tompa) |
|
Spring, 2006 (Nobody) |
|
Winter, 2006 (Rao) |
|
Autumn, 2005 (Tompa) |
|
Spring, 2005 (Beame) |
|
Winter, 2005 (Guruswami) |
|
Autumn, 2004 (Rao) |
|
Spring, 2004 (Rao) |
|
Winter, 2004 (Beame) |
|
Autumn, 2003 (Ladner) |
|
Spring, 2003 (Guruswami) |
|
Winter, 2003 (Ladner) |
|
Autumn, 2002 (Rao) |
|
Spring, 2002 (Chinn) |
|
Winter, 2002 (Tompa) |
|
Autumn, 2001 (Rao) |
|
Spring, 2001 (Sengupta) |
|
Winter, 2001 (Ladner) |
|
Spring, 2000 (Beame) |
|
Winter, 2000 (Sengupta) |
|
Autumn, 1999 (Sengupta) |
|
Winter, 1999 (Beame) |
|
Autumn, 1998 (Ladner) |
|
Spring, 1998 (Tompa) |
|
Winter, 1998 (Beame) |
|
Autumn, 1997 (Young) |
|
|
|
|
Catalog Description: Finite automata and regular expressions; context-free grammars and pushdown automata; nondeterminism; Turing machines and the halting problem. Emphasis on understanding models and their applications and on rigorous use of basic techniques of analysis. Induction proofs, simulation, diagonalization, and reduction arguments.
Prerequisites: CSE 321.
Credits: 3
Portions of the CSE 322 Web may be reprinted or adapted for academic
nonprofit purposes, providing the source is accurately quoted and duly
credited. The CSE 322 Web: © 1993-2010, Department of Computer Science
and Engineering, University of Washington.
Administrative information on CSE322 (authentication required).
|
CSE Home 