MA 2201 / CS 2022 - Discrete Mathematics

Text:
Discrete Mathematics
Laszlo Lovasz, Jozsef Pelikan, Katalin L. Vesztergombi
Instructor:
Herman Servatius

EMAIL: hservat

Office Hours: Tuesday, Thursday, After class or by appointment.


TA's and SA's and Office Hours in Fuller Lab A22 
TA: Xika Lin    xika@wpi.edu  Hrs:
                              R 2-3
                              F 1-2 

TA: Fei Song    fes@wpi.edu   Hrs:
                              W 3-4
                              F 3-4

SA: Eric Finn   ericfinn@WPI.EDU  Hrs:
                              M 11-12
                              R 11-12
                              F  2-3

SA: Jing Zhang jingzhang@wpi.edu  Hrs:
                              M 4-5
                              F 1-2

Quiz Solutions

Quiz 0001

Quiz 0010

Quiz 0011

Quiz 0100

Quiz 0101

Quiz 0110

Quiz 0111 - Double Down

Final Exam


Syllabus

This course provides an introduction to the mathematical structures of computer science. Discrete mathematics includes topics on set theory, logic, proofs, relations, functions, orders of growth, induction, recursion, and graphs.

This course is recommended background for: CS2223, CS3133, CS3431, ECE3801 and most of upper-level mathematics.

Grading

There will be a quiz each Friday

The quizzes altogether count for 70% of your grade.

There will one final exam, worth 30% of your grade.

The policy for ALL make-up quizzes is to use the scaled final exam to replace the quiz.

Moreover, there is no penalty for not taking a quiz. You can decide after completing the quiz not to submit it. On the other hand, once submitted, it cannot be withdrawn, and the lowest quiz submitted is NOT dropped.

The final exam is not optional. The final will be given during class, and the date of the final will be announced in class near the end of the course.

Homework
It is essential in discrete mathematics to do many exercise. For each chapter covered you should attempt ALL the inter-text excises who solutions appear in the back. In addition you should write up solutions to the assigned review exercises at the end of the chapter listed below. Please write each excise neatly on a separate sheet of paper so that selected exercises may be individually collected. Exercises from the text: 
Chapter 1: Sets and Introductory Concepts
   Exercises:  1.8.8 - 1.8.34
     Chapter 2: Induction and Basic Tools
   Exercises:  2.5.1 - 2.5.5, 2.5.7, 2.5.8
     Chapter 3: Pascal's Triangle
   Exercises:  3.8.4 - 3.8.13     
     Chapter 4: Fibonacci Numbers
   Exercises:  4.3.5, 4.3.6, 4.3.7, 4.3.8, 4.3.12, 4.3.13, 4.3.15     
     Chapter 6: Number Theory
   Exercises: 6.10.3,  6.10.4,  6.10.5,  6.10.6,  6.10.7,  6.10.8,  6.10.9, 
              6.10.13, 6.10.14, 6.10.17, 6.10.18, 6.10.19, 6.10.20, 6.10.22, 6.10.23