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 (CSE 361 or CSI 3610). (Formerly APM 367)
Prerequisite(s): (CSE 231 or CSI 2310) and (APM 263 or APM 2663) with a grade of 2.0 or higher.