This course is meant as a first introduction to discrete mathematics with emphasis on its use in computer science. Topics include: Propositional and Predicate Logic, Proof Techniques, Sequences, Mathematical Induction, Set Theory, Functions and Relations, and Counting and Probability.

To provide students with the mathematical foundation, level of abstract thinking, and knowledge of discrete mathematics topics essential to computer science.

This course is aimed in general at freshman and sophomore students in science and engineering, and in particular at freshman students in computer science and sophomore students in computer engineering. The prerequisites are: CS53 or at least sophomore standing.

**Academic Alert System**

The purpose of the Academic Alert System
is to improve the overall academic success of students by improving
communication among students, instructors and advisors; reducing the time
required for students to be informed of their academic status; and informing
students of actions necessary by them in order to meet the academic
requirements in their courses.

**Disabilities**

If you have a documented disability and anticipate needing accommodations in
this course, you are strongly encouraged to meet with the instructor as early
as possible in the semester. You will need to request that the Disability Support Services staff send a letter
to the instructor verifying your disability and specifying the accommodation
you will need before the instructor can arrange your accommodation. Disability
Support Services is located in 204 Norwood Hall, their phone number is
341-4211, and their E-mail is dss@mst.edu.

**Academic Dishonesty**

Every student enrolled in this course is expected to
be familiar with Missouri
S&T's Student Academic Regulations, including the section on *Conduct
of Students* which on pages 30-31 defines several forms of *Academic
Dishonesty* such as *cheating*, *plagiarism*, and *sabotage*.
Incidences of Academic Dishonesty will typically result in zero grades for the
respective course components, notification of the student's advisor, the
student's department chair, and the campus undergraduate studies office, and
further academic sanctions may be imposed as well in accordance with the
regulations. Note that those who allow others to copy their work are just as
guilty of plagiarism and will be treated in the same manner.

**Attendance**

Attendance is critical to succeeding in this course. While you will not be dropped for non-attendance, the lectures will help you understand the course content and frequent in-class quizzes are worth 10%
of your grade.

**Makeups & Extensions**

There will be no makeups; however, your worst quizz, your worst homework grade, and your worst exam grade will be dropped, effectively allowing
you to miss one homework, one quizz, and one exam, without penalizing your grade. It is in your best interest to avoid this at all costs;
it is meant for special situations like serious illness, death in family, etc.

**Exams**

There will be approximately 9 exams during the semester and one comprehensive final exam
during finals week which counts double. The cumulative exam grade will
be determined as follows:

*Max((Sum of exams)/9,((Sum of exams)+2*Final-Min(Sum of exams))/10)*

This means that students happy with their grade at the end of the semester can
skip taking the comprehensive final exam, but it also means that taking the
final exam can only improve your grade, never lower it.

**Homework**

Homework is always due before the end of class and must be submitted in person
on paper and be legible. If you are too ill to submit it in person, then you
may submit it via Blackboard as long as the timestamp is before the end of class.
Late homework will not be accepted.
Handwriting your homework is permissible, but typeset preferred. LaTeX
is recommended for typesetting. Note: to receive full credit you have to show all
your work, answers only may result in zero credit.

**Instructor Information**

Section 1A | |
---|---|

Name | Gerry Howser |

Office | 305 Computer Science Building |

Office hours | As in the syllabus, by appointment, or according to the following "open door" policy: if the instructor's office door is wide open, you are welcome to drop by; if the instructor's office door is only slightly ajar, only knock in case of an important, time-critical circumstance; finally, if the door is closed, knock only in case of an absolute emergency. |

gwhrkb@mst.edu | |

WWW | http://web.mst.edu/~gwhrkb/index.html |

**Course Information**

Required textbook | Susanna S. Epp, Discrete Mathematics with Applications, Fourth Edition, Brooks/Cole, ISBN-13: 978-0-495-39132-6 [Companion website] |

Recommended textbook | Susanna S. Epp, Student Solutions Manual and Study Guide for the Fourth Edition of Discrete Mathematics with Applications, Brooks/Cole, ISBN-13: 978-0-495-82613-2 |

Course website | http://web.mst.edu/~gwhrkb/classes/cs128Spring2014/index.html |

Lecture times | Monday, Wednesday, Friday 9:00 - 9:50 am |

Lecture venue | Section 1A: 207 Computer Science Building [Egress map (emergency exit route)] |

Course Schedule | Dynamic schedule |

**Grading Information**

Exams (about 9 during semester + 1 comprehensive final) | Exams 50 points each, Final 100 points |

Homework | Lowest dropped |

Quizzes | Unannounced |

Final grade for undergraduate students | [90-100]: A, [80-90>: B, [70-80>: C, [60-70>: D, <60: F |

Final grade for graduate students | [90-100]: A, [80-90>: B, [70-80>: C, <70: F |

Updated: January 20, 2014