MA 2201 / CS 2022 - Discrete Mathematics

MA 2201 / CS 2022 - Discrete Mathematics

C Term 2019

    MA 2201 DISCRETE MATHEMATICS    1/3    Lecture    MT-RF-    3:00-3:50    AK116    Servatius, Herman

20155    MA 2201 C01 Con    M    11:00-11:50    SH308 Drumm, Derek       dadrumm@wpi.edu,     TA            
20156    MA 2201 C02 Con    M     1:00- 1:50    SH304 Drumm, Derek       dadrumm@wpi.edu,     TA            
20157    MA 2201 C03 Con    M    10:00-10:50    HL114 Jorgensen, Jacob   jtjorgensen@wpi.edu, PLA           
20314    MA 2201 C04 Con    M    11:00-11:50    SH309 McClung, James     jpmcclung@wpi.edu,   PLA           
                                                                                                            
20060    CS 2022 C01 Con    M    11:00-11:50    SH308 Drumm, Derek       dadrumm@wpi.edu,     TA            
20061    CS 2022 C02 Con    M     1:00- 1:50    SH304 Drumm, Derek       dadrumm@wpi.edu,     TA            
20062    CS 2022 C03 Con    M    10:00-10:50    HL114 Jorgensen, Jacob   jtjorgensen@wpi.edu, PLA           
20315    CS 2022 C04 Con    M    11:00-11:50    SH309 McClung, James     jpmcclung@wpi.edu,   PLA           


(https://imgs.xkcd.com/comics/geeks_and_nerds.png)

Quiz Solutions


Quiz 1 Solutions

Final Exam

The final exam is on Friday, March, 6th, the last day of class.

(If you schedule a flight for that time, you'll lose some money one way or an other.)

Textbook:

There are many good discrete mathematics books. You may look up the material from any reputable source. These two below are freely downloadable, quite well written, have some nice exercises, many with worked out solutions.

Text 1: Discrete Mathematics
Laszlo Lovasz, Jozsef Pelikan, Katalin L. Vesztergombi
Text is freely downloadable.

Text 2: Discrete Mathematics with Algorithms
M. O. Albertson and J. P. Hutchinson
Text is freely downloadable.

Instructor:

Herman Servatius
EMAIL: hservat
Lecturer Office Hours: TRF 4pm -- 305C Stratton.

(It's right after class, so it is best to just catch me as the lecture is over, and we'll use the lounge outside the lecture hall.)

TA Office Hours:

To Be Announced:	
Drumm, Derek       dadrumm@wpi.edu,     Hours:
Jorgensen, Jacob   jtjorgensen@wpi.edu, Hours:
McClung, James     jpmcclung@wpi.edu,   Hours:

Content

From the Catalogue: This course serves as an introduction to some of the more important concepts, techniques, and structures of discrete mathematics, providing a bridge between computer science and mathematics. Topics include sets, functions and relations, propositional and predicate calculus, mathematical induction, properties of integers, counting techniques and graph theory. Students will be expected to develop simple proofs for problems drawn primarily from computer science and applied mathematics. Recommended background: none.

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

Grading

There will be a short quiz each Tuesday.

The seven quizzes altogether count for 60% of your grade, the lowest one being dropped.

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

Homework will be 10% 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.

The final exam is not optional.

Homework: You should write up the execises neatly, just as if you were submitting them for a quiz.  That way, the comments from the grader will be most valuable to you.   A couple of representative exercises will be collected in class each Friday, and ought to be returned to you in conference Monday.  (If you forget it or are not in class, you can turn it in, or email it to the TA for 1/2 credit.)  



Other Helpful links


1
2
3
4
5
6
7
8
9
10