CS 270 Mathematical Foundations in CS - Syllabus

Term and Credits

Fall 2018-2019
3 Credits

Room and Time

• Section 1 - Monday and Wednesday - 12:00pm-1:50pm Lincoln Plaza 3020 Market St 445
• Section 2 - Wednesday and Friday - 2:00pm-3:50pm Curtis Hall 340
• Section 3 - Monday and Wednesday - 6:00pm-7:50pm Curtis Hall 341

Instructors

Professor Jeremy Johnson (Section 1)
Electronic Mail Address: johnsojr@drexel.edu
Office: University Crossings 139
Extention: 215-895.-2893
Office Hours: Wed 10-12PM

Professor Mark Boady (Section 2 and 3)
Electronic Mail Address: mwb33@drexel.edu
Office: University Crossings 138
Extention: 215-895-2347
Office Hours: Wednesday 11am-1pm, Friday 11-1PM, others days/times by appointment.

Teaching Assistant(s)

• Klimentina Krstevska kk866@drexel.edu (Sections 1 and 3)
• Paras Wadekar psw36@drexel.edu (Sections 1, 2, and 3)
• Sandesh Bhandari sb3728@drexel.edu (Sections 1 and 2)
• Saugat Sthapit ss4258@drexel.edu (Sections 1 and 2)
• Shun Li sl3329@drexel.edu (Sections 1 and 3)

All TA Office Hours held in the CLC 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.

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
Students should have programming experience (CS172 or equivalent).

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.

Optional Resources

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

Course Material

Programming Language

• This class will use the Racket Programming Language.
• This class will use the DrRacket IDE for developement.
• Download Racket

Lectures

• Lectures will be held twice a week.
• Attendance in lecture is required.
• If you need to miss class, please message the Professor to request an exception.

Labs

• Some Classes will have an in-class lab.
• Exercises are due by the end of class.
• Exercises will be require working with a team.
• If you need to miss class, please message the Professor to request an exception.

Quizzes

• Quizzes will be given in learning.drexel.edu
• Quizzes are closed book.
• Quizzes will have a time limit.
• Only one attempt is allowed for each quiz.

Homeworks

• Most Weeks will have a homework assignment.
• Homeworks are due Thursday at 11:59PM
• Homeworks must be submitted to learning.drexel.edu
• Late Submissions:
  • 1 Day Late 10 point deducton (Before Friday 11:59PM)
  • 2 Days Late 20 point deduction (Before Saturday 11:59PM)
  • 3 Days Late 30 point deduction (Before Sunday 11:59PM)
  • 4 or More Days Late - Only Accepted with Instructor Permission

Exams

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

Special Circumstances

• If you have a documented reason why you cannot submit an assignment by the deadline, a special exception may be made. The Professor may also wave the late submission penalty for documented special exceptions.

Course Policies

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

Grading and Policies

• Labs 20%
• Homeworks 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

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.

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

Tentative Course Schedule

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