CSE 507 Design and Analysis of Algorithms
(4 credits)
Description:
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. This course is cross listed
with an undergraduate course. Credit cannot be received for more than
one of CSE 507, CSE 361, and APM 367. Course repeats are not permitted.
Credit not applicable toward an M.S. degree.
Prerequisites: CSE 506 or equivalent
Available Syllabus For Download:
CSE 507 - Debnath - Fall 2010