About CS 2240 A
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 2100 with a grade of C- or better; minimum Sophomore standing.
Notes
Prereqs enforced by the system: C- or better in CS 2100; Minimum sophomore standing; Open to Degree and PACE students System waitlisting enabled for this section.
Syllabus Unavailable
Please contact the instructor for information about this course.
Important Dates
Note: These dates may change before registration begins.
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 |
Resources
Remind Me Form
Remind yourself about CS 2240 A.
We'll send you a reminder before Spring 2027 registration begins.