Operations, cardinality, combinatorics, boolean algebra and logic gates, simplification of logic circuits, normal forms. Equivalence relations, partitions, partial orderings, lattices, inverse functions, composition, recursion and iteration. Semigroups, groups, rings, Boolean algebras and isomorphisms. Trees, directed graphs, colorings, algorithms for traversing graphs. Modelling phenomena, automata theory, historical topics.
Regular assignments are a component in determining the course grade.
The course typically has three to four examinations and a comprehensive final examination. Students frequently use a mathematics software package on their homework. A sophomore level discrete mathematics text is used. Hirschfelder and Hirschfelder. Introduction to Discrete Mathematics.