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: CSE 312; CSE 332.
Credits: 3.0
ABET Outcomes:
This course contributes to the following ABET outcomes:
(a) an ability to apply knowledge of mathematics, science, and engineering

Portions of the CSE421 web may be reprinted or adapted for academic nonprofit purposes, providing the source is accurately quoted and duly creditied. The CSE421 Web: © 1993-2017, Department of Computer Science and Engineering, Univerity of Washington. Administrative information on CSE421 (authentication required).