California State University Stanislaus

Math 2300 Section 1: Discrete Structures

Spring 2020

2300 (21419): MWF   11:00 am - 11:50 pm,  S-135 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 relations, 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


Welcome to Math 2300!                            

Basic Information

Textbook is Discrete Mathematics with Applications, 4th Edition, by Susanna S. Epp (ISBN 13: 978-0495391326

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:                                 Office Phone: (209) 667-3787 or (209) 667-3269

Web Page:

Office Hours:


3:00 4:00 pm

DBH 278


12:00 1:00 pm

DBH 278


2:30 3:30 pm

Naraghi 375

                and by Appointment

Best way to contact Dr. Martin:
  Email  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. 

Quizzes (at least 2)
Comprehensive Final

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

"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

Phone: (209) 667-3159

Important dates:

(See Schedule of Courses or Academic Calendar)

Last day to add a class:                     

February 10;

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

No classes

March 23-27, March 31, May 25.

Assignment from 4th Edition
Homework Guidelines
HW1, Section 2.1
5, 10, 15, 17, 29, 30, 43, 52
January 27, 2020
February 7, 2020
HW2, Section 2.2 17, 20g, 22g, 23g, 31, 48 January 31, 2020 February 12, 2020
HW3, Section 2.3 9, 10, 23, 28, 29, 30 February 10, 2020
February 17, 2020
HW4, Section 2.4 2, 6, 10, 15, 17, 19, 29, 31 February 12, 2020
February 19, 2020
HW5, Section 3.1
           Section 3.2
5, 6, 14, 19, 21
3, 17, 19, 29
February 17, 2020 February 26, 2020
HW6, Section 3.3
           Section 3.4
9, 16, 17, 35, 36, 38
12, 14, 15, 22, 26, 27
February 21, 2020 February 28, 2020
HW7, Section 4.1 10, 27, 28, 36, 41, 42 February 28, 2020 March 6, 2020
HW8, Section 4.2
           Section 4.3
           Section 4.4
14, 17, 36, 38
13, 16, 28, 29
21, 27
March 11, 2020 March 18, 2020
HW9, Section 4.5
           Section 4.6
20, 21, 22, 24
7, 12
April 8, 2020
April 15, 2020
HW10, Section 5.1
            Section 5.2
            Section 5.3
2, 4, 6, 7, 13, 15, 21, 26, 30, 32, 38, 39
7, 11, 12, 14, 21, 26, 27
7, 9, 17, 20, 26
April 15, 2020
April 27, 2020
HW11, Section 5.4
            Section 5.6
2, 3, 6, 7
4, 6

April 22, 2020
May 4, 2020
HW12, Section 5.7
            Section 5.8
1c, 2b, 4, 7, 8, 29, 32, 33
2, 9, 10, 12, 15
April 29, 2020
May 11, 2020
Recommended: Section 6.1
                          Section 6.2
                          Section 6.3
12, 13, 17, 27, 30, 32, 34
14, 19, 26, 31
2, 8, 20, 37, 38