CSC217: Discrete Mathematics
Spring
2004
with Computer Science Applications
Links: Course schedule and assignments Computer Science Home
Welcome to the CSC217 home page. It contains some important information about the course.
Instructor and Office hours
Lonnie Fairchild
Redcay 147
564-2783 lonnie.fairchild@plattsburgh.edu
Office hours: Mon. 2:30-3:30, Tues. 1:30-2:45, Wed.
2:30-3:30,
Thurs. 1:30 - 2:45
Fri. 1-2 (usually)
These times
will not be convenient for everyone.
Students
are welcome (and encouraged!) to make appointments for other times, or to ask to
talk
with me if you see me in my office.
Meeting Times and Places
Mon., Wed., Fri. 9 -
9:50 Hawkins 141 (lectures and discussion)
Wed., 4:30 - 5:45
Hawkins 144 (Problem session -- required)
Course Description
An introduction
to discrete mathematics with a focus on methods of reasoning and applications to
computer science. Topics: propositional logic, first order logic, methods of proof,
mathematical induction, elementary number theory. Applications include digital circuits, computer arithmetic,
computer algorithms.
Overall, including classes, the problem session, and
homework, this course should require about 9 hours per week of your time.
Prerequisite: MAT102 (Precalculus) or an equivalent high school course.
Required Textbook: Susanna S. Epp, Discrete Mathematics with Applications, 3rd edition, Brooks Cole Publishing Co., 2004
| Class tests (2) -- on 2/25, and 4/9 | 30 % | |
| Final Test (during finals week) | 20 % | |
| Quizzes and homeworks | 40 % | |
| Class participation | 10 % |
Tests: There will be two in-class tests and a final exam. The second test will cover all the course material covered after the first test. The final exam will be cumulative but will emphasize the material covered after the second test. Notes and books cannot be used on tests and quizzes.
Quizzes: Because of the sequential nature of the material in this course, it is important that both the students and the instructor be aware of how well the material covered so far has been mastered. Hence, there will be a very short quiz in almost every class. These will cover material discussed in class within the past week and assigned homework exercises. Occasionally, the quiz will consist of handing in a homework exercise. Quizzes will be given at different times during the class, depending on what fits in with the material being covered that day. The lowest three quiz grades will be dropped.
Homework exercises: These will be assigned in class on a daily basis. You should write your solutions in a clear readable form and keep them in a loose-leaf notebook which you bring to class.
Problem sessions: These will be used for working on assigned exercises or substitute problems or activities that can provide extra challenges. All students will be expected to attend problem sessions. However, students who finish early will be free to leave.
Attendance Policy and Academic Responsibility: Students are
expected to attend all classes and problem sessions, come prepared, and get there on time.
If an unavoidable emergency comes up and you must miss a class, you should let me know
(phone or email) as soon as possible. Unless the emergency is terrible, this must be
before the class.
All work submitted on tests
and assignments is to be your own. Cooperative study and mutual aid are healthy learning
methods and are strongly recommended. Plagiarism is copying someone's work
and presenting it as yours or allowing someone else to do the same with your work.
If you work on exercises with other students or get help on problems (during
problem sessions or office hours) you should write up the solutions yourself and be sure
you understand them. Assignments that appear to be merely copied will not be
accepted. A test or quiz that shows evidence of plagiarism will result in a grade of
0, and the course grade will be lowered by one full letter grade. A second instance of
copying on a test or quiz will result in a grade of E in the course.
01/25/04