MATH 250 - Discrete Mathematics

Lecture Hour(s): 3
Lab Hour(s): 0
Credit Hour(s): 3

Treats a variety of themes in discrete mathematics: logic and proof, to develop students’ ability to think abstractly; induction and recursion, the use of smaller cases to solve larger cases of problems; combinatorics, mathematics of counting and arranging objects; algorithms and their analysis, the sequence of instructions; discrete structures, e.g., graphs, trees, sets; and mathematical models, applying one theory to many different problems. Fall

Prerequisite(s): MATH 109 and MATH 110 or GNET 116.