Course Description
Abstract data types; abstract and implementation-level views of data types. Linear and branching data structures, including stacks, queues, trees, heaps, hash tables, graphs, and others at discretion of instructor. Best, worst, and average case asymptotic time and space complexity as a means of formal analysis of iterative and recursive algorithms.
Fall 2025
Instructors
Meeting Patterns
Classes Start:
August 18, 2025
Classes End:
December 2, 2025
Location:
02321 Fitts-Woolard Hall
Class Days:
T H
Class Start Time:
10:15am
Class End Time:
11:30am
Class Type:
Lecture
Credits:
3.00
Restrictions:
Prerequisite: CSC 216 with a grade of C or better and (CSC 226 or MA 225) with a grade of C or better Restricted: Computer Science-BS, Computer Science-Intended, Computer Programming, or Mathematics Education-BS