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.
DE Fee
Engineering Online UGRD
DE Program
Computer Certificate Program
SUM1 10W 2020
Instructors
Classes Start:
May 13, 2020
Classes End:
July 24, 2020
Distance Education:
Yes
Class Type:
Lecture
Credits:
3.00
Delivery Method:
Internet
Restrictions:
Enrollment for this course is through the Engineering Online Registration System. Go to http://go.ncsu.edu/eol_registration
