CSC373 Algorithm Design, Analysis & Complexity Syllabus

University of Toronto, Fall 2015


About This Course

Standard algorithm design techniques: divide-and-conquer, greedy strategies, dynamic programming, linear programming, randomization, network flows, approximation algorithms. Brief introduction to NP-completeness: polynomial time reductions, examples of various NP-complete problems, self-reducibility. Students will be expected to show good design principles and adequate skills at reasoning about the correctness and complexity of algorithms.

Automatically Turn Your Notes Into Practice Tests

Convert your notes into multiple-choice questions using AI so you can quiz yourself on Questionate!