MATH 2305 - Discrete Mathematics

Credit Hours: 3
Contact Hours - Lecture: 3
A course designed to prepare math, computer science, and engineering majors for a background in abstraction, notation, and critical thinking for the mathematics most directly related to computer science. Topics include: logic, relations, functions, basic set theory, countability and counting arguments, proof techniques, mathematical induction, combinatorics, discrete probability, recursion, sequence and recurrence, elementary number theory, graph theory, and mathematical proof techniques. CIP Code: (2701016619)
Prerequisite: MATH 2413
Student Learning Outcomes
1 - Construct mathematical arguments using logical connectives and quantifiers. 2 - Verify the correctness of an argument using propositional and predicate logic and truth tables. 3 - Demonstrate the ability to solve problems using counting techniques and combinatorics in the context of discrete probability. 4 - Solve problems involving recurrence relations and generating functions. 5 - Use graphs and trees as tools to visualize and simplify situations. 6 - Perform operations on discrete structures such as sets, functions, relations, and sequences. 7 - Construct proofs using direct proof, proof by contraposition, proof by contradiction, proof by cases, and mathematical induction. 8 - Apply algorithms and use definitions to solve problems to prove statements in elementary number theory.