MA 473 - Design & Analysis of Algorithms
- Credit Hours: 4R-0L-4C
- Term Available: F
- Graduate Studies Eligible: No
- Prerequisites: MA 375, CSSE 230
- 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.