4 credit(s) Prerequisite(s): MTH 174 or equivalent. Presents topics in discrete mathematical structures which are basic tools used in computer science. Covers sets, Boolean algebra, counting methods, generating functions and recurrence relations, graph theory, trees, and an introduction to finite state automata. Designed for mathematical, physical, and engineering science programs. Lecture 4 hours per week.