Data Structures and Parallelism

4 credits

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. Course overlaps with: CSE 373 and T INFO 473. Prerequisite: CSE 311.