| |
Feb 05, 2025
|
|
|
|
|
CMPS 340 - Design and Analysis of Algorithms
3 Credit(s). 0 Hour(s) Lab. 3 Hour(s) Lecture.
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.
Prereq: CMPS 261 with a minimum grade of “C”.
Add to Catalog (opens a new window)
|
|
