| |
Apr 04, 2026
|
|
|
|
|
MATH 5050 - Applied Discrete Mathematics
Course in discrete mathematical structures and their applications with an introduction to methods of proofs. The main topics are induction and recursion, counting techniques, graph theory and algorithms. Applications may include discrete and network optimization, discrete probability and algorithmic efficiency.
Requisites: No credit for both this course and CS 5000D (first taken deducted).
Credit Hours: 3
Repeat/Retake Information: May not be retaken.
Lecture/Lab Hours: 3.0 lecture
Grades: Eligible Grades: A-F,WP,WF,WN,FN,AU,I
Learning Outcomes:
- Students will be able to apply induction for proving properties of discrete structures.
- Students will be able to count or enumerate objects, perform combinatorial analysis to solve counting problems.
- Students will be able to use discrete structures in application areas like computer science, optimization, probability.
- Students will be able to analyze properties of graphs and trees and be able to use graphs as models in a variety of areas.
- Students will be to apply problem solving strategies to make sense of and solve non-routine problems in combinatorics, computer science, optimization, graph theory, and probability
- Students will be able to derive essential combinatorial formulas.
- Students will be able to prove graph theory properties.
- Students will be able to apply advanced modeling techniques in application areas such as optimization, probability, computer science.
Add to Portfolio (opens a new window)
|
|
