Course Information
- Instructor: Dr. Aaron Garrett (garrettal@wofford.edu)
- Class Meeting (Olin 213): TR 2:30p-3:50p
- Office Hours (Olin 111A): MW 10:00a-11:30a, 2:00p-3:30p; TR 12:30p-2:30p; or by appointment
- Reference: Discrete Mathematics for Computing by Peter Grossman
- Final Exam: See the Registrar’s page
Catalog Description
A study of concepts foundational to computer science: sets, logic, the nature of proof, functions, algorithms, relations, lattices, and graphs.
Prerequisite: COSC 235 with a minimum grade of D and (MATH 140 with a minimum grade of D or MATH 181 with a minimum grade of D).
Goals
- Learn how to interpret mathematical language and symbols properly, and how to communicate mathematical ideas effectively.
- Learn the logic of mathematical arguments, different ways to prove a statement, and how to construct proofs.
- Develop the ability to think recursively, and how to justify recursive procedures using mathematical induction.
- Develop functional programming abilities in Standard ML.
- Learn fundamental combinatorial concepts such as sets, propositional logic, relations, counting, bijections, permutations, graphs, and trees.
Grades
Your grade in the course will be based on a combination of assignments and exams.
- Assignments
- Assignments are exercises that reinforce the core concepts.
- Exams
- Exams are timed assessments of conceptual understanding.
| Artifact | Points |
|---|---|
| Assignments | 12 |
| Quizzes | 8 |
| Exam 1 | 25 |
| Exam 2 | 25 |
| Final Exam | 30 |
| Total | 100 |
The usual grading scale will be applied to the accumulated percentage: 93–100: A, 90–92: A-, 87–89: B+, 83–86: B, 80–82: B-, 77–79: C+, 73–76: C, 70–72: C-, 60–69: D, 0–59: F.
Policies
Attendance
You are expected to attend class meetings and come to class prepared. That includes having completed assigned readings, problem sets, and tutorials.
You are expected to dedicate your attention to what is going on in class and to participate fully in classroom activities, including discussions. No laptops or tablets are to be used in class unless being used for a classroom exercise. (Notes may be taken using a device if needed as an approved accommodation.)
Refer to the General Policy Regarding Attendance in the Wofford College Student Handbook. The policy makes you responsible for catching up on missed classes. If you must be absent for class, please email me in advance to let me know.
Make-up exams are not available. If you have a legitimate, excused absence during the midterm exam, then you must make it up during the final exam period.
Assignment Deadlines
Late assignments will not be accepted without a legitimate excuse. All assignments are expected to be submitted by the posted deadline.
Academic Integrity
The Honor Code requires faculty, staff, and students to maintain a high standard of individual honor and integrity. While I may specify some assignments as collaborative, work represented as your own must be your own. If you have any doubt about what is appropriate for a given assignment, you should contact me for clarification.
Accommodations
If you have a disability that requires assistance or accommodation, or if you have questions related to any accommodations for testing, note takers, readers, etc., please contact Dean Beth Wallace by telephone at (864) 597-4371 or in person by visiting the Hugh R. Black Infirmary. You must arrange accommodations during the first week of classes.
Tentative Schedule
This YouTube series may be useful for you as we go through the material.
| TR | Topic | Deadline | |
|---|---|---|---|
| Sep | 3 | Introduction | |
| 8 | Numeric Representations | ||
| 10 | Bases | ||
| 15 | Computer Arithmetic - Integer | ||
| 17 | Computer Arithmetic - Float | ||
| 22 | Logic - Propositional | ||
| 24 | Logic - Predecate | ||
| 29 | Q1 | ||
| Oct | 1 | Exam 1 | A1 |
| 6 | Sets/Relations | ||
| 8 | Functions | ||
| 13 | Induction | ||
| 15 | Recursion | ||
| 20 | Boolean Algebra/Digital Circuits | ||
| 27 | Q2 | ||
| 29 | Exam 2 | A2 | |
| Nov | 3 | Combinatorics | |
| 5 | Combinatorics | ||
| 10 | Graph Theory | ||
| 12 | Trees | ||
| 17 | Q3 | ||
| 19 | Number Theory | ||
| Dec | 1 | ||
| 3 | Computational Complexity | ||
| 8 | Q4 | ||
| 10 | A3 |
Note: This syllabus is subject to change with notice.