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

Prerequisites: CSE 311
Credits: 4.0
ABET Outcomes:
This course contributes to the following ABET outcomes:
(a) an ability to apply knowledge of mathematics, science, and engineering
(b) an ability to design and conduct experiments, as well as to analyze and interpret data
(c) an ability to design a system, component, or process to meet desired needs within realistic constraints such as economic, environmental, social, political, ethical, health and safety, manufacturability, and sustainability
(k) an ability to use the techniques, skills, and modern engineering tools
(e) an ability to identify, formulate, and solve engineering problems

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