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)
CS applications of discrete math
- Logic for program correctness and assertions
- Counting arguments for algorithm analysis
- Graphs in networking, compilers, and social data
- Modular arithmetic in hashing and crypto intros
- Recurrences for divide-and-conquer algorithms
- Discrete probability for randomized algorithms (intro)
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.