CS 201: Mathematics for Computer Science

Syllabus

Class Meetings

Monday, Wednesday and Friday 10:00 to 10:50 am in Glatfelter 301.

Instructor(s)

Instructor:	Dr. Clifton Presser
Office:	Glatfelter Hall 210
Phone:	(717) 337-6639
Email:	cpresser@gettysburg.edu
Office Hours:	Monday: 12:30 pm to 1:30 pm ~~1 pm to 2pm~~ Tuesday: 10 am to 11:20 am Wednesday: 12:30 pm to 1:30 pm ~~1 pm to 2pm~~ Thursday: 10 am to 11:20 am and by appointment. I will hold office hours in a drop-in ZOOM session. The URL is available on Moodle.

Considerations for COVID 19

I intend to be as flexible as possible with respect to COVID 19 related events and incidents.

Communicate! Let me know if there are problems. Check your email frequently.
Wear a mask in class. Have a spare on hand in case it breaks.
Do not come to class sick. Attend virtually if you are feeling unwell, or watch the class recordings.
We will do our best to maintain 6 feet of physical distance between everyone at all times.
If you are quarantined or isolated, you may attend class virtually using the ZOOM link in Moodle.
Class meetings will be recorded on ZOOM. In accordance with College policy you may not make copies or distribute the video lectures, or links to the video lectures in anyway.
Although lectures are being record, the general expectation is that you are in class or in ZOOM during class.
If I am quarantined, isolated or ill, I will not come to class. If I am physically able, I will hold class on ZOOM.
If I become sick enough that I am unable to hold class, someone will notify you via email of the alternate plans.
If you are unable to attend or complete any requirements, please let me know as soon as your are able.
Office hours will be held by ZOOM.
Be helpful and patient with each other and your instructors. We are all living in this weird time too.

If at some point the College moves entirely online, we will meet virtually. You will still be expected to complete projects and assignments.

Streaming and Recording of Course Lectures & Discussions: Because of COVID-19, the College has installed cameras in classrooms to support students participating remotely in classes. We have made this decision because not every student will be present in the classroom this semester, and therefore, we think it equally important to advise you that class content, including discussions, may be streamed and/or recorded during this academic year. If you have questions or concerns, please discuss this with your course instructor.

Class web site

You are responsible for checking the class web site regularly. Announcements and assignments will be posted on the Moodle course management system.

Prerequisites

CS 111 or CS107, and Math 111 or equivalent

Gettysburg Curricular Goals

This course satisfies the Quantitative, Inductive and Deductive Reasoning goal of the Gettysburg Curriculum.

Text

The department will lend out copies of the text for the semester. If you are taking the class remotely, you will need to buy or rent it.

Epp, Susanna. Discrete Mathematics with Applications. Fourth Edition. Brooks/Cole Cengage Learning. 2011.

Topics

Propositional Logic	Digital Circuits	Predicate Calculus
Methods of Proof	Induction	Set Theory
Functions	Recursion	Efficiency of Algorithms
Correctness of Algorithms	Functions	Counting
Graphs and Trees	Languages	Finite Automata

See the course calendar for more details.

Course Goals

Apply formal methods of propositional and predicate logic to model algorithms as well as actual situations.
Be able to read evaluate and understand formal proofs.
Apply the principles of Mathematical Induction to algorithm construction, recursion, and recursively defined structures
Be able to translate practical examples into the appropriate set or function model and interpret the associated operations and terminology in context.
Be able to solve simple recurrence relations.
Be able to evaluate the asymptotic run time behavior of simple algorithms.

Course goals derived from IEEE CS Curriculum 2013

Course Credit

According to the College Catalog's section on Degree Requirements: "For transfer of credit to other institutions, the College recommends equating one course unit with 4 semester hours." This valuation is in alignment with our 32 course requirement for graduation.

The federal government defines a credit hour as the equivalent amount of work as 50 minutes in class and two hours out of class for one semester.

Therefore, this course should be the equivalent work of three hours and twenty minutes in class and 8 hours outside of class per week. Since the course meets two and a half hours per week, the schedule contains a "fourth hour" item each week. Fourth hour assignments require you typeset some of your assignments using LaTeX, a language designed for typesetting mathematical and scientific articles. Fourth hour work will be assessed as part of the weekly homework assignments.

Attendance Policy

You are expected to attend class regularly either in person or via ZOOM, and keep up with the reading. You are expected to read the material BEFORE coming to class on the day that it is discussed. A comprehensive list of readings is given on the calendar on the class web page.

Grading Policy

Homework

Homework assignments will be collected via Moodle. Late homework will be penalized 10% per day. Homework submitted after the assignment is graded or after an answer key is distributed will NOT be accepted. Homework will be graded by the third class meeting or one week after they are submitted, whichever is later. Otherwise, all students who have turned the assignment in on time will receive a 10% bonus.

Unless otherwise specified, all homework assignments are weighted equally. Some assignments may count as two or more assignments. Such changes will be noted on the assignment specifications.

Reading Quizzes

There will be a brief reading quiz that accompanies each section of the book. You may attempt each quiz up to 3 times. Ideally, you attempt once prior to reading the section to highlight the important information and then again after you read. The third attempt is in case something goes wron on the first two.

Colloquia

Each student is required to attend at least two Computer Science colloquia during the semester. Colloquia will be help online via Zoom. You will receive emails from the Computer Science department announcing the time and location of each colloquium.

Portfolio

Many of the homework assignments will include writing proofs. For each proof you will receive feedback about what you can improve. Consider these rough drafts. The final portfolio will consist of a subset of the proofs written as final drafts.

Grade Distribution

Homework	45%
Reading Quizzes	40%
Colloquium Attendance	2%
Final Portfolio	13%

Grade Ranges

A+	> 98 and exceptional work*	A	93 - 100	A-	90 - 92
B+	88 - 89	B	83 - 87	B-	80 - 82
C+	78 - 79	C	73 - 77	C-	70 - 72
D+	68 - 69	D	60 - 67	F	below 60

* An A+ requires that you have a high A average and go above and beyond expectations for the course. This may be in adding extra functionality to a program or investigate a topic in greater depth than we cover in class.

Honor Code and Honor Code Violations

All Gettysburg College students are expected to abide by the Honor Code. All work in this course is to be done individually unless the instructor specifically states otherwise. This includes assigned projects as well as regular class work. The use of the computer may make it more tempting and easier to pass off another person's work as your own. This is UNACCEPTABLE. The department is always very aggressive about enforcement of the Honor Code.

For this course the following are guidelines for following the honor code.

Do not represent anyone else's work as your own.
For reading quizzes, you may use any source available other than other students.
For homework assignments, you may use your book and notes. You are welcome to discuss problems with your classmates, but you must write up solutions by yourself. Do not Google for answers.
When an assignment requires that you search for an answer, provide references to your sources.
Do not share your programs with other students, unless you are working on a group project.

Calendar

This calendar is subject to change throughout the semester.

Date	Day	Topic(s)	Section(s)	Assignments	Notes
8/17/20	M	Introduction, Technology
8/19/20	W	Variables, Sets, Relations and Functions	1.1 - 1.3
8/21/20	F	Logic	2.1
8/24/20	M	Conditional	2.2	HW 1
8/26/20	W	Arguments	2.3
8/28/20	F	Digital Logic, Number Systems	2.4, 2.5		Last Day to Add/Drop
8/31/20	M	Predicates and Quantifiers	3.1, 3.2	HW 2
9/2/20	W	Multiple Quantifiers, Arguments	3.3, 3.4
9/4/20	F	Direct Proof	4.1
9/7/20	M	Direct Proof	4.1	HW 3
9/9/20	W	Direct Proof	4.1
9/11/20	F	Rational Numbers, Divisibility	4.2, 4.3
9/14/20	M	Division into Cases, Quotient-Remainder Theorem, Floor and Ceiling	4.4, 4.5	HW 4
9/16/20	W	Contradiction and Contraposition	4.6
9/18/20	F	Contradiction and Contraposition	4.6
9/21/20	M	Sequences	5.1	HW 5
9/23/20	W	Induction	5.2
9/25/20	F	Induction	5.3
9/28/20	M	Strong Induction	5.4	HW 6
9/30/20	W	Correctness of Algorithms	5.5
10/2/20	F	Recursive Sequences	5.6
10/5/20	M	Recurrence by Iteration	5.7	HW 7
10/7/20	W	Set Theory Proofs, Properties	6.1, 6.2
10/9/20	F	Algebraic Proofs	6.3
10/12/20	M	Halting Problem	6.4	HW 8
10/14/20	W	Functions	7.1
10/16/20	F	One-to-one, Onto, Inverse	7.2
10/19/20	M	Composition	7.3	HW 9
10/21/20	W	Cardinality	7.4
10/23/20	F	Functions and Graphs and Notation	11.1, 11.2
10/26/20	M	Algorithm Efficiency I	11.3	HW 10
10/28/20	W	Algorithm Efficiency I	11.3
10/30/20	F	Exponential and Logarithmic Functions	11.4
11/2/20	M	Algorithm Efficiency II	11.5	HW 11
11/4/20	W	Counting	9.1
11/6/20	F	Multiplication Rule	9.2
11/9/20	M	Addition Rule	9.3	HW 12
11/11/20	W	Pigeonhole Principle	9.4
11/13/20	F	Graphs, Trails, Paths and Circuits	10.1, 10.2
11/16/20	M	Matrix Representations	10.3
11/18/20	W	Trees	10.5, 10.6
11/20/20	F	Course Evaluation/Final Preparation		HW 13
12/4/20	F	Final Portfolio Due (11:30 am)

Please send questions and comments to: cpresser@gettysburg.edu