# Discrete Summer 2014

Math 2345 Discrete Math Summer  2014

Section 002: Meeting TR, 6:00-7:55 in J132

Sarah Holliday Office: D230 / R2-327

Phone: 678-915-3421 E-mail: shollida@spsu.edu

Office Hours:
MWF, 11:30-12:30, TR 4-6. And by appointment

Text:
Discrete Mathematics with Applications, 3rd ed., Susanna S. Epp.

Prerequisites:
MATH 1113.

Technology:
You may want a calculator for large data set arithmetic. The TI-83/84 or TI-89 is acceptable, as are many other calculators. You may NOT share calculators during quizzes or exams. The use of cell phones, pagers, text or other messaging devices is not allowed during class.

Course objectives:
An introduction to the fundamentals of discrete mathematics. Topics include sets, formal logic, methods of proof, counting, relations, functions, graphs and trees, and finite state automata.
Upon completing this course students should be able to:
1. Write a correct formal proof.
2. Write the converse, contrapositive, and negation of a statement.
3. Determine whether a relation is reflexive, symmetric, or transitive.
4. Identify isomorphism invariants of graphs.
5. Construct minimal spanning trees for weighted graphs using Kruskal's and Prim's algorithms.

Homework, Quizzes and Examinations:
Homework will be assigned daily, but will not be collected without advance warning. Questions on homework problems can be answered in Office Hours and/or in class. Quizzes will occur frequently, and occasionally without warning. Quiz questions will typically come from homework problems. There will be four in-class examinations, and a final

In-class examinations will be valued at 15% each, quizzes will total to 15%, and the final will be valued at 25%.
A 90% or greater average will be awarded A
An 80% or greater average will be awarded B
A 70% or greater average will be awarded C
A 60% or greater average will be awarded D

Honesty:
Be sure you read the relevant section and know and understand the potential penalties in the University Academic Regulations in the current undergraduate catalog or on the campus web site. If you are caught cheating, you will receive a grade of zero for that assignment, and you may be asked to leave the class.
SPSU has an Honor Code and a new procedure relating to when academic misconduct is alleged. All students should be aware of them. Information about the Honor Code and the misconduct procedure may be found at http://spsu.edu/honorcode/

Absence:
If I am contacted with an acceptable excuse before the date of the quiz or exam, then a makeup can be arranged. An acceptable excuse is in writing, contains the student's name, the date of the absence, a signature from a faculty member sponsoring the trip, contact information for the faculty member, and a brief mention of the nature of the trip.

Special needs:
I will attempt to accommodate all students with special needs to the best of my ability, but it is the responsibility of the student to make their needs known to me. Students with disabilities who believe they may need accommodations in this class are encouraged to contact the counselor working with disabilities at 678-915-7244 as soon as possible to better assure that such accommodations are implemented in a timely fashion.

Dates:
19 May First Day of Classes

26 May Memorial day Holiday

27 May class schedule Lock Down

TEST 1 JUNE 3

TEST 2 JUNE 17

19 June Class Withdrawal Deadline (Full session)

TEST 3 JULY 3

4 July Holiday

TEST 4 JULY 17

24 July Last Day of Classes for Summer

26 – 30 July Final Exams

2 Aug Commencement

4 Aug Grades due (10 am)

Assistance:
For help with your homework, or questions about the lectures, you have a lot of options. I will take a limited number of questions during class, as time permits. I am available in my office for help during my posted office hours, and any unscheduled time my door is open. For additional help, there are campus-wide resources I will announce as soon as I have the details.

Practice homework:
Section 1.1 #6, 7, 8, 9, 14, 15, 16, 17, 18, 19, 23, 26, 27, 29, 30, 31, 32, 33, 34, 35, 37, 41, 42, 43, 44, 47, 49
Section 1.2 #5, 7, 9, 11, 13, 15, 16, 17, 18, 19, 20, 21, 28, 29, 30, 32, 33, 35, 42, 43, 44, 45, 46, 47, 48
Section 2.1 #1, 3, 9, 11, 13, 14, 15, 16, 17, 18, 19, 27, 31
Section 2.2 #1, 2, 3, 4, 9, 10, 11, 13, 18, 19, 23, 25, 27, 28, 38, 37, 40, 43, 45, 46.
Section 2.3 #15, 17, 19, 21, 35, 37, 38.
Section 3.1 #1, 4, 5, 6, 7, 8, 9, 11, 12, 13, 17, 24, 27, 28, 29, 31, 39, 41, 44, 47, 48, 49, 53, 54, 56
Section 3.3 #3, 7, 12, 15, 18, 19, 20, 21, 22, 23, 24, 25, 26
Section 3.6 #3, 5, 12, 14, 17, 19, 23, 24, 26
Section 4.1 #1, 3, 7, 11, 12, 15, 20, 22, 26, 27, 33, 35, 39, 41, 42, 43, 44, 45, 46, 47, 48
The first term in 4.1.15 should be 0.
Section 4.2 #1, 6, 8, 11, 12, 15, 16, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 31
Section 4.3 #2, 4, 9, 11, 12, 16, 17, 19, 20, 22
Section 5.1 #1, 3, 5, 8, 9, 10, 12, 13, 18, 19, 21, 26, 27, 28, 29, 30
Section 6.2 #2, 4, 8, 9, 10, 11, 12, 14, 15, 17, 20, 28, 29, 30, 31, 32, 33, 34, 35, 36
Section 6.3 #4, 3, 4, 6, 9, 11, 14, 17, 20, 21
Section 6.5 #2, 3, 4a, 4b, 10, 11, 12, 13, 14, 15a, 16a
Section 6.7 #1, 3, 5, 10, 11, 13, 15, 17, 18, 24, 25, 27, 31, 34
Section 10.1 #1, 6, 7, 9, 10, 11, 15, 24, 25, 27
Section 10.2 #1, 2, 4, 6, 8, 9, 10, 11, 12, 14, 17, 18, 19, 20, 23, 25, 33, 37
Section 11.1 #1, 3, 5, 8, 15, 16, 17, 18, 19, 20, 21, 22, 23, 25, 27, 33, 34, 36, 44, 45
Section 11.2 #1, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 47a, 48a, 49
Section 11.4 #6, 7, 8, 9, 10, 11, 12, 14, 15, 16, 17, 18
Section 11.5 #3, 5, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 23, 25, 27, 30
Section 11.6 #1, 3, 4, 5, 6, 7, 8, 9, 11
Section 12.2 #2, 4, 5, 8, 9, 14, 15, 16, 21, 22, 25, 26