MATH 114 - Discrete Mathematics

Type of Course: 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.

Prerequisites: One semester of calculus (MATH 120  or MATH 124 ) or CSCI 120 .


This course information is from the 2011-2012 Academic Catalog. View this catalog.
Print this page.