|
Sep 08, 2024
|
|
|
|
CSE 361 - Design and Analysis of Algorithms(4) Credits Computer algorithms, their design and analysis. Strategies 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. Offered fall and winter. Prerequisite(s): CSE 231, APM 263, and major standing in CS.
Add to Portfolio (opens a new window)
|
|