CSE 373: Official Course Description

CSE 373 Data Structures and Algorithms

Credits: (3)
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 slightly out of date. We will not be covering garbage collection or external sorting. On the other hand we are likely to cover Huffman coding and the UNION-FIND abstract data type.