Math/CS 320L - Applied Discrete Mathematics

Credits: 3

Course Description: 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 and informal theories and corresponding mathematical proofs are taught.

Pre-Requisites:CS110 and MATH 260; or permission of instructor.

Frequency: This course is offered as demand requires.

Current Textbook:
A Short Course in Discrete Mathematics by Edward A. Bender and S. Gill Williamson, Dover, 2005, ISBN: 0486439461
(parts of) Foundations of Combinatorics with Applications, by the same authors (ISBN: 0486446034).
Note: free downloads of both texts are available on the authors' web sites. Check with your instructor to make sure this is the textbook used for your section.

Fall 2008 Schedule:

Section	Meeting Time	Instructor
1	TuTh 4:00pm-5:15pm	Ethan Bolker

Topics

The order of presentation of the contents of this syllabus, exams, and grading policies are entirely at the discretion of the individual instructor.

Questions and suggestions regarding this page should be addressed to the Department Chair or to the Webmaster.
Page last modified: September 5, 2008			Department of Mathematics University of Massachusetts Boston Phone: 617-287-6460; Fax: 617-287-6433 Information: Webmaster: