[WesMaps 98/99 Home Page]
[Course Search]
[Course Search by CID]
MATH228
Discrete Mathematics
MATH228 SP
| Section | Class Size | *Available | Times | POI | Prereq |
|---|
| 1 | 30 | 0 | Times: M.W.... 1:10PM-2:30PM; | No | Yes |
*The number of spaces listed as available is based on class seats open for
the Blue Add phase of registration. Some seats may be taken in previous
phases while others may be held out for subsequent phases of registration.
(Last Updated on Tue Aug 10 05:00:21 EDT 1999
)
This course is an introduction to discrete ("combinatorial")
mathematical processes. Topics will include an introduction
to some of the following: Mathematical induction, with
applications; set theory; number theory; combinations and
permutations; probability theory (with Bayes' theorem);
generating functions.
MAJOR READINGS
EXAMINATIONS AND ASSIGNMENTS
Two or three hour exams, 1
three-hour final exam; frequent homework.
ADDITIONAL REQUIREMENTS and/or COMMENTS
This course has
both a strong computational, "applied" flavor and a rigorous
"theoretical" component: certain theorems are proved
carefully and are then invoked to achieve concrete numerical
results. This course is intended to help provide a secure
foundation for the study of both mathematics and computer
science.
COURSE FORMAT: Discussion Lecture
REGISTRATION INFORMATION
Level: UG Credit: 1.00
Gen Ed Area & Dept: NSM MATH
Prerequisites:
MATH221 or MATH223
- Section 01
- Reid, J
- Times: M.W.... 1:10PM- 2:30PM;
- Grading Mode: A/F
- Registration Preference (1 high to 6 low, 0=Excluded) Sr: 1, Jr: 1, So: 1, Fr: 1
- No Major Preference Given
Last Updated on MAR-22-1999
Contact wesmaps@wesleyan.edu to
submit comments or suggestions.
Copyright Wesleyan University, Middletown, Connecticut, 06459