This course is an introduction to discrete mathematics, emphasizing proof and abstraction, as well as applications to the computational sciences. Topics include sets, relations, and functions, graphs and trees, algorithms, proof techniques, and order of magnitude analysis, Boolean algebra and combinatorial circuits, formal logic and languages, automata, and combinatorics, probability, and statistics. Co-requisite OR Pre-requisite: MATH-SHU 131 or MATH-SHU 201. Equivalent to MATH-UA 120. Fulfillment: MATH Additional Mathematics Electives, CS Required, Data Science Concentration in CS.