Skip to content

CISC 233 Essential Algorithms

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 for the student is to be able to apply all of the above to design solutions for real-world problems.

Course ID: CISC 233

Semester Hours: 3

View All Courses