MTH-2500 - Introduction to Discrete Math* (3)

Prerequisite: MTH-1200
This course is designed to prepare math, computer science, data 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, graph theory, combinatorics, discrete probability, recurrence relations, and elementary number theory.

List Course Outcomes (consistent for all sections)
CO1 - Construct mathematical arguments using logical connectives and quantifiers.

CO2 - Verify the correctness of an argument using symbolic logic and truth tables.

CO3 - Construct proofs using direct proof, proof by contradiction, and proof by cases, or mathematical induction.

CO4 - Solve problems using counting techniques and combinatorics.

CO5 - Perform operations on discrete structures such as sets, functions, relations or sequences.

CO6 - Construct functions and apply counting techniques on sets in the context of discrete probability.

CO7 - Apply algorithms and use definitions to solve problems to proof statements in elementary number theory.

View Course Sections