Introduction to the logical and mathematical foundations of computer science. Topics include functions, relations, and sets; recursion and functional programming; elementary logic; and mathematical induction and other proof techniques. Prerequisite: AMS 151 or MAT 125 or MAT 131
Discrete Mathematics: Introduction to Mathematical Reasoning (brief edition), 1st edition by Susanna S. Epp. Cengage Learning, 2011, ISBN 978-0495826170.
The graduate students listed below are responsible for grading the homework assignments. Please direct any and all homework grading concerns to your TA.
All office hours are held in Computer Science 2217 except where noted.
There will be one midterm examination and a cumulative final examination. Exams are open book and open notes. However, no access to electronic devices will be permitted during exams.
Students will be assigned apporximately seven written problem sets for homework, which must be completed independently. Offering or accepting solutions from others is an act of plagiarism, which is a serious offense. All parties involved in academically dishonest behavior will be penalized according to the Academic Integrity Policy provided below.
Late submissions will not be accepted. No extensions will be granted.
Homework assignments must be completed in the LaTeX language that can be compiled into a PDF. Students will largely be responsible for learning LaTeX on their own, but the instructor will spend some time during the first week of the course teaching the basics. You can also use a PDF writer however this is strongly discouraged.
Grades will be posted on Blackboard.
Due to possible variation in how strictly the grading TAs will grade their students' homework submissions, homework grades will be normalized to a common, course-wide scale before being used in computing final course grades.
| Week | Lecture Topics |
|---|---|
| 1 | Course Introduction; Propositional Logic |
| 2 | Propositional Logic |
| 3 | Predicate Logic |
| 4 | Direct Proofs |
| 5 | Indirect Proofs |
| 6 | Midterm Exam |
| 7 | Sequences; Mathematical Induction |
| 8 | Spring Break |
| 9 | Mathematical Induction; Recurrences |
| 10 | Set Theory |
| 11 | Set Theory |
| 12 | Functions |
| 13 | Functions |
| 14 | Relations |
| 15 | Modular Arithmetic |
| 16 | Final Exam |
The College of Engineering and Applied Sciences (CEAS) offers a range of free tutoring services for students in CSE, AMS and other courses. See the CEAS Undergraduate Student Office website for more information. For small group and one-on-one tutoring please inquire also at the Academic Success and Tutoring Center.
Note: If you have a physical, psychological, medical or learning disability that may impact on your ability to carry out assigned course work, please contact the staff in the Disabled Student Services office (DSS), Room 133, Humanities, 632-6748v/TDD. DSS will review your concerns and determine with you what accommodations are necessary and appropriate. All information and documentation of disability are confidential.
Note: Each student must pursue his or her academic goals honestly and be personally accountable for all submitted work. Representing another person's work as your own is always wrong. Any suspected instance of academic dishonesty will be reported to the Academic Judiciary. For more comprehensive information on academic integrity, including categories of academic dishonesty, please refer to the academic judiciary website at http://www.stonybrook.edu/uaa/academicjudiciary/.