Lec. 3. Credit 3. Prerequisite: C or better in CSC 2100, CSC 2101 and MATH 1910. Corequisite: CSC 2111. Abstract data types and fundamental data structures including stacks, queues, and trees; algorithms to search, sort, and manipulate data using such structures; and introduction to runtime analysis.