# Math 2300 Section 1: Discrete Structures

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

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

 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.