John Travis
MCC 206
925-3817 (voice mail)
travis@mc.edu (email)
Projects
| Textbook
| Notes
| Course Description | Course
Meetings | Grading
Textbook: Discrete Mathematics, 5th edition, Dossey, et al
Prerequisites: MAT 122 or instructor's consent
Course Outline: An introduction to discrete mathematics including induction and recursion, algorithms, relations, partial ordering, graphs, directed graphs and trees. Applications will include Euler and Hamilton paths and minimal spanning trees.
Course Goals:
At the conclusion of the course, the successful
student should be able to:
Meetings:
The method of instruction will include lecture, group problem solving,
individual problem solving and examinations. Each student is expected
to have a copy of the text, writing materials, a calculator and an open
mind. On tests and individual out-of-class projects, the work is
assumed to be performed only by the student. Cheating will be addressed
according to University Policy.
This class meets as scheduled. You are expected to be in class on time. University policy states that a student cannot miss more than 25% of the class meetings and receive credit for the course. Further, attendance will be necessary in order to understand the material and make a good grade. The student is responsible for work and material missed when absent.
Grading: There will be several examinations during the semester--generally one per chapter. Also, selected homework and some writing project(s) will be assigned and graded. An average of the homework and written work will count as one exam grade. These exam grades will be averaged equally to determine the final grade. The Grading scale is :