Instructor:  

• Milos Hauskrecht
  5329 Sennott Square, x4-8845
  e-mail: milos at cs pitt edu
  office hours: Thursday 3:00-5:00pm

Recitations:  

• Section 1: Wednesday: 1:00 -- 1:50 PM, 5313 SENSQ,
• Section 2: Wednesday: 2:00 -- 2:50 PM, 5313 SENSQ

• Zitao Liu
  5324 Sennot Square, x4-0513
  e-mail: ztliu at cs pitt edu
  office hours: Wed 15:30 - 17:00pm, Fri 13:30 - 16:30pm

Course description
Lectures
Grading
Homeworks
Additional Student Resources
Academic Honesty
 

Announcements (check often)

• The final exam for the course is scheduled on Saturday, April 27 at 8:00-9:50am in SENSQ 5129 . The exam is a closed book, cumulative exam. Please do not forget to bring simple calculators you may need to solve counting and probability problems.
• Homework assignment 10 is out and due Monday, April 15, 2013.
• Please note that all exercises/homework assignments are from the 7th edition of the textbook.
• Solutions for homework assignments:
  • Homework assignment 1
  • Homework assignment 2
  • Homework assignment 3
  • Homework assignment 4
  • Homework assignment 5
  • Homework assignment 6
  • Homework assignment 7
  • Homework assignment 8
  • Homework assignment 9
  • Homework assignment 10

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, 7th Edition , McGraw Hill Publishing Co., 2012.

• 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                          10 %
• Homework assignments   30%
• Exams                             60%

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

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.