CS 270 Mathematical Foundations in CS - Syllabus

Term and Credits

Fall 2020-2021
3 Credits

Room and Time

Section	Days	Room	Instructor
002	Monday/Wednesday	Online Only	Mark Boady
801	Monday/Wednesday	Online Only	Mark Boady
805	Tuesday/Thursday	Online Only	Galen K Long
806	Tuesday/Thursday	Online Only	Galen K Long

Instructors

Professor Mark Boady
Electronic Mail Address: mwb33@drexel.edu
Office: 3675 Market Street Room 1058 (near snack machine)
Extention: 215-895-2347 [Not Available During COVID]
Office Hours: Monday 1-5PM, Wednesday 1-5PM

Professor Galen Long
Electronic Mail Address: nkl43@drexel.edu
Office: 3675 Market Street Room 1153
Extention: 215-895-2474 [Not Available During COVID]
Office Hours: Tuesday 1-5PM, Thursday 1-5PM

Teaching Assistant(s)

Hoang Nam Le
Electronic Mail Address: hl662@drexel.edu
Office: Live In Slack Space
Office Hours: Friday 12PM-2PM and 2-4PM
CLC Information: https://www.cs.drexel.edu/clc

Quang Luong
Electronic Mail Address: qdl24@drexel.edu
Office: Live In Slack Space
Office Hours: Tuesday 6-8PM
CLC Information: https://www.cs.drexel.edu/clc

Andrew Senin
Electronic Mail Address: ams975@drexel.edu
Office: Live In Slack Space
Office Hours: Thursday 11AM-1PM
CLC Information: https://www.cs.drexel.edu/clc

Course Description

Introduces formal logic and its connections to Computer Science. Students learn to translate statements about the behavior of computer programs into logical claims and to prove such assertions using both traditional techniques and automated tools. Considers approaches to proving termination, correctness, and safety for programs. Discusses propositional and predicate logic, logical inference, recursion and recursively defined sets, mathematical induction, and structural induction.

Course Objective and Goals

1. To use recursion and divide and conquer to solve problems
2. To provide recursive definitions of patterns and data structures
3. To formally specify the input/output requirements of programs
4. To use induction and other proof techniques to prove properties of algorithms, data structures, programs, and computer systems
5. To use logic to describe the state of systems and to use logical deduction (by hand and using tools) to prove properties of systems
6. To understand the power and limitations of formal logic.

Topics

1. Functional Programming
2. Recursion, Recursive Definitions and Induction
3. Propositional and Predicate Logic
4. Formal Proof using Natural Deduction
5. Applications of Logic to Computer Science
6. Divide and Conquer Algorithms and Recurrence Relations
7. Program Specification and Verification
8. Automated Reasoning
9. Termination Analysis
10. Test Case and Counter Example Generation

Audience and Purpose within Plan of Study

This is a required course for all Computer Science and Software Engineering students. It should also be of interest to Computer Engineering, Mathematics students and students with an interest in logic and computation.

Prerequisites

CS 172 Minimum Grade: D or CS 176 Minimum Grade: D or CS 265 Minimum Grade: D or SE 103 Minimum Grade: D or ECEC 301 Minimum Grade: D or ECEC 201 Minimum Grade: D

What Students Should Know Prior to this Course

1. Ability to read and understand code.
2. Basic understanding of program execution.
3. Ability to write simple recursive programs.

What Students will be able to do upon Successfully Completing this Course:

1. Use Proofs by Deduction to Justify Logical Statements
2. Be able to write and analyze Recursive Functions
3. Be able to implement and use a SAT solver.
4. Use Inductive Proofs to Justify the correctness of programs and statements.
5. Use logic to describe the state of systems.

Textbook

We will use free resources for this class.

Book of Proof (Second Edition)
Richard Hammack
Paperback: ISBN 978-0-9894721-0-4
Hardcover: ISBN 978-0-9894721-1-1
Available for Free online at: http://www.people.vcu.edu/~rhammack/BookOfProof/

The Racket Guide
Matthew Flatt, Robert Bruce Findler and PLT
https://docs.racket-lang.org/guide/index.html

If you want to learn more about functional programming.
The Little Schemer - 4th Edition
Daniel P. Friedman and Matthias Felleisen
ISBN-13: 978-0262560993
ISBN-10: 0262560992
Available at: Amazon

If you want to learn more about recursive proofs.
The Little Prover - 1st Edition
Daniel P. Friedman and Carl Eastlund
ISBN-13: 978-0262527958
ISBN-10: 0262527952
Available at: Amazon

Grading and Policies

• Homeworks: 25%
• Labs: 20%
• Weekly Check-in: 5%
• Quizzes: 10%
• Midterm: 20%
• Final Exam: 20%

Final grades will be determined by your total points weighted according to this distribution. Grades may be curved but are generally computed via the formula below. It may be modified at the instructor's sole discretion, but letter grades will generally not be lower than those shown here.

• [100-97] A+
• (97-93] A
• (93-90] A-
• (90-87] B+
• (87-83] B
• (83-80] B-
• [80-77] C+
• (77-73] C
• (73-70] C-
• (70-67] D+
• (67-60] D
• (60-0] F

Late Policy

• Quizzes
  • If you miss a quiz, you must get permission from a TA or Professor to take it late.
• Check-ins
  • -1 point per day up to 7 days.
• Late Labs/Homeworks
  • Penalties:
    1. -10% 1 day late
    2. -20% 2 days late
    3. -30% 3 days late
    4. -40% 4 days late
    5. Not Accepted after 4 days
• Late Passes: Each student has two (2) late passes. You may exchange a late pass for 1 extra day on a lab or homework for any reason. You will receive one extra day with no penalty. You must message a Professor or TA before the deadline for the assignment you are using the late pass on. You may use both late passes on the same assignment to get 2 extra days.
• Special Exceptions: In exceptional circumstances, the Professor may wave additional penalties or accept work past the cut-off. Please message the Professor directly to request a special exception. Documentation (Doctor Note, Police Report, Athletics Approval, etc) is generally preferred.
• Family Friendly Policy: We understand that some students have family obligations. If you need to miss class for a family emergency please use the Special Exceptions policy. Small children are allowed in class, but please do your best to keep classroom distruptions to a minimum.

Academic Honesty Policy

The CCI Academic Honesty policy is in effect for this course. Please see the policy at http://drexel.edu/cci/resources/current-students/undergraduate/policies/cs-academic-integrity/.

Academic Honesty Violations will be reported to the University. Punishment will be determined by the severity of the incident. Punishments include, but are not limited to,

• Failing grade for class
• Deduction of one letter grade
• Zero on Assignment/Exam Violation took place on

Course Material

Programming Language

• This class will use the Racket Programming Language.
• This class will use the DrRacket IDE for developement.
• You may use Racket from the command line instead of the IDE.
• Download Racket

Lectures

• Lectures will be recorded and posted at the beginning of each week.
• You may watch the lecture videos at any time.

Labs

• You may work in groups of up to 2 students on labs.
• Labs are intended to help you learn the material.
• Collaboration with other students during labs is encouraged.
• Submit lab answers as a word/text/pdf. You do not have to answer on the lab sheet.
• Clearly label each question number.
• Labs are due at 11:59PM

Homeworks

• Most Weeks will have a homework assignment.
• Homeworks are due at 11:59PM

Check-ins

• You will select a time when either a TA or Professor has office hours.
• Once a week, you message the TA/Professor in Slack with a summary of how you felt the previous material went.

Quizzes/Exams

• There will be two online exams and 4 quizzes.
• Exams/Quizzes will be open book.
• Exams/Quizzes must be completed individually.

Slack Channel

• This term, we will be using a Slack channel instead of a discussion board.
• Our Slack Space is https://join.slack.com/t/cs270fall2021/shared_invite/zt-hgjg4n10-CJryfcbaVS7hKHmEc64B9Q
• You must use an @drexel.edu email to sign up.

Computer/Software Help
iCommons: http://drexel.edu/cci/about/our-facilities/rush-building/iCommons/

University Policies
In addition to the course policies listed on this syllabus, course assignments or course website, the following University policies are in effect:

• Academic Honesty: http://www.drexel.edu/provost/policies/academic_dishonesty.asp
• Judicial Affairs Academic Integrity: http://drexel.edu/studentlife/community_standards/facultystaff/integrity/
• Official Final Exam Schedule: http://www.drexel.edu/registrar/scheduling/exams/
• Students with Disability Statement: http://drexel.edu/oed/disabilityResources/overview/
• Course Drop Policy: http://www.drexel.edu/provost/policies/course_drop.asp
• Drexel Student Learning Priorities: http://www.drexel.edu/provost/irae/assessment/outcomes/dslp/
• The instructor may, at his/her/their discretion, change any part of the course during the term, including assignments, grade brakdowns, due-dates, and the schedule. Such changes will be communicated to students via the course web site Announcements page. This page should be checked regularly and frequently for such changes and announcements. Other announcements, although rare, may include class cancellations and other urgent announcements.

Appropriate Use of Course Materials

It is important to recognize that some or all of the course materials provided to you are the intellectual property of Drexel University, the course instructor, or others. Use of this intellectual property is governed by Drexel University policies, including the IT-1 policy found at: https://drexel.edu/it/about/policies/policies/01-Acceptable-Use/
Briefly, this policy states that all course materials including recordings provided by the given prior written approval by the University. Doing so may be considered a breach of this policy and will be investigated and addressed as possible academic dishonesty, among other potential violations. Improper use of such materials may also constitute a violation of the University's Code of Conduct found at: https://drexel.edu/cpo/policies/cpo-1/ and will be investigated as such.

Recording of Class Activities:

In general, students and others should not record course interactions and course activities in lecture, lab, studio or recitation.
Students who have an approved accommodation from the Office of Disability Resources to record online lectures and discussions for note taking purposes should inform their course instructor(s) of their approved accommodation in advance. The recording of lectures and discussions may only be carried out by the students enrolled in the class who have an approved accommodation from Disability Resources with their instructors’ prior knowledge and consent. Students with approved accommodations may be asked to turn off their recorder if confidential or personal information is presented.
If a student has any comments, concerns, or questions about provided class materials and/ or recording, talk to your course instructor first. If this does not resolve the issue, you can also reach out to the Department Head, and use the process described for a grade appeal to move your concern forward. The process described for grade appeals can be found at: https://drexel.edu/provost/policies/grade-appeals/

Tentative Course Schedule

Please see the appropriate assignment webpages for a detailed description of course deliverables.