Design and implementation of linear structures, trees and graphs. Examples of common algorithmic paradigms. Theoretical and empirical complexity analysis. Sorting, searching, and basic graph algorithms. Prerequisites: CS 110 with a grade of C- or better; minimum Sophomore standing.
Prereqs enforced by the system: C- or better in CS 110; Asynchronous Online Course
Online (View Campus Map)
Please contact the instructor for information about this course.
Note: These dates may not be accurate for select courses during the Summer Session.
Courses may be cancelled due to low enrollment. Show your interest by enrolling.
|Last Day to Add|
|Last Day to Drop|
|Last Day to Withdraw with 50% Refund|
|Last Day to Withdraw with 25% Refund|
|Last Day to Withdraw|
There are no courses that meet this criteria.