Standard syllabus
Discrete math for CS · Undergraduate · CS / Programming
Topics
Logic and proof
- Propositional logic and truth tables
- Predicates, quantifiers, and inference rules
- Direct proof, contrapositive, and contradiction
- Mathematical induction and strong induction
- Sets, functions, and cardinality (intro)
Combinatorics and graphs
- Counting: permutations, combinations, binomial theorem
- Pigeonhole principle and inclusion–exclusion (intro)
- Recurrence relations and generating functions (intro)
- Graphs: paths, cycles, trees, connectivity
- Euler/Hamilton paths; planarity (intro)
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.