MA 473 - Design & Analysis of Algorithms

  • Credit Hours: 4R-0L-4C
  • Term Available: W
  • Prerequisites: CSSE 230, and either MA 375, or both MA 276, and MA 374
  • Corequisites: None

Students study techniques for designing algorithms and for analyzing the time and space efficiency of algorithms. The algorithm design techniques include divide-and-conquer, greedy algorithms, dynamic programming, randomized algorithms and parallel algorithms. The algorithm analysis includes computational models, best/average/worst case analysis, and computational complexity (including lower bounds and NP-completeness). Same as CSSE 473.

Launch Root Quad
Return to Top