Scribd
Upload
59 views3 pages

CS270 Syllabus

This document contains a summary of errors found on a webpage for the CS 270 Mathematical Foundations in CS course at Drexel University. It lists 3 errors where a double hyphen appears within an HTML comment on lines 103, 112, and 137 of the page code. It then provides the content of the webpage up until the first error, including information about the course details, instructors, teaching assistants, description, objectives, topics, prerequisites and expectations.

Uploaded by

Jai Vase
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
59 views3 pages

CS270 Syllabus

This document contains a summary of errors found on a webpage for the CS 270 Mathematical Foundations in CS course at Drexel University. It lists 3 errors where a double hyphen appears within an HTML comment on lines 103, 112, and 137 of the page code. It then provides the content of the webpage up until the first error, including information about the course details, instructors, teaching assistants, description, objectives, topics, prerequisites and expectations.

Uploaded by

Jai Vase
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

This page contains the following errors:

error on line 103 at column 44: Double hyphen within comment: <!--Textbook__________

error on line 112 at column 24: Double hyphen within comment: <!--Textbook__________---></p>

<p class="calibre1"><b

error on line 137 at column 45: Double hyphen within comment: <!--Textbook__________---></p>

<p class="calibre1"><b

error on line 156 at column 367: Double hyphen within comment: <!--Textbook__________---></p>

<p class="calibre1"><b

Below is a rendering of the page up to the first error.

CS 270 Mathematical Foundations in CS


- Syllabus
Term and Credits

Fall 2022-2023

3 Credits

Room and Time

Section Days Time Room Instructor


11:00am - 3675 Market Street Galen
001 MW
12:50am Room 1104 Long
2:00pm - 3675 Market Street Galen
003 TR
3:50pm Room 1104 Long
4:00pm - 3675 Market Street Mark
004 TR
5:50pm Room 1104 Boady
1:00pm - 3675 Market Street Mark
005 MW
2:50pm Room 1104 Boady

Instructors

Professor Mark Boady

Electronic Mail Address: [email protected]

Office: 3675 Market Street Room 1063 (near snack machine)

Extention: 215-895-2347

Office Hours: Tuesday and Thursday 11AM-12PM

Professor Galen Long

Electronic Mail Address: [email protected]

Office: 3675 Market Street Room 1153

Extention: 215-895-2474

Office Hours: Tuesday and Thursday 1-2PM

Teaching Assistant(s)

Vanessa Martinez

Electronic Mail Address: [email protected]

Office: CLC

Office Hours: Wednesday 6:00PM-8:00PM and Friday 12:00AM-2:00PM

CLC Information: https://www.cs.drexel.edu/clc

Neil Kanakia

Electronic Mail Address: [email protected]

Office: CLC

Office Hours: Thursday 2:00PM-4:00PM 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.

You might also like