Search Results
CSC 316 Data Structures and Algorithms
°ä³§°äÌý316ÌýÌýData Structures and AlgorithmsÌýÌý(3 credit hours)ÌýÌý
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.
Prerequisite: °ä³§°äÌý216 with a grade of C or better and (°ä³§°äÌý226 or ²Ñ´¡Ìý225) with a grade of C or better
Typically offered in Fall, Spring, and Summer