Theoretical / proof-based
Discrete math for CS · Undergraduate · CS / Programming
Topics
Proof depth
- Proof by cases and constructive vs existential proofs
- Well-ordering and structural induction
- Bijections and counting proofs
- Graph isomorphism and coloring arguments
- Intro to Ramsey theory (optional)
CS theory connections
- Big-O notation tied to counting arguments
- Boolean algebra and logic circuits
- Regular languages preview (automata intro)
- Pigeonhole arguments in hashing and compression
- Problem sets mirroring qualifying-exam discrete topics
Pricing calculator
Choose materials, tutoring, or both — or book a single session as needed. Customize your plan on the subscribe page.
Billed in 15-minute increments (15-minute minimum, up to 4 hours). No subscription required.
$60.00 · 60 min · Undergraduate · Online ($60/hr)
Book through intake or schedule a session.