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: This description is a little out
of date. Certain topics are now considered less important (e.g., external
sorting). In some quarters
this course will focus on METHODOLOGY as well as the
data structures and algorithms themselves. That includes
the practice of designing with data structures and algorithms,
the practice of articulating
(with speech and writing) issues concerning these techniques,
and problem solving.