Course Descriptions

Course Number: MTH 254

Course Name: Discrete Mathematics & Applications

Number of Credit Hours: 3 Credits

Prerequisite(s): MTH 103 

Corequisite(s): N/A

Course Description: 

This course first provides students with knowledge of logic, proofs, sets, relations, and counting methods, which are essentially the basis of Computer Science. Extra focus will be placed on counting method topics of Pigeonhole principle, permutations, combinations, binominal coefficients and Pascal triangle. The course will then move to more advanced topics of graph theory and Boolean algebra with the emphasis on directed and undirected graphs, Euler and Hamilton paths, shortest-path problems, minimum-cost spanning tree, Boolean functions, and logic gates.