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

Course 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.

Prerequisite Courses

Additional Information

This course fulfills the following GE requirements: AAOT Science/Math Non-Lab, AS Math, AAS Math/Computation, AGS Math/Science, AAOT Math