MATH 303. Data Structures.
(3-0-3); I, II.
Prerequisite: CIS 205. Key concepts of data definitions, such as lists, stacks, and queues. Recursion, graphs and trees, sorting and searching. Structured program design, elementary data structures and the study of algorithms as a tool of program design. Cross listed with CIS 303 and CS 303.