CSC373H1

UTSG

Algorithm Design, Analysis & Complexity

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. Additional topics may include approximation and randomized algorithms. Students will be expected to show good design principles and adequate skills at reasoning about the correctness and complexity of algorithms.

View full details on the UofT Academic Calendar
Prereq: CSC263H1/ CSC265H1 / CSC263H5/ CSCB63H3Breadth: Physical & Mathematical UniversesExcl: CSC375H1, CSC373H5, CSCC73H3. NOTE: Students not enrolled in the Computer Science Major or Specialist program at A&S, UTM, or UTSC, or the Data Science Specialist at A&S, are limited to a maximum of 1.5 credits in 300-/400-level CSC/ECE courses.
Easy32%
Useful86%
4
comments
7
ratings

Course Info

DepartmentCSC
CampusUTSG (St. George)
Level300
Hours36L/12T
BreadthPhysical & Mathematical Universes
What do you think of CSC373H1?

Reviews (4)

From Reddit
Difficulty: 5/5Usefulness: 4/5

Required CS course. Sam is an incredible lecturer — I'd probably rank him top 3 in teaching ability. But this course was a nightmare. Early morning lectures, no recordings, incredibly dense content, incredibly difficult assessments. More all-nighters than all other courses combined.

3 weeks ago