Instructor Class Description

Time Schedule:

• Spring Quarter 2013
• Summer Quarter 2013
• Autumn Quarter 2013

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

Office of the Registrar
For problems and questions about this web page contact icd@u.washington.edu,
otherwise contact the instructor or department directly.
Modified:May 17, 2013