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. Development of algorithms for parallel and distributed architectures. Computational complexity as it pertains to time and space is used to evaluate the algorithms. A general overview of complexity classes is given. Identical with CSI 3610.
Prerequisite(s): CSI 2310 and APM 2663 with a grade of (C) or higher.