COT 3100 Discrete Mathematics
Syllabus
Homework Policy
PROBLEM SETS <---- Required!
First day of class Fall: Tues August 26, 2013, Thanksgiving 11/27
Exams (all dates tentative and subject to change)
Practice Exam 1 Solutions
Practice Exam 1 #7 Solution
EXAM 1 Date: 10/2
Exam will cover logic, quantifiers, functions, sets, integers
EXAM 2 Date: 10/30
Exam will cover proofs plus exam 1 material
Exam 2 practice problems and key
More Exam 2 practice
EXAM 3 Date: 11/20
Exam will focus on graphs.
Practice Exam 3 (need to draw your own
graphs on some questions)
Final Exam: during scheduled time slot. See UNF Final exam schedule
for date and time. It will be held in our usual classroom. Final exam
will focus on counting as well as all previous material.
Problem Due Dates from Problem Sets (subject to change): You are
encouraged to work more than just the required problems.
Section 1.1-1.2 Problems Due 9/4 (all of 1.1, 1.2 #'s 1-5, 10-11)
Section 1.2-1.3 (1.2 problems 14-16, 24, 29), Section 1.3 problems
(1-10, 12-15, 21, 23) Due 9/11
Section 2 Problems Due 9/16 (1-5, 12-19)
Section 2 Problems Due 9/18 (6-7, 11, 21-25, 34-37)
Section 3 Problems Due 9/18 (18-25)
Section 3 Problems Due 9/23 (1-17)
Section 4 Problems Due 9/23 (#2)
Exam 1
Section 4 Problems Due 10/14 (1, 6-8)
Section 5.1-5.2 Problems Due 10/21
Section 5.3 Problems Due 10/28 (1, 2, 4, 9, 10, 11, 14, 28)
Exam 2
Section 6.1.1 Problems Due 11/13
Section 6.2 Problems 1-8 Due 11/13
Exam 3
Section 7 Problems 1-15 Due 12/2
You are expected to read the sections of the text and are strongly
encouraged to work problems from the appropriate sections, both as
we cover the section and as review for the exams. The Rosen text has
many good problems, both easy and challenging, for your benefit; the
more problems you work, the better your chances of success. Feel free
to visit my office hours to discuss problems.
Sections from the Rosen text we will cover:
Sections 1.1-1.5 Logic (See also Section 11.3)
Section 3.1 Quantifers
Sections 2.1-2.4 Sets
Sections 5.3-5.5 Functions
Section 4.3 Sequences
Sections 7.1-7.4, 7.7-7.8 Integers
Chapter 4 Proofs
Chapters 12, 14, 15 Graphs
Chapter 13 Trees
Chapter 8 Counting
Sections 5.1-5.2 Relations (if time permits)
Interesting Links:
Puzzle Applets
Proofs
Mathematical Puzzles
Algorithms and Proof Information
Discrete Math
Problem Site
Graph Theory
Tutorials
Graph
Theory Lessons
Good puzzles
Colo.
State Puzzles
Challenging
Problems Course
Texts and Notes
A free and
certified Discrete Math text
Basic Discrete Math Notes
Lovasz' Discrete
Math Notes in .ps form, may require ghostview to view
Another set of lecture notes
Google "Discrete Math Lecture
Notes" to find others