Course Goals:
This course provides students with an introduction to the mathematical
concepts fundamental to computer science.

Topics Covered (mostly if not all):

1. The
Foundations: Logic and Proof

1.1 Propositional Logic

1.2 Applications of
Propositional Logic

1.3 Propositional
Equivalences

1.4 Predicates and
Quantifiers

1.5 Nested Quantifiers

1.7 Introduction to Proofs

1.8 Proof Methods and
Strategy (pp. 92-97, 99-102)

2. Basic
Structures: Sets, Functions, Sequences, and Sums

2.1 Sets

2.2 Set Operations

2.3 Functions

2.4 Sequences and Summations

2.6 Matrices

4. Number
Theory

4.1 Divisibility and Modular
Arithmetic

4.2 Integer Representations
and Algorithms

4.3 Primes and Greatest
Common Divisors

6. Counting

6.1 The Basics of Counting

6.2 The Pigeonhole Principle

6.3 Permutations and
Combinations

6.4 Binomial Coefficients

7. Discrete
Probability

7.1 Introduction to Discrete
Probability

9. Relations

9.1 Relations and their
Properties

9.3 Representing Relations

9.4 Closure of Relations

Grading:

Exams: 60% (mid-term 30%, final 30%,
and closed book);

Quizzes: 30% (in recitation classes
and closed book);

Assignment: 10%.

CIS 1166 Final:

All main campus day sections
of CIS 1166 will have common final examinations from 3:30 to 5:30 PM on
Tuesday, May 9.

Policies:

Students with
special needs: Any student who has a need for accommodation based on the
impact of a disability should contact me privately to discuss the specific
situation as soon as possible. Please contact Disability Resources and
Services at 215-204-1280 in 100 Ritter Annex to coordinate reasonable
accommodations for students with documented disabilities.

Freedom to teach
and freedom to learn are inseparable facets of academic freedom. The
University has a policy on Student and Faculty and Academic Rights and
Responsibilities (Policy #03.70.02) which can be accessed through the
following link.