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 2024
Instructors
Meeting Patterns
Classes Start:
August 19, 2024
Classes End:
December 3, 2024
Location:
01231 Engineering Building 2
Class Days:
M W
Class Start Time:
1:30pm
Class End Time:
2:45pm
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
