 |
MATH114
- 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 (MATH120 or 124) or CSCI120. Mr. Green, Mr. Joyce/Offered every semester
Faculty
Frederic Green, Ph.D. - Professor and Chair, Department of Mathematics
and Computer Science
David Joyce, Ph.D. - Professor of Mathematics
|
