Discrete Mathematics

Catalog description

A study of discrete mathematical structures such as sets, permutations, relations, graphs, and finite state machines as well as a variety of mathematics used to study these structures including recursion, induction, counting, algorithms, and finite calculus (difference equations). This course is especially recommended for those whose major or minor is either information systems, computer science or cybersecurity. Offered fall term each year. Three semester hours.