A Degree For Today and Tomorrow

Next start dates are: Fall Term B - October 26th.

Home / CISC 233 – Essential Algorithms


Corequisites: CISC 160

Description: This course covers the basic techniques used to analyze problems and algorithms, including asymptotic, upper/lower bounds, and best/average/worst case analysis. Amortized analysis, complexity, and basic techniques are used to design algorithms (including divide & conquer / greedy / dynamic programming / heuristics, choosing appropriate data structures) and important classical algorithms (including sorting, string, matrix, and graph algorithms). The goal is for the student to be able to apply all of the above to design solutions for real-world problems.


Course Information

  • Course Code: CISC 233
  • Credits: 3 credits