Discrete Mathematics for Computer Science.

An introduction to discrete mathematics for those incoming Computer Science master's degree students who do not have an undergraduate background in discrete mathematics. Topics include elementary set theory, elements of abstract algebra, propositional calculus, and Boolean algebra, proofs, mathematical induction, combinatorics, graphs, and discrete probability theory. (Students may not receive credit for both MATH 601 and either MATH 220 or CSCI 221, or an equivalent course in discrete mathematics. MATH 601 cannot be counted toward an undergraduate major in mathematics or a master's degree in mathematics.)