CSE332: Data Abstractions

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; concurrency and synchronization; and parallelism. Not available for credit for students who have completed CSE 373. Prerequisite: either CSE 311 or CSE 321.
Prerequisites: either CSE 311 or CSE 321.
Credits: 4

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