| |
Jun 23, 2024
|
|
|
|
|
MATH 3050 - Discrete Mathematics
Course in discrete mathematical structures and their applications with an introduction to methods of proofs. The main topics are introductions to logic and elementary set theory, basic number theory, induction and recursion, counting techniques, graph theory and algorithms. Applications may include discrete and network optimization, discrete probability and algorithmic efficiency. No credit for both this course and CS 3000 (first taken deducted).
Requisites: C or better in MATH 2301 or MATH 263B and WARNING: No credit for both this course and CS 3000 (first course taken deducted)
Credit Hours: 3
Repeat/Retake Information: May be retaken two times excluding withdrawals, but only last course taken counts.
Lecture/Lab Hours: 3.0 lecture
Grades: Eligible Grades: A-F,WP,WF,WN,FN,AU,I
Learning Outcomes: - Able to apply induction for proving properties of discrete structures.
- Able to count or enumerate objects, perform combinatorial analysis to solve counting problems.
- Able to use discrete structures in application areas like computer science, optimization, probability.
- Able to use set notation and logical statements correctly in the above contexts.
- Able to use standard proof methods in the context of simple problems in elementary number theory.
- Understands the mathematics of graphs and trees, and how to use graphs as models in a variety of areas.
Add to Portfolio (opens a new window)
|
|
