Data Structures and Algorithms

4 credits

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. Intended for non-majors. Course overlaps with: CSE 326; CSE 332; and T INFO 473. Prerequisite: CSE 123 or CSE 143.