Study of data structures such as linked lists, stacks, queues, trees, and graphs. Algorithms for manipulating such structures will be introduced and analyzed. Static and dynamic memory allocation. Access methods for sorting/searching, such as hashing and tree searching.
CSCI 112 (minimum grade of “C”) and MATH 250 (minimum grade of “C”).
Highlighted text indicates a change from the official version of the catalog.