CSC 316
Data Structures and Algorithms
Section: 051

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.

SUM1 10W 2020

Instructors

Classes Start:
May 13, 2020
Classes End:
July 24, 2020
Location:
Online Delivery
Class Days:
TWH
Class Start Time:
3:20pm
Class End Time:
4:35pm
Class Type:
Lecture
Credits:
3.00
Delivery Method:
Internet Interactive
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

Tools