| |
Apr 19, 2024
|
|
|
|
|
CMPS 340 - Design and Analysis of Algorithms Credit Hours: 3
Lecture Contact Hours: 3 Lab Contact Hours: 0
Algorithm analysis and asymptotic notation. Advanced data structures analysis. Design and analysis of: divide-and-conquer algorithms, dynamic programming, greedy algorithms, and amortized analysis; multithreaded algorithms, linear programming, number-theoretic algorithms, computational geometry and approximation algorithms.
Prerequisite(s): CMPS 261 and (MATH 270 or MATH 272 ) both with a grade of “C” or better
Add to Catalog (opens a new window)
|
|
