Mar 28, 2024  
2019-2020 Undergraduate and Graduate Academic Catalog 
    
2019-2020 Undergraduate and Graduate Academic Catalog [ARCHIVED CATALOG]

Add to Catalog (opens a new window)

CMPS 340 - Design and Analysis of Algorithms


3 Credit Hour(s) 3 Lecture Hour(s) 0 Lab Hour(s)

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  and MATH 270  both with a grade of “C” or better



Add to Catalog (opens a new window)