APM 3610 - Design and Analysis of Algorithms

(4)

Computer algorithms, their design and analysis. Strategies for constructing algorithmic solutions, including divide-and-conquer, dynamic programming and greedy algorithms. Computational complexity as it pertains to time and space is used to evaluate the algorithms. A general overview of complexity classes is given. Students can receive credits for APM 3610 or CSI 3620, but not both. Identical with CSI 3610.
Prerequisite(s): (CSI 2310 or CSI 2290) and APM 2663 with a grade of (C) or higher