Search | Directories | Reference Tools
UW Home > Discover UW > Student Guide > Course Catalog 

Instructor Class Description

Time Schedule:

Katherine Nichole Deibel
CSE 332
Seattle Campus

Data Abstractions

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.

Class description

This course covers abstract data types and structures including dictionaries, balanced trees, hash tables, priority queues, and graphs. Various related concepts are also covered: sorting; asymptotic analysis; fundamental graph algorithms (graph search, shortest path, and minimum spanning trees); concurrency and synchronization; and parallelism.

Student learning goals

General method of instruction

Interactive lectures (lecture plus small group work and problem-solving exercises)

Recommended preparation

Class assignments and grading


The information above is intended to be helpful in choosing courses. Because the instructor may further develop his/her plans for this course, its characteristics are subject to change without notice. In most cases, the official course syllabus will be distributed on the first day of class.
Last Update by Katherine Nichole Deibel
Date: 06/14/2012