MATH 2100 - Discrete Mathematics

4 Credits
Introduces number systems, coding schemes, formal logic, sets and relations, induction, recursion, recurrence relations, graphs, trees, and analysis of algorithms. Credit will not be awarded for both MATH 2100 and CS 2350.

Pre-Requisites A grade of C or higher in MATH 1119, or MATH 1127

Major Content Areas
Logic and Proof.

Mathematical Induction.

Elementary Set Theory.

Relations and Functions.

Recurrence Relations.

Elementary Number Theory and applications.

Elementary Graph Theory and applications.

Combinations and Permutations.

Algorithm Analysis.

Trees.

Learning Outcomes
Perform computations using recursively defined functions and structures.

Solve problems involving sets, relations, functions, and congruences.

Illustrate the basic terminology and properties of graphs and trees.

Use graphs and trees to solve problems algorithmically.

Describe how symbolic logic can be used to model real-life situations or applications, including those arising in computing contexts.

Examine the logical validity of arguments and proofs as they apply to Boolean expressions.

Apply mathematical induction and other techniques to prove mathematical results.

Use methods of combinatorics to solve counting and basic probability problems.

Minnesota Transfer Curriculum (MNTC) Goals
04 - Mathematical/Logical Reasoning

02 - Critical Thinking