CS 360 Analysis of Algorithms

Spring Semester

This course studies fundamental algorithms, strategies for designing algorithms and mathematical tools for analyzing algorithms. Fundamental algorithms studied in this course include graph algorithms; algorithms for sorting and searching; hashing; integer arithmetic; and selected combinatorial tasks. Mathematical tools include asymptotic notations and methods for solving recurrences. Algorithm design strategies include the greedy method, divide-and-conquer, dynamic programming, and randomization. Prerequisite: CS 201 and CS 350 and (MAT 235 or ECE 335 or MAT 280) with a grade of 2.0 or higher.

3 credit hours