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 final exam is held on Wednesday, December 15, 2005 at 6:00pm in 5129 Sennott Square.

  The exam is a closed book exam and focuses on the material from chapters 7, 4, 5. The problems in chapter 4 may require some calculations that are hard to be done by hand. Please bring your own calculator.

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:

Kenneth Rosen. Discrete Mathematics and Its Applications, 5th Edition, McGraw Hill Publishing Co., 2003.

• 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                          15 %
• Homework assignments   20%
• Exams                             65%

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.

• Webresources for the textbook
• Discrete mathematics calculator (under the development)

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.