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, and modeling. Specific topics include logic, sets, functions, relations, algorithms, proof techniques, counting, graphs, trees, and Boolean algebra.
A graphing calculator is required. The instructor will provide more information on the required materials for the course.
Prerequisite
MAT171 Minimum Grade of: C or
MAT251 Minimum Grade of: C
Attributes
Free Elective
Liberal Arts Elective
Math Elective