This is the web site for the version of CSC 373 being taught at the Mississauga Campus of the University of Toronto. For the course being taught at the St. George campus, see the downtown course web page.
Standard algorithm design techniques: divide-and-conquer, greedy strategies, dynamic programming, linear programming, randomization, and others (such as local search). Students will be expected to show good design principles and adequate skills at reasoning about the correctness and complexity of algorithms. [26L, 13T]
Exclusion: CSC375H1, 364H5
Prerequisite: CSC263H5/378H5
|
|