CMSC250

Summer 2011

 

Instructor:

Dr. Kinga Dobolyi

kdobolyi@gmu.edu (George Mason email address)

Office hours: MW 11:30-12:20 (in TA office #1112), and by appointment

 

Teaching Assistant:

Tom Chan

yhchan@cs.umd.edu

Office hours: W 4-5:50pm (in TA office #1112)

 

Course Webpage:

http://www.cs.gmu.edu/~kdobolyi/cmsc250/

(note gmu address)

 

Class time and location:

Lecture MTWR: 12:30 – 1:50pm CSI 2107

Lab F 12:30-1:50pm CSI 2107

 

Textbook:

Discrete Mathematics with Applications, Third Edition. Susanna S. Epp. Thompson Learning - Brooks/Cole, 2004. ISBN:0-534-35945-0

 

Homework assignments will come from this version of the textbook, although you are welcome to use whatever version you have. DO NOT email the instructor asking for the homework questions – you may copy out homework assignments during posted office hours.

 

Course Outline:

See the class schedule below for a list of topics we will cover this summer. You are responsible for the book chapters listed below, in addition to any material NOT in the book but covered during lecture.

 

Class Schedule (subject to change):

Date

Lecture Topics

Relevant Readings

5/31/11

Intro/Logic (Truth Tables and Logical Equivalence)

1.1, 1.2

6/1/11

Logic (Rules, Arguments, and Unsimplified Formulas)

1.1, 1.2,1.3, 1.4 (part)

6/2/11

Logic (F. O. Quantifiers)

2.1, 2.2

6/3/11

Discussion Section

-- --

6/6/11

Logic (Multiple Quantifiers, and Interpretations)

2.3

6/7/11

6/8/11

Number Theory (Dir. Proof cont. / Mod)

3.1, 3.2, 3.3, 3.4

6/9/11

Number Theory (Ind. Proof / UFT / Classic Thms)

3.3, 3.6, 3.7

6/10/11

Discussion Section

——

6/13/11

Number Theory (UFT/ Thms Cont.)/Number Theory Review – no new slides

3.7

 

6/14/11

Induction (Sequences and Sums)

4.1

6/15/11

Induction (Inductive Proofs)

4.2

6/16/11

Exam 1

——–

6/17/11

Discussion Section

——

6/20/11

Induction (Seq. Rules and More Inductive Proofs – no new slides)

4.1, 4.2, 4.3

6/21/11

Induction (Inequalities)

4.3

6/22/11

Induction (Strong induction)

4.4

6/23/11

Induction Review/Sets (Notat. and Defs.)

5.1

6/24/11

Discussion Section

——

6/27/11

Sets (Notat., Set Disproofs and Venn Diagrams)

5.1, 5.3 (pgs. 283-287)

6/28/11

Sets Review/Counting

6.1, 6.2, 6.3

6/29/11

Count/Prob. (Lists, P(n,r) C(n,r), Mult. Rule)

6.1, 6.2, 6.3

6/30/11

Count/Prob. (Addition Rule, Incl.-Excl., More C(n,r))

6.5

7/1/11

Discussion Section - cancelled

——

7/4/11

NO CLASS – July 4

 

7/5/11

Count/Prob. (Expected Value)

6.8

7/6/11

Count/Prob. (Bayes)

6.9

7/7/11

Counting Review/Exam 2 Review

——

7/8/11

Exam 2 (in discussion)

——

7/11/11

Functions (Function Defs, 1-1, onto)

7.1, 7.2

7/12/11

Functions (Inv, Proofs and Pigeonhole Principle)

7.2, 7.3

 

7/13/11

Functions (Compositions)

7.4

7/14/11

Functions (Countability and Uncountability)

7.5

7/15/11

Discussion Section

——

7/18/11

Functions (Countab./Abstracting)/Relations (Def, Inv. – no new slides)

7.5, 10.1

 

7/19/11

Relations (Relation Properties, Proofs/Disproofs)

10.2, 10.5 (632-634)

7/20/11

Final Review I - Sample Final Ans./Q&A

——

7/21/11

Final Review II - Trouble Spots/Subtle Points

——

7/22/11

FINAL EXAM

——

 

Homework assignments and quiz solutions

 

Grading and exams:

  Class participation: 5% (lab attendance is taken)

       Homeworks: 10%

      Quizzes: 15%

       Exam 1: 20%

       Exam 2: 25%

      Final exam: 25%

 

Homework:

Homework is assigned at the beginning of each week and is due at the beginning of discussion section the same week. Each student must turn in their individual work, although you may work together in groups to discuss high-level concepts as they relate to the course material. If you choose to work in groups, you must note your group members on your submission. You may also use outside resources, such as the Internet, to help you solve problems, and you must properly cite all such external tools.

 

The point of the homework is to understand and learn what you are doing; simply copying solutions from a friend or a website will not help you learn the material in a way that will be useful on an exam.

 

The lowest homework grade will be dropped. Late homework will not be accepted – remember, homework is due, on paper, at the beginning of your discussion section every week. If you know you will miss lab for a University-excused absence, you may email the TA your homework before the start or class – the TA will only accept this homework for a documented, excused absence, however.

 

Homework solutions will not be posted online – you must attend discussion section each week, during which the homework assignment due that week will be reviewed and solutions provided during recitation.

 

Quizzes:

Quizzes will occur during discussion section about every week, and will be closed-book, closed-notes, and individual effort (like exams). You may (and should) bring your rulesheet to quizzes. The lowest quiz grade will be dropped. There will be no make-up quizzes except for University-approved excused absences; in the case of a foreseeable absence, you must notify the TA 3 days in advance to arrange for a make-up. In the case of an unforeseeable absence, you must notify the TA within 24 hours and bring acceptable documentation when scheduling a makeup.

 

Accomodations for disabilities:

If you have a disability and request special accommodations, please talk to me. If you need services certified by Disability Support Services (DSS), please bring documentation if available.

 

Academic Integrity:

For each Exam, the Campus Senate requests that you write and sign the Honor Pledge on it. You are subject to the Code of Academic Integrity for all assignments in this course, including homeworks and quizzes. You may find the Code of Academic Integrity at http://www.studenthonorcouncil.umd.edu/code.html