CS 441 Discrete
Mathematics for Computer Science
Time: TH 1:00-2:15pm WWPH 1500
Instructor:
- Milos
Hauskrecht
5329 Sennott Square, x4-8845
e-mail: milos at cs pitt edu
office hours: Wednesday 10:30am-noon
Recitations:
- Section 35296: Friday: 10:00 – 10:50 AM, 5313 SENSQ, TA: Vyasa Sai
- Section 13734: Friday: 11:00 – 11:50 AM, 5313 SENSQ, TA: Vyasa Sai
- Section 13682: Friday: 12:00 – 12:50 AM, 5313 SENSQ, TA: James Larkby-Lahet
TAs:
- Vyasa Sai (sections 35296, 13734)
6150 Sennott Square, x4-8464
e-mail: vys1+ at pitt edu
office hours: MW 12:00-3:00pm
- James Larkby-Lahet (section 13682)
5501 Sennott Square, x4-8439
e-mail: jamesll at cs pitt edu
office hours: T: 2:30-4:30pm, W 4:00-6:00pm, TH: 2:30-4:30pm
Links
Course
description
Lectures
Grading
Homeworks
Additional
Student Resources
Academic
Honesty
Announcements
(check often)
- Homework assignment 11 is out and due on Thursday, December 10, 2009.
Please note that all exercises are from the 6th edition of the
textbook.
- Solutions to homework assignments:
- The final exam will be held on Monday, December 14th at 2pm - 3:50pm in Cathedral of Learning room 232.
The exam is a closed-book, cumulative exam.
Course description
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.
Syllabus
Textbook:
Kenneth Rosen.
Discrete Mathematics and Its Applications, 6th Edition , McGraw Hill Publishing Co., 2007.
Tentative Syllabus
- Logic: propositional logic, logical equivalence, predicates &
quantifiers, and logical reasoning.
- Sets: basics, set operations
- Functions: one-to-one, onto, inverse, composition, graphs
- Integers: greatest common divisor, Euclidean algorithm.
- Sequences and Summations
- Mathematical reasoning: Proof strategies, Mathematical Induction,
Recursive definitions, Structural Induction
- Relations: properties, Combining relations, Closures, Equivalence,
partial ordering
- Counting: basic rules, Pigeon hall
principle, Permutations and combinations, Binomial coefficients and
Pascal triangle.
- Probability: Discrete probability. Expected values and variance.
Lectures
Grading
-
Lectures 10 %
- Homework assignments 30%
-
Exams
60%
Homeworks
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.
Additional Student Resources
Academic Honesty
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.
The web page is maintained by milos