MATH 180 Discrete Mathematics

This course is designed to highlight discrete (non-continuous) mathematical structures, with a strong emphasis on practical algorithms, a significant computer applications component. Topics include: algorithms, financial models, recursion, recurrence relations, functions, set theory, countability, counting arguments, number representation, logic, proof techniques, mathematical induction, and graph theory.

Credits

3

Offered

Spring term

Fulfills

QuEST Mathematical Sciences requirement