Faculty of Arts & Science · St. George
CSC373H1
Algorithm Design, Analysis & Complexity
What was the average?
B
3 GPA across 2 observed terms. Most recent: Fall 2025.
How is it graded?
Not yet verified
No syllabus we can lawfully use has been verified for this course.
How confident is this?
Med
A small number of terms, so read it as a range.
From the calendar
Official source · Faculty of Arts & ScienceStandard 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.
- Exclusions
- CSC373H5CSC375H1CSCC73H3
- Contact hours
- 36 lecture · 12 tutorial
- Total scheduled hours for the course, not per week.
What people actually got
Last observed Fall 20252 terms observed
This is a student-contributed aggregate, not an official University of Toronto record. It is also not a measure of how hard the course is — a course average moves with who enrols in it, not only with the material.
This rests on 2 reported terms. It is shown because hiding it would not make it less true, but one or two results are a datapoint, not a distribution — a single unusual cohort moves this number a long way.
How well we know this course
2016–2024Pyko’s archive holds 29 documents for CSC373H1, across 8 years between 2016 and 2024.
- 9
- Final exams
- 4
- Midterms
- 5
- Solution sets
- 4
- Assignments
- 5
- Tutorial material
- 2
- Handouts
Both a midterm and a final appear in what we hold, so this course has historically been assessed on both rather than on a single end-of-term paper.
Counts, not a library. Pyko does not host or distribute course files, and this page is not an offer to supply one — the archive is what lets these pages describe how a course is assessed, which matters most where no syllabus has been verified.
What we don’t have yet
Source ledger
Report an error →| Claim | Source | Captured | Status |
|---|---|---|---|
| Course description, prerequisites, exclusions, contact hours | Faculty of Arts & Science | 2026-07-25 | public fact |
| Historical average across 2 terms | Student contributions, consented | 2026-07-25 | user contributed aggregate |
| 29 archived documents, 2016-2024 | Pyko archive | 2026-07-25 | index only |
Page last verified 2026-07-25. A claim whose source moves is withdrawn before it goes stale.
What this opens up
4 courses list CSC373H1 as a prerequisiteThe other 1 have no page yet. Listing a course here means it names CSC373H1 among its prerequisites — often as one of several ways to satisfy the same requirement, so this is what CSC373H1 makes available, not what it alone guarantees.
Around this course
You’ve read the average. Now use it.
Add CSC373H1 and Pyko tracks what you've earned against your own grading scheme.
Pyko is an independent student platform. It is not affiliated with, endorsed by, or operated by the University of Toronto. Course names and codes are used descriptively to identify courses.