Discrete Math for Computer Science

An introduction to the theory and applications of discrete mathematics including set theory, functions, zero- and first-order logic, induction, proofs (including direct, by cases, contraposition, contradiction, counterexample), logical inferences, truth tables, sequences, summations, formal counting techniques, number theory, growth of functions and their asymptotic bounds, logarithms, and simple recurrence relations. Sample computer-programming topics include design; pseudocode; sorting, searching and other common algorithms; recursion; tracing; debugging; testing; trees; strings; encryption; and bitwise operations. This course provides foundation material for other courses that require mathematical problem-solving skills.

UG - Undergraduate

N - Course May Not Be Repeated