MATH 180 Discrete Mathematics

Discrete mathematics is the study of finite and countable sets. It provides the language and abstractions required to reason about many concepts in computer science. Discrete mathematics is concerned with mathematical structures that are composed of distinct pieces or processes that are composed of individual steps. Topics in the course may include: algorithms, financial models, recursion, recurrence relations, functions, set theory, countability, counting arguments, number representation, logic, proof techniques, mathematical induction, and graph theory.