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; CS 064 or or MATH 052.
Prereqs enforced by the system: CS 110 & CS 064 or MATH 052; Open to degree and CDE students; Common final
Perkins Building 102 (View Campus Map)
to on Tuesday and Thursday