MATH 150
Discrete Mathematics
Logic, introduction to proofs, mathematical induction, set operations, algorithms and Big-O, introduction to number theory, recurrence relations, techniques of counting, graphs, as well as specific questions given by the “Towers of Hanoi,” and Euler’s “7 bridges of Konigsberg problem.” Required for majors in Computer Science and Data Science.
Sources
- Course catalogue ↗2026-2027
Catalogue variants
- Discrete Mathematics · 4.0