CS 270 Mathematical Foundations in CS - Syllabus

Term and Credits

Fall 2019-2020
3 Credits

Room and Time

Section	Days	Time	Room	Instructor
001	Tuesday/Thursday	10:00AM-11:50AM	3675 Market Street Room 1052	Mark Boady
002	Tuesday/Thursday	12:00AM-1:50PM	3675 Market Street Room 1052	Mark Boady
005	Tuesday/Thursday	4:00PM-5:50PM	3675 Market Street Room 1052	Galen Long
006	Tuesday/Thursday	6:00PM-7:50PM	3675 Market Street Room 1056	Galen Long
007	Wednesday/Friday	10:00AM-11:50AM	3675 Market Street Room 1104	Galen Long

Instructors

Professor Mark Boady
Electronic Mail Address: mwb33@drexel.edu
Office: 3675 Market Street Room 1058 (near snack machine)
Extention: 215-895-2347
Office Hours: Tuesday 3-4PM, Wednesay 2-4PM Thursday 3-4PM

Professor Galen Long
Electronic Mail Address: nkl43@drexel.edu
Office: 3675 Market Street Room 1153
Office Hours: Monday 10AM-12PM, Wednesday/Friday 12-1PM

Teaching Assistant(s)

Steve Earth (Lead TA)
Electronic Mail Address: se435@drexel.edu
Office: Drexel CLC 3675 Market St Room 1066
Office Hours: https://www.cs.drexel.edu/clc

Jiho Yoo
Electronic Mail Address: jy434@drexel.edu
Office: Drexel CLC 3675 Market St Room 1066
Office Hours: https://www.cs.drexel.edu/clc

Khanh Tran
Electronic Mail Address: kat372@drexel.edu
Office: Drexel CLC 3675 Market St Room 1066
Office Hours: https://www.cs.drexel.edu/clc

Penghu Chen
Electronic Mail Address: pc634@drexel.edu
Office: Drexel CLC 3675 Market St Room 1066
Office Hours: https://www.cs.drexel.edu/clc

Reza Moradinezhad
Electronic Mail Address: rm976@drexel.edu
Office: Drexel CLC 3675 Market St Room 1066
Office Hours: 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: 20%
• Labs: 20%
• Quizzes: 10%
• Midterm: 25%
• Final Exam: 25%

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

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

Late Policy

• Quizzes
  • If you miss a quiz schedule with the TA as soon as possible.
  • Missed quizzes are handled on a case by case basis.
• Labs
  • If you miss a lab, you may complete it on your own.
  • Submit a PDF of the lab to your TA in Slack.
  • Penalties:
    1. -10% within 24 hours of lab period missed
    2. -20% within 48 hours of lab period missed
    3. -30% within 72 hours of lab period missed
    4. -40% within 96 hours of lab period missed
    5. Not Accepted after 96 hours
• Homeworks
  • You may submit homeworks at a penalty for a few days.
  • 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
  • We understand that sometimes unforeseen circumstances will effect your life. Each student is allowed 2 Late Passes.
  • Using a Late Pass will remove a 1 day penalty from a lab/homework.
  • To use a late pass: send a slack message to your TA informing them that you want to use a pass and what assignment to apply it for.
  • The TA must be informed within 24 hours of submission of your work that you want to use a late pass on that work.
• 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

Lectures

• Lectures will be held twice a week.
• Attendance in lecture is required.

Labs

• Most Classes will have an in-class exercise.
• Exercise is due by the end of class.
• Exercises require working with a team of 1-3 students.

Homeworks

• Most Weeks will have a homework assignment.
• Homeworks are due at 11:59PM
• Homeworks must be submitted to learning.drexel.edu

Exams

• There will be two written exams given in class
• Midterm during class during Week 6
• Final Exam during Exam Week (Week 12)

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/drexelcs270fall2019/signup
• 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.

Tentative Course Schedule

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