MAT 250 - Introduction to Discrete Structures

3 credit hours - Three hours weekly; one term.
Apply fundamental mathematical concepts and algebraic structures to theoretical areas of computer science. Topics include logic, number theory, sets, relations, functions, strong and weak mathematical induction, combinatorics, probability, and algorithm efficiency.

Prerequisite(s): MAT 146 or MAT 151 or higher level math course.

Note: Programming experience is recommended. Typically offered at MC and OL; fall and spring terms.

Course Outcomes:

Employ formal notations for logic, sets, functions and summations, including recursion.
Construct direct and indirect proofs, including proofs by induction.
Solve counting problems, including permutations and combinations.
Determine the efficiency of algorithms.
Solve problems involving number theory, including modular arithmetic.