MATH170G
4
4
Discrete mathematics describes processes that consist of a sequence of individual steps and is based on the ideas underlying the science and technology of the computer age. The main themes of this course are: logic and proof: induction and recursion; discrete structures such as number sets, general sets, Boolean algebras, functions, relations, graphs, trees, regular expressions and finite-state automata; combinatorics and discrete probability; algorithms and their analysis; and applications and modeling.
Prerequisite: Successful completion of MATH150G or MATH152G (with a C or better), or placement testing as determined by the math department, or by permission of the math department chair. All semesters
