COMP 372 introduces the fundamental techniques for designing and analyzing algorithms. These include asymptotic notation and analysis, divide-and-conquer algorithms, dynamic programming, greedy ...

Important themes that will be developed in the course include the algorithmic abstraction-design-analysis process and computational tractability (e.g., NP-completeness). This course fulfills the ...