Faculty of Arts & Science · St. George
CSC473H1
Advanced Algorithm Design
What was the average?
Not reported
No student has contributed a result for this offering yet.
How is it graded?
Not yet verified
No syllabus we can lawfully use has been verified for this course.
How confident is this?
Unknown
A small number of terms, so read it as a range.
From the calendar
Official source · Faculty of Arts & ScienceAdvanced algorithm design techniques, with emphasis on the role that geometry, approximation, randomization, and parallelism play in modern algorithms. Examples will be drawn from linear programming and basics of continuous optimization; randomized algorithms for string matching, graph problems, and number theory problems; streaming algorithms and parallel algorithms in the Map-Reduce model.
- Contact hours
- 24 lecture · 12 tutorial
- Total scheduled hours for the course, not per week.
How well we know this course
2023–2024Pyko’s archive holds 2 documents for CSC473H1, across 2 years between 2023 and 2024.
- 2
- Final exams
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 |
| 2 archived documents, 2023-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.
Everything above is history. Yours isn’t written yet.
Add CSC473H1 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.