Discrete Mathematics

Catalog description

This course is an introduction to Discrete Math coevering propositional logic, set operations, growth of functions, algorithms and their complexities, number theory, integer representations, mathematical induction, strong induction, proof techniques, counting, pigeon-hold principle, combinatorics, probability graph theory and trees. Offered every fall semester.