[WesMaps 98/99 Home Page]
[Course Search]
[Course Search by CID]
MATH228
Discrete Mathematics
MATH228 FA
Not Currently Offered
An introduction to discrete/combinatorial mathematics, and
to abstraction, theorems and proofs. This is a mathematics
course, not a computer science (or any other kind of
science) course. We will be concerned with (1) why, not just
how, (2) theorems and proofs, not calculations or just
algorithms, and (3) how to read, write, and do mathematics.
Topics may include mathematical induction, set theory,
number theory, and various forms of counting.
MAJOR READINGS
CONCRETE MATHEMATICS, A FOUNDATION FOR
COMPUTER SCIENCE, by R. Graham, D. Knuth, and O. Patashnik,
Addison-Wesley.
EXAMINATIONS AND ASSIGNMENTS
Two or three hour exams, 1
three-hour final exam; frequent homework.
ADDITIONAL REQUIREMENTS and/or COMMENTS
The emphasis in the
title of the textbook should be on the word MATHEMATICS, not
on the clause after the comma. That clause means "SOME
(repeat SOME) of the MATHEMATICS (repeat MATHEMATICS) used
in the study of Computer Science".
PREREQUISITES: Willingness to accept and use abstraction in
mathematics.
COURSE FORMAT: Discussion Lecture
REGISTRATION INFORMATION
Level: UG Credit: 1.00
Gen Ed Area & Dept: NSM MATH
Prerequisites:
None
Last Updated on MAR-22-1999
Contact wesmaps@wesleyan.edu to
submit comments or suggestions.
Copyright Wesleyan University, Middletown, Connecticut, 06459