###
What is Discrete Mathematics?

One answer: it's the mathematics
a computer scientist needs to understand computing
better, and that a mathematician needs to understand some of the
foundations of contemporary mathematics and the important influence of
computer science on the discipline.
That's why the course is cross listed in both the Mathematics and
Computer Science departments.

Another answer: some logic, some set theory, some
combinatorics, some probability theory, some number theory, a few
discrete mathematical
structures (partially ordered sets, trees, ...), and the tools for
investigating those ideas - examples, experiments, algorithms, proofs.

(For an answer to a more general question I recommend the famous
What is Mathematics? by
Richard
Courant and Herbert Robbins.
Too bad it's not an appropriate text for this course.)

###
Official course description

Here is the course description from the
web page
maintained by the
Computer Science Department:

An introduction to the mathematical structures and concepts used in
computing: sets, mathematical induction, ordered sets, boolean
algebras, predicate calculus, trees, relations and lattice theory,
formal theory of languages and automata theory. Formal and informal
theories and corresponding mathematical proofs are taught.

### Prerequisites

(
CS 110 and
Math 260) or permission of the instructor.
### When and where

Tuesday and Thursday 2:00-3:15, McCormack M01-0207