Discrete Mathematics
MET CS 248
Fundamentals of logic (the laws of logic, rules of inferences, quantifiers, proofs of theorems), Fundamental principles of counting (permutations, combinations), set theory, relations and functions, graphs, trees and sorting, shortest path and minimal spanning trees algorithms. Monoids and Groups.
Note that this information may change at any time. Please visit the Student Link for the most up-to-date course information.

