CSC 316 - Data Structures and Algorithms

Catalog 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.

Contact Hours: Prerequisites: CSC216 with a grade of C or better and [CSC226 or MA22
Co-requisites: None
Coordinator: Dr. Jason King
Textbook: Data Structures and Algorithms in Java

Course Outcomes:

Upon successful completion of this course, a student will be able to


See Course Listings

See Course Coordinators