CSC236 Summer 2025
Quick Start
- Join Piazza. join-link, course-link.
- Read the syllabus.
- See the calendar.
- Got a question?
Schedule
Week | Date | Topic | Reading |
---|---|---|---|
1 | May 7 | Welcome and Functions | VH {0.1-0.3, 0.6} |
2 | May 14 | Graphs | |
3 | May 21 | Induction 1, TT1 | DL 2, VH {1, 4} |
4 | May 28 | Induction 2 | |
5 | June 4 | Recursive Algorithms 1 | DL 3, VH {2.7-2.8, 3} |
6 | June 11 | Recursive Algorithms 2, TT2 | |
- | June 18 | No class | |
- | June 25 | No class | |
7 | July 2 | Algorithm Correctness 1 | DL 4, VH 2.1-2.6 |
8 | July 9 | Algorithm Correctness 2 | |
9 | July 16 | Formal Languages 1, TT3 | DL 5, VH 7 |
10 | July 23 | Formal Languages 2 | |
11 | July 30 | Formal Languages 3 | |
12 | August 6 | Review |
- TT means term test
- DL means [notes-david-liu]
- VH means [notes-vassos-hadzilacos]
Course Info
Syllabus: syllabus
Learning Outcomes: learning-outcomes
Instructor: Harry
TAs: Yibin, Mian, Jeremy, Deepanshu, Logan
Optional Reading: notes-vassos-hadzilacos, notes-david-liu, 2023-webpage
Prerequisite: CSC165 (or equivalent). See notes-david-liu-toniann-pitassi
Grading Scheme:
= [0.15, 0.225, 0.225, 0.4]
weights = [tt1, tt2, tt3, final]
grades = np.dot(weights, grades) final_grade
Zoom link: zoom-link