California State University Stanislaus

Math 2300 Section 1: Discrete Structures

Spring 2015

2300: MWF   11:00 am - 11:50 pm,  S-104 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/15            

Welcome to Math 2300!                        

2/12/15
Office hours today are cancelled. I would be available for appointments on Friday, 2/13/15, between 2 and 4 pm. Please email if you would like an appointment.
My apologies for any inconvenience.
2/23/15
Office hours this week only:
Monday 12:30 - 2:30 pm
Tuesday 12:00 - 1:00 pm
Tuesday 2:00 - 3:00 pm
Thursday 11:00 am  - 12:30 pm
All will be held in N 375
3/3/15
New Office Hours below
5/5/15
New Office Hours below
You may use a 3 inch by 5 inch card in your own handwriting at the final exam.

Basic Information

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

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 278
                                                                                                 Naraghi 375

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

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

Office Hours:
                              Monday       12:30 pm to 2:30 pm    Naraghi 375
                              Tuesday         1:00 pm to 3:00 pm    DBH 278
                              Thursday     12:00 pm to 1:00 pm    Naraghi 375
                               Friday         12:00 pm to 1:00 pm    DBH 278
                                                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.

Attendance: Regular class attendance is expected; attendance for certain activities may be required. Students are responsible for all announcements and in-class discussion.

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 may 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.

University Recording Policy: Audio or video recording (or any other form of recording) of classes is not permitted unless expressly allowed by the faculty member as indicated in the course syllabus or as a special accommodation for students who are currently registered with the Disability Resource Services Program and are approved for this accommodation. Recordings allowed as special accommodations are for the personal use of the DRS-approved student, and may only be distributed to other persons who have been approved by the DRS program. Faculty may require the student sign an Audio/Video Recording Agreement, which they may keep for their records.


University Disability Services:  CSU Stanislaus respects all forms of diversity. By university commitment and by law, students with disabilities are entitled to participate in academic activities and to be tested in a manner that accurately assesses their knowledge and skills. They also may qualify for reasonable accommodations that ensure equal access to lectures, labs, films, and other class-related activities.   Please see the instructor if you need accommodations for a registered disability.  Students can contact the Disability Resource Services office for additional information.  The Disability Resource Services website can be accessed at http://www.csustan.edu/DRS/

Phone: (209) 667-3159


Important dates:

(See Schedule of Courses or Academic Calendar)

Last day to add a class:                     

TBA;

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

No classes

March 31, April 6-10.


Homework
Assignment - Based on Third Edition
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 
2, 6, 10, 15, 17, 19, 25, 29, 31
February 9
February 13
HW5, Section 2.1, page 86 5, 6, 13, 14, 19, 21 February 11 February16
HW6, Section 2.2, page 95  3, 19, 21, 23, 25, 33 February 13 February18
HW7, Section 2.3, page 108 9, 15, 17, 19, 34, 35, 37 February 16 February 20
HW8, Section 2.4, page 122 12, 14, 15, 22, 26, 27 February 18 February 23
HW9, Section 3.1, page 139   10, 26, 28, 32, 37, 42, 54 February 20 February 25
HW10, Section 3.2, page 146 15, 19, 32, 35 February 23 March 2
HW11,  Section 3.3, page 154
              Section 3.4, page 163
14, 16, 25, 26, 27, 30
18, 27
February 25 March 6
HW12, Section 3.5, page 170
             Section 3.6, page 178
20, 21, 22, 24
7, 11
March 9
March 16
HW13, Section 4.1, page 213 2, 4, 6, 7, 13, 15, 21, 26, 33, 41 March 16 March 18
HW14, Section 4.2, page 226 7, 11, 12, 14, 20, 25, 26 March 18 March 23
HW15, Section 4.3, page 233  
7, 9, 17, 20, 26
March 20 March 25
HW16, Section 4.4, page 242
             Section 8.1, page 472
3, 5, 13
4, 6, 10, 14
March 25
March 30
HW17, Section 8.2, page 485 1, 2abc, 4, 7, 8, 11, 13 March 30
April 3
HW18, Section 8.2, page 485 29, 32, 33, 36, 38 April 3
April 13
HW19, Section 8.3, page 498 2, 9, 10, 12, 14, 15 April 13
April 15
HW20 - Handout
              Section 8.4, page 508
1, 2, 3, 4, 5
5, 9
April 15
April 27
HW21, Section 5.1, page 267 11, 12, 14, 21, 22, 25, 27, 30 April 24
April 29
HW22, Section 5.2, page 280 4, 13, 17, 20, 24, 29 April 27
May 1
HW23, Section 5.3, page 290 2, 4, 8, 10, 16, 17, 30, 31 April 29
May 4
HW24, Section 10.1, page 582  5, 9, 10, 11, 14 May 4
May 8
HW25, Section 10.2, page 592
             Section 10.3, page 608
2, 4, 21, 22
6, 19
May 6
May 11
HW26, Section 7.3, page 430 6, 8, 11, 13, 19, 28 May 11
May 13