(4 cr) The topics in this course include definitions and implementations of basic data structures including linked lists, stacks, queues, trees, and graphs and their applications; recursion as a algorithm design tool; and file organization and access techniques. Prerequisites: CIS 314; MATH 254; and MATH 205 or 207; or permission of instructor.
