
CSE421: Introduction to Algorithms
Catalog Description: Techniques for design of efficient algorithms. Methods for showing lower bounds on computational complexity. Particular algorithms for sorting, searching, set manipulation, arithmetic, graph problems, pattern matching.Prerequisites: either CSE 312 or CSE 322; either CSE 326 or CSE 332.
Credits: 3
Portions of the CSE 421 Web may be reprinted or adapted for academic nonprofit purposes, providing the source is accurately quoted and duly credited. The CSE 421 Web: © 1993-2013, Department of Computer Science and Engineering, University of Washington. Administrative information on CSE421 (authentication required).
- Current Quarter
- Prerequisites
- Previous Quarters
- Winter, 2013 (Rao)
- Autumn, 2012 (Beame)
- Summer, 2012 (Ruzzo)
- Winter, 2012 (Ruzzo)
- Autumn, 2011 (Karlin)
- Summer, 2011 (Ruzzo)
- Winter, 2011 (Rao)
- Autumn, 2010 (Ladner)
- Winter, 2010 (Rao)
- Autumn, 2009 (J. Lee)
- Winter, 2009 (R. Anderson)
- Autumn, 2008 (Beame)
- Winter, 2008 (Karlin)
- Autumn, 2007 (Beame)
- Summer, 2007 (Ruzzo)
- Winter, 2007 (Karlin)
- Autumn, 2006 (R. Anderson)
- Winter, 2006 (Karlin)
- Autumn, 2005 (R. Anderson)
- Winter, 2005 (Beame)
- Summer, 2004 (Ruzzo)
- Winter, 2004 (Ruzzo)
- Winter, 2003 (Beame)
- Winter, 2002 (Karlin)
- Winter, 2001 (Ruzzo)
- Winter, 2000 (Ruzzo)
- Winter, 1999 (Ruzzo)
- Winter, 1998 (Ruzzo)
- Winter, 1997 (Karp)
- Winter, 1996 (Ruzzo)
- Winter, 1995 (Karlin)
Computer Science & Engineering University of Washington Box 352350 Seattle, WA 98195-2350 (206) 543-1695 voice, (206) 543-2969 FAX
