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
Proof practice for CS
- Direct, contradiction, and contrapositive proofs
- Strong induction on recursive structures
- Invariant proofs for loops and algorithms
- Bijection and pigeonhole arguments
- Graph induction and tree properties
- Writing clear proofs that graders can follow
Pricing calculator
Choose materials, tutoring, or both — or book a single session as needed. Customize your plan on the subscribe page.
$1,162 · Discrete math for CS · 18 tutoring hrs
Study guides, worksheets, reviews, practice tests, and answer keys for 1 class. 18 tutoring hours (1 hr / week · semester). Bundle discount applied vs buying separately. Pay in full via Zelle.