Course Description
CSE 373: Data Structures and Algorithms The University of Washington, Seattle, Winter 2010
Brief description: Fundamental algorithms and data structures for implementation of software solutions to a wide variety of problems. Stacks, queues, directed graphs. Trees: representations and traversals. Hashing, binary search trees, AVL trees, multiway trees. Sorting. Priority queues and binary heaps. The "UNION-FIND" abstract data type and implementation with up-trees. Dynamic programming. String matching algorithms. The use of the Java language, parts of the Swing library and other interactive graphics technology for studying data structures. Intended for non-majors. Prerequisite: CSE 143.
Please note that the actual set of topics covered may vary, in order to respond to the changing needs and opportunities in the computing field.
The teaching methodology combines lectures, in-class exercises, homework, and programming projects.