California State University Stanislaus

Math 2300 Section 1: Discrete Structures

Spring 2013

2300: MWF   11:00 am - 11:50 pm,  CX-101,  Dr. Melanie Martin

[Basic Information]         [Announcements]         [Calendar]         [Homework]        

Welcome to Math 2300, Discrete Structures

Course Description:

Discrete mathematical structures and their application in computer science. Sets, logic, proof, relations and functions. Topics selected from combinatorics, recurrence equations, and graph theory.

Some goals of this course:

  1. To introduce students to the theoretical mathematical framework underlying key concepts in computer science. This mathematics background includes set theory, logic, combinatorics, Boolean Algebra, recurrence equations, graph theory and analysis of algorithms.
  2. To familiarize students with the nature of mathematical reasoning, deductive logic and proofs. Students should be able to read, write, and understand basic mathematical proofs.
  3. To assist students in realizing the connection between mathematical theory and its applications to computer problems.

Announcements and Upcoming Events

1/28/13              

Welcome to Math 2300!                        

4/19/13
 Homework Amnesty for Assignments 11-18 (Chapters 4 and 8)
You may turn in homework assignments 11-18 for up to half the points you missed back.
(I will average your new score with your original score.)
If you want feedback before the quiz, they must be turned in on Wednesday, April 24th.
Otherwise they must be turned in at the quiz on Monday, April 29th.
5/13/13
 Homework Amnesty for Assignments 1-10 (Chapters 1-3) and 19-24 (Chapters 5, 10)
You may turn in these homework assignments for up to half the points you missed back.
(I will average your new score with your original score.)
If you want feedback before the final, they must be turned in on Wednesday, May 15th.
Otherwise they must be turned in at the final on Monday, May 20th.
5/13/13
 You may bring 1, 3 inch by 5 inch card to the final. You may write on both sides. It must be your handwriting.

Basic Information

Textbook is Discrete Mathematics with Applications, 3rd Edition, by Susanna S. Epp (ISBN: 0534359450)

Prerequisite: MATH 1100 or both MATH 1070 and MATH 1080 with a grade of C- or better.

Instructor: Dr. Melanie Martin                                  Office: Demergasso-Bava Hall 276

Email: mmartin@cs.csustan.edu                                 Office Phone: (209) 667-3787

Web Page: www.cs.csustan.edu/~mmartin

Office Hours:  (Tentative)

          Monday         1:00 – 1:50 pm      DBH 276
Tuesday         9:00 – 9:50 am      Naraghi 375
Tuesday         10:00 – 10:50 am  Naraghi 124
Wednesday    12:00 – 12:50 pm  DBH 276
                 and by appointment.

Best way to contact Dr. Martin:  Email mmartin@cs.csustan.edu  Please put "Math 2300" in the subject line of the email.

Warning: I reserve the right to make changes to the syllabus at any time during the term by announcing them in class and on my web page.

Grading:  Grades will be based mainly upon three quizzes, a comprehensive final exam, multiple homework assignments, and participation.  A plus and minus grading scale will be used to assign final grades.  The final grade weighting of student work is estimated in the table below. 

Homeworks
25%
Quizzes (at least 2)
 50%
Comprehensive Final
 25%
Total
 100%

Exams and Quizzes: There will be at least two quizzes and a comprehensive final, all will be in class, closed book. If you know in advance that you might miss a quiz, you must discuss this with me well in advance.  No make-up quizzes or exams will be given unless you have a verifiable emergency.  I do not give early exams to accommodate vacation schedules, so please make your holiday travel plans accordingly.  I reserve the right to refuse make-up requests.

Homework: Regular homework is expected and is a regular part of any math course. Your homework is due on the due date at the start of class. Homework must be stapled and should have your name, the course and section number clearly visible (additional guidelines here). No late homework will be accepted. Homework may include problems from the book, other assigned problems, programming assignments and group projects.

Academic Honesty: The work you do for this course will be your own, unless otherwise specified. You are not to submit other people's work and represent it as your own. I consider academic honesty to be at the core of the University's activities in education and research. Academic honesty is expected at all times in this course. Cheating is an attack on the efforts of myself and fellow students and, above all, on the cheater's integrity. Those caught cheating will be dealt with to the full extent allowed under University policy.

Collaboration and Teamwork:  Students are encouraged to co-operate on assignments by discussing the problems. That does not mean labor division in terms of problem solutions. All problems for all assignments have to be done by the very student who is submitting the assignment. Copying someone else's work OR allowing someone to copy your work are prohibited. All discussions and other aids used must be explicitly and properly acknowledged. For instance (examples based on Vadim Bulitko's
http://www.cs.ualberta.ca/~bulitko/W04):

"I discussed problem 3.43 with my classmates K. Black and P. Posey. On problem 3.49 I received an office-hour consultation from my instructor R. Altman.  Additionally I used sources [1] and [2] for problem 3.78.

[1]. A.Jolie. "Fast Numeric Methods for Curvature Approximation",  Journal of Geeky Gamers, volume 36, issue C, June 2001.

[2] F.Oz. "On Using the Force as a Theorem Proving Technique", Jedi Archives, volume 666, number 34, May 2002."

There will be NO collaboration allowed on quizzes and final exam. Any unacknowledged aid (e.g., copying from other students, copying from external sources, or elsewhere) constitutes a case of plagiarism. 

Cell Phone Policy: During class time, your cell phone (including headsets) must be turned off and out of sight. Any use of a cell phone during class will result in confiscation of the phone until that day's class has ended or your removal from the class for that day. If you attempt to use your cell phone or leave it on during an exam, you will be considered to have finished your test, and I will collect your exam at that time.  Exceptions may be made only if you discuss your situation with me prior to the start of that day's class, in this case, your cell phone must be set to vibrate/silence.

Important dates:

(See Schedule of Courses or Academic Calendar)

Last day to add a class:                     

February 8;

Last day to drop or change grade options (CR/NC): 
February 22;

No classes

April 1-5.

Homework
Assignment
 Problems
 Assigned
 Due
HW1, Section 1.1, page 15
 10, 15, 24, 26, 32, 43, 48, 49 January 30
February 4
HW2, Section 1.2, page 27
 17, 20g, 22g, 23g, 39, 40
 February 4
 February 6
HW3, Section 1.3, page 41        
 9, 10, 23, 28, 29, 30
February 6
 February 11
HW4, Section 1.4, page 55 
          Section 2.1, page 86 		2, 6, 10, 15, 17, 19, 25, 29, 31
5, 6, 13, 14, 19, 21
 February 11
 February 15
HW5, Section 2.2, page 95       3, 19, 21, 23, 25, 33 February 13
 February 18
HW6, Section 2.3, page 108
9, 15, 17, 19, 34, 35, 37
 February 15
 February 20
HW7, Section 2.4, page 122 12, 14, 15, 22, 26, 27 February 18 February 22
HW8, Section 3.1, page 139   
10, 26, 28, 32, 37, 42, 54
 February 20 February 25
HW9, Section 3.2, page 146
          Section 3.3, page 154
          Section 3.4, page 163 		15, 19, 32, 35
14, 16, 25, 26, 27, 30
18, 27 		February 25 March 1
HW10, Section 3.5, page 170
            Section 3.6, page 178 		20, 21, 22, 24
7, 11 		March 4
 March 8
HW11, Section 4.1, page 213 2, 4, 6, 7, 13, 15, 21, 26, 33, 41 March 6 March 11
HW12, Section 4.2, page 226 7, 11, 12, 14, 20, 25, 26 March 15 March 18
HW13, Section 4.3, page 233
             Section 4.4, page 242
7, 9, 17, 20, 26
3, 5, 13
 March 18 March 22
HW14, Section 8.1, page 472
4, 6, 10, 14 March 22
 March 25
HW15, Section 8.2, page 485 1, 2abc, 4, 7, 8, 11, 13 March 27
 March 29
HW16, Section 8.2, page 485 29, 32, 33, 36, 38 March 29 April 8
HW17, Section 8.3, page 498 2, 9, 10, 12, 14, 15 April 8
 April 12
HW18 - Handout 1, 2, 3, 4, 5
 April 10
 April 15
HW19, Section 8.4, page 508 5, 9 April 15
 April 19
HW20, Section 5.1, page 267 11, 12, 14, 21, 22, 25, 27, 30 April 17
 April 22
HW21, Section 5.2, page 280 4, 13, 17, 20, 24, 29 April 19
 April 26
HW22, Section 5.3, page 290 2, 4, 8, 10, 16, 17, 30, 31 April 24
 May 1
HW23, Section 10.1, page 582  5, 9, 10, 11, 14 May 1
 May 6
HW24, Section 10.2, page 592
             Section 10.3, page 608 		2, 4, 21, 22
6, 19 		May 3
 May 10
HW25, Section 7.3, page 430 6, 8, 11, 13, 19, 28 May 10
 May 15