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.
Dates: May 24 - July 2, 2021
Please contact the instructor for information about this course.
Online (View Campus Map)
Note: These dates may change before registration begins.
|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|
|CS 091 OL1||Computer Science: Instructing in Computer Sci (online)||to||N/A||See Notes||0.5 - 6||61391|
|CS 110 OL1||Computer Science: QR: Intermediate Programming (online)||to||N/A||See Notes||4||61497|
|CS 166 OL1||Computer Science: QR: Cybersecurity Principles (online)||to||N/A||See Notes||3||61311|
|CS 167 OL1||Computer Science: Cybersecurity Defense (online)||to||N/A||See Notes||3||61312|
There are no courses that meet this criteria.