Math 114 (Discrete Mathematics) / Lecture
Covers mathematical structures that naturally arise in computer science. Includes elementary logic and set theory, equivalence relations, functions, counting arguments, asymptotic complexity, inductively defined sets, recursion, graphs and trees, Boolean algebra and combinatorial circuits, finite state automata, and diagonalization and countability arguments. Emphasizes proofs and problem solving. Prerequisite: One semester of calculus (Math 120 or Math 124) or CSci 101.