MA240 DISCRETE MATHEMATICS (4 cr.)
CS120 and MA103 or equivalent.
This course covers the mathematical foundations of computer science. The goal
is to make students comfortable with formal systems, data structures, abstract
models, and analysis of problems and algorithms, so that they can apply these
intellectual tools in later CS courses.
Topics covered can include propositional and predicate
logic, sets, binary numbers, proof techniques, graph theory, permutations,
combinations, models of computation, automata theory, regular expressions, and
the use of logic for circuit design.
Learn, and become comfortable with, the range of discrete mathematical
structures that are fundamental to the further study and application of
computation. Acquire the conceptual tools for modeling real-world
situations as abstract problems amenable to computational solution.