| |
Mar 07, 2026
|
|
|
|
|
MATH 2305 - Discrete Mathematics
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.
Learning Outcomes: Upon successful completion, students will be able to:
- construct mathematical arguments using logical connectives and quantifiers;
- verify the correctness of an argument using propositional and predicate logic and truth tables;
- demonstrate the ability to solve problems using counting techniques and combinatorics in the context of discrete probability;
- solve problems involving recurrence relations and generating functions;
- use graphs and trees as tools to visualize and simplify situations;
- perform operations on discrete structures such as sets, functions, relations, and sequences;
- construct proofs using direct proof, proof by contraposition, proof by contradiction, proof by cases, and mathematical induction;
- apply algorithms and use definitions to solve problems to prove statements in elementary number theory
Credit Hour(s): 3
Lecture Hour(s): 48
Prerequisite(s): MATH 2413 - Calculus I with a grade of C or better
Add to Portfolio (opens a new window)
|
|
