|
Syllabus for CSE521: Design and Analysis of Algorithms I
|
|
CSE521: Design and Analysis of Algorithms I
Credits
3
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.
Textbook(s) and/or other required material
none
Course objectives
none
Topics covered
none
Course structure
none
Last edited by
none
Last modified
(never)
|
 |
Computer Science & Engineering
University of Washington
Box 352350
Seattle, WA 98195-2350
(206) 543-1695 voice, (206) 543-2969 FAX
[comments to webmaint]
|