MAT255 Discrete Math

This course covers the mathematical concepts essential for continued study in computer science and related fields. The topics include algorithms, complexity of algorithms, introduction to number theory, mathematical induction and recursion, mathematical reasoning, combinatorial analysis, discrete structures, modeling. Specific topics include logic, sets, functions, relations, algorithms, proof techniques, counting, graphs, trees, and Boolean algebra.

Credit Hours

Lecture Hours

Prerequisite

MAT171 Calculus for Business/Social/Life Sciences: Minimum Grade of C OR MAT251 Calculus I: Minimum Grade of C

Attributes

Free Elective
Liberal Arts Elective
Math Elective