Time: MW 16:30-17:45pm 5129 Sennott
Square
Instructor: Milos
Hauskrecht
5329 Sennott Square, x4-8845
e-mail: milos-at-cs.pitt.edu
office hours: MW 2:00-3:00pm
TA:
Mahmoud Elhaddad
6504 Sennott Square, 4-9955
e-mail: elhaddad@cs.pitt.edu
office hours: Tuesday, Thursday 11:00am --1:00pm
Course
description
Lectures
Grading
Homeworks
Additional
Student Resources
Academic
Honesty
Announcements (check often)
The purpose of this course is to understand and use (abstract) discrete structures that are backbones of computer science. In particular, this class is meant to introduce logic, proofs, sets, relations, functions, counting, and probability, with an emphasis on applications in computer science.
Prerequisites:
2 years of high school algebra.
Textbook:
Lectures | Topic(s) | Assignments | |
---|---|---|---|
January 5 |
Administrivia and course overview ( Course description.)
Readings: R - Introduction |
. | |
January 10 |
Propositional logic
Readings: Chapter 1.1. |
Homework 1 | |
January 12 |
Logical equivalences
Readings: Chapter 1.2. |
Homework 2 | |
January 17 | No class | . | |
January 19 |
Predicates and Quantifiers
Readings: Chapter 1.3. |
. | |
January 24 |
Predicate logic
Readings: Chapter 1.4. |
Homework 3 | |
January 26 |
Methods of Proof
Readings: Chapter 1.5. |
. | |
February 2 |
Methods of Proof
Readings: Chapter 1.5. |
Homework 4 | |
February 7 |
Sets and set operations
Readings: Chapters 1.6. and 1.7. |
Homework 5 | |
February 9 |
Set operations, Functions
Readings: Chapters 1.7. and 1.8. |
. | |
February 14 |
Functions
Readings: Chapter 1.8. |
Homework 6 | |
February 16 |
Integers and divisibility
Readings: Chapter 2.4 and Euclidean algorithm (in Section 2.5). |
. | |
February 21 |
Midterm exam 1
Readings: Chapter 1. |
. | |
February 23 |
Integers and Division (cont)
Readings: Chapter 2.4 and Euclidean algorithm (in Section 2.5) |
Homework 7 | |
February 28 | Sequences
Readings: Chapter 3.2. |
. | |
March 2 | Summations
Readings: Chapter 3.2. |
. | |
March 7,9 | Spring break | . | |
March 14 | Mathematical induction, Recursion
Readings: Chapter 3.3. and 3.4. |
Homework 8 | |
March 16 | Counting. Basic counting rules.
Readings: Chapter 4.1. |
. | |
March 21 | Counting. Pigeonhole
principle. Permutations. Combinations.
Readings: Chapter 4.2. and 4.3. |
Homework 9 | |
March 23 | Counting. Binomial coefficients. Pascal
triangle. Counting with repetitions
Readings: Chapter 4.4. and 4.5. |
. | |
March 28 | Probabilities
Readings: Chapter 5.1. and 5.2. |
. | |
March 30 | Probabilities.
Readings: Chapter 5.2. and 5.3. |
. | |
April 4 | Midterm 2
Readings: Material from Chapters 2,3,4. |
Homework 10 | |
April 6 | Relations. Properties.
Readings: Chapter 7.1. |
. | |
April 11 | Relations. Combined operations.
Readings: Chapter 7.3. |
Homework 11 | |
April 13 | Relations. Closures
Readings: Chapter 7.4. |
. | |
April 18 | Relations. Equivalence relations and classes.
Readings: Chapter 7.5. |
. | |
April 20 | Relations. Partial orders.
Readings: Chapter 7.6. |
. | |
April 26 | Final exam
Readings: Material from Chapters 1,2,3,4,5 and 7 |
. |
There will be weekly homework assignments. The assignments are due at the beginning of the class on the day specified on the assignment. In general, no extensions will be granted.
All the work in this course should be done independently. Collaborations on homeworks are not permitted. Cheating and any other antiintellectual behavior, including giving your work to someone else, will be dealt with severely. If you feel you may have violated the rules speak to us as soon as possible.
Please make sure you read, understand and abide by the Academic Integrity Code for the Faculty and College of Arts and Sciences.
Students With Disabilities
If you have a disability for which you are or may be requesting an
accommodation, you are encouraged to contact both your instructor and
Disability Resources and Services, 216 William Pitt Union, (412)
648-7890/(412) 383-7355 (TTY), as early as possible in the term. DRS
will verify your disability and determine reasonable accomodations for
this course.