Course Description
CSE 373: Data Structures and Algorithms The University of Washington, Seattle, Autumn 2006
Official description: Fundamental algorithms and data structures for implementation. Techniques for solving problems by programming. Linked lists, stacks, queues, directed graphs. Trees: representations, traversals. Searching (hashing, binary search trees, multiway trees). Garbage collection, memory management. Internal and external sorting. No credit to students who have completed 326, 374, or E E 374. Prerequisite: CSE 143.
Note that this description is somewhat out of date. We will not be covering garbage collection or external sorting. On the other hand we will be covering the UNION-FIND abstract data type and the dynamic programming algorithm for the Longest Common Subsequence problem.     The teaching methodology combines lectures, in-class exercises, laboratory activities, and programming projects.