MW 4:10pm–5:25pm · MW 5:40pm–6:55pm
2 distinct times across 2 sections.
1 of 2 sections have room
Prerequisites Prerequisites: Any introductory course in computer programming.
Description
Lect: 3. Logic and formal proofs, sequences and summation, mathematical induction, binomial coefficients, elements of finite probability, recurrence relations, equivalence relations and partial orderings, and topics in graph theory (including isomorphism, traversability, planarity, and colorings)
Reviews
Course experience
n=97, 2000–2026
Aggregated across everyone who has taught this course.
Teaching quality
4.5 / 5
Grading fairness
4.0 / 5
Workload
4.0 / 5 · Heavy
Difficulty
3.3 / 5 · Moderate
Overall sentiment
Mixed
Sections2
Gabriel T Chuang · Augustin Chaintreau
MW 4:10pm–5:25pm · PUPIN LABORATORIES PUP 301FullSeat data provenance: Directory as of August 23, 2026 at 4:00 AM
- 110 of 110 seats left
Seat data provenance: Directory as of August 23, 2026 at 4:00 AM
In your week
Workload and grading
- Grading
- Not published
- Format
- Not published
- Credits
- 4 credits
Reported workload
From CULPA and Reddit reviews matched to this course.
No reviews matched yet.