MTH 232 Elements of Discrete Math

The second course in discrete mathematics for mathematics and computer science majors. Topics include basic matrix linear algebra, combinatorics, graph theory and algorithms.

Credits

4

Prerequisite

Prerequisite: MTH 231 Elements of Discrete Mathematics with a grade of C or better.

Offered

Offered Spring only

Notes

Lower Division Transfer (LDT) Course

General Education Requirements

AS Math, AGS Math/Science, AAS Math/Computation, AAOT Math, AAOT Science/Math Non Lab,

Outcomes

Upon successful completion of this course, students will be able to:
Use a combinatorial approach to enumerate the members of a set. Apply the appropriate graph theoretical techniques to solve several different types of problems, including networking and routing problems. Connect the concept of Boolean algebra to physical logic networks. Follow classical algorithms to their conclusion and evaluate the order of each algorithm. Recognize the use of recursion in algorithms.