CSC 320A - Algorithms - Theory and Practice

(3) This course is a study in algorithms, their correctness proofs and complexity, algorithm classes, and problem classes. The course focuses on implementing performance principles for organizing thought for programming problem solutions. Topics covered are: orders of magnitude, divide-and-conquer strategy and to bound running times for greedy algorithms and proofs, tree and graph algorithms, problem classes, and dynamic multi-threading.

Prerequisites: CSC 220A, MAT 261A.