
CSE521: Design and Analysis of Algorithms I
Catalog Description: Principles of design of efficient algorithms: recursion, divide and conquer, balancing, dynamic programming, greedy method, data structure selection. Correctness and analysis of algorithms. Examples drawn from problems in sorting, searching, set manipulation, pattern-matching, graphs, matrices, polynomials, and integers.Prerequisites: CSE major and CSE 326 or equivalent. CSE majors only.
Credits: 4
Portions of the CSE 521 Web may be reprinted or adapted for academic nonprofit purposes, providing the source is accurately quoted and duly credited. The CSE 521 Web: © 1993-2013, Department of Computer Science and Engineering, University of Washington. Administrative information on CSE521 (authentication required).
- Current Quarter
- Prerequisites
- Previous Quarters
- Autumn, 2011 (Harrow)
- Autumn, 2010 (Karlin)
- Winter, 2010 (Beame)
- Spring, 2009 (J. Lee)
- Spring, 2008 (Karlin)
- Autumn, 2006 (Karlin)
- Winter, 2006 (Guruswami)
- Winter, 2005 (Karlin)
- Winter, 2004 (Karlin)
- Spring, 2003 (Ladner)
- Spring, 2002 (Karlin)
- Spring, 2001 (R. Anderson)
- Winter, 2000 (R. Anderson)
- Winter, 1999 (Tompa)
- Spring, 1998 (R. Anderson)
- Spring, 1997 (Tompa)
- Winter, 1996 (R. Anderson)
Computer Science & Engineering University of Washington Box 352350 Seattle, WA 98195-2350 (206) 543-1695 voice, (206) 543-2969 FAX
