CSE332: Data Structures and Parallelism

Catalog Description: Covers abstract data types and structures including dictionaries, balanced trees, hash tables, priority queues, and graphs; sorting; asymptotic analysis; fundamental graph algorithms including graph search, shortest path, and minimum spanning trees; multithreading and parallel algorithms; P and NP complexity classes. No credit if CSE 373 has been taken. Prerequisite: CSE 311.

Prerequisites: CSE 311
Credits: 4.0

---

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