When tackling algorithm design and analysis, you're engaging in a complex form of problem-solving that requires a specific set of skills. Algorithms are step-by-step procedures for calculations ...

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 ...

Sparse matrix computations are an important class of algorithms. One of the important topics in this field is SPCA (Sparse Principal Component Analysis), a variant of PCA. SPCA is used to compute the ...