California State University Stanislaus

Math 2300 Section 1: Discrete Structures

Spring 2007

2300: MWF   11:15 am - 12:13 pm, C 235, 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

2/14/07

Welcome to Math 2300!   

3/6/07
No office hour on Thursday this week, sorry for the inconvenience, please email for an appointment.
5/2/07
Revised Grading Scheme

Homework
20
Quizzes/Midterms (3 at 15% each)
45
Participation
10
Comprehensive Final
25
Total
100
Quiz 1 is elevated to midterm (hour exam) status. To compensate for the increase in weight, the score for Quiz 1 component of the final grade will be the higher of your original score on Quiz 1 or your score on that material on the final. (Score means percent correct). Similarly for Quiz 3 (aka Midterm 2).
Score for Midterm 1 (aka Quiz 2) can be replaced on a problem by problem basis with the daily quizzes we discussed in class, starting on May 7th.

Schedule:
Day
Date
Topic
Question
Monday
May 7
Equivalence Relations
3a
Wednesday
May 9
Equivalence Classes, Quotient Set
3b
Friday
May 11
Hasse Diagrams
4
Monday
May 14
Set Theory Proof
2
Wednesday
May 16
1-1, onto, compsition, Function Proof or Counterexample
6

5/18/07
For quiz 3 and the final you will be allowed to bring one 3x5 inch card in your handwriting to use during the exam.

Basic Information

Textbook is Discrete Mathematics with Graph Theory (3rd Edition) by Edgar G. Goodaire and Michael M. Parmenter (ISBN: 0131679953)

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: 

Monday and Wednesday 12:30 pm to 1:30 pm
Tuesday and Thursday 2:30 pm to 3:30 pm
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 two midterm exams, a comprehensive final exam, multiple homework assignments, participation and multiple quizzes.  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. 

Midterms (2 exams at 15% each)
30%
Homeworks
20%
Quizzes
15%
Participation
10%
Comprehensive Final
25%
Total
100%

Exams and Quizzes: There will be two midterm exams and a comprehensive final, all will be in class, closed book. There will be at least one quiz most weeks, quiz dates may or may not be announced in advance. If you know in advance that you might miss a quiz or exam, 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.

Cell Phone Policy: During class time, your cell phone is to 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/drop a class:                     

March 12;

Last day to change grade options (CR/NC): 
April 20;

No classes:

March 30, April 9-13.


Homework
Assignment
Problems
Assigned
Due
HW1, Section 0.1, page 8
1defg, 2jklm, 3fghi, 4abcd, 5dgjm, 6abcdefgijk, 7bdfh
2/16/07
2/21/07
HW2, Section 0.2, page 15
1de,  3bdf,  5, 6, 7
2/19/07
2/21/07
HW3, Section 0.2, page 15
           Section 1.1, page 23
14, 15, 17, 25, 30, 33
6, 8
2/21/07
2/26/07
HW4, Section 1.2, page 29
2, 3, 9, 10de
2/26/07
3/2/07
HW5, Section 1.3, page 34
1cd, 3bc, 4dg, 5dh
2/28/07
3/5/07
HW6, Section 2.1, page 42
4, 5, 6, 8, 9, 13, 14
3/5/07
3/9/07
HW7, Section 2.2, page 49
1, 2c, 3b, 5, 7, 13, 27, 28
3/7/07
3/14/07
HW8, Section 2.3,page 56
3, 4, 7, 9adf, 11
3/14/07
3/19/07
HW9, Section 2.4, page 63
2, 4, 6, 9, 10, 16
3/19/07
3/26/07
HW10, Section 2.5, page 68
1, 3, 4, 5, 6, 11
3/23/07
4/2/07
HW11, Section 3.1, page 78
12, 13, 16, 27, 29, 31
4/2/07
4/16/07
HW12, Section 3.2, page 86
5, 6, 8, 19, 22, 23
4/4/07
4/16/07
HW13, Section 5.1, page 156
1, 2, 3, 12
4/23/07
4/25/07
HW14, Section 5.1, page 156
4dg, 6ce, 8c, 9g
4/25/07
4/30/07
HW15, Section 5.2, page 167
1, 3, 5, 7
4/30/07
5/4/07
HW16, Section 5.2, page 167 20, 23, 26, 27, 45, 48, 49
5/4/07
5/9/07
HW17, Section 5.3, page 174
1, 4, 11, 13, 18
5/9/07
5/14/07
HW18, Section 9.2, page 294
2, 6, 15, 22
5/18/07
5/23/07