STEM / applied
Discrete math · Undergraduate · Math
Topics
Computer science connections
- Boolean algebra and logic gates (CS orientation)
- Algorithmic complexity: big-O notation (introduction)
- Graph algorithms: shortest paths, spanning trees, and traversals
- Finite-state machines and regular languages (overview)
Applications
- Cryptography basics: modular arithmetic and RSA (overview)
- Coding theory and error detection (optional)
- Combinatorial probability tied to counting problems
- Recurrence relations in divide-and-conquer algorithms
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 · 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 or Venmo.