M 225 - Introduction to Discrete Mathematics

Credit(s): 4

Corequisite(s): M 171 or Math Department consent.
The study of mathematical elements of computer science including propositional logic, predicate logic, sets, functions and relations, combinatorics, mathematical induction, recursion and algorithms, matrices, graphs, trees, structures, morphisms, Boolean algebra, and computer logic. (Fall Semester)

Course Learning Outcomes: Upon completion of the course, students will be able to

Use formal proof techniques, including mathematical induction and proof by contradiction.
Use algorithmic complexity to compare different program designs for a problem.
Solve problems that use logic, sets, and functions.
Solve problems using Boolean algebra.
Solve problems that use permutations and combinations.
Solve problems that use discrete probability.
Solve problems that use basic graph theory.