The schedule below represents my current best estimate concerning course timing. There will be changes as the semester progresses.
Readings should be completed before class on the day they are listed. Readings followed by (s) are supplemental. You are not required to complete the supplemental readings, but you may find them useful.
Note that all Homework Assignments are due on Fridays at 1:00PM.
Unless otherwise noted, all readings below are from
Discrete Mathematics and Its Applications 7e.
Kenneth H. Rosen, McGraw-Hill, 2012.
| WEEK | DATE | TOPIC | READING | DUE |
| 1 | 01-13 | Review 227 Logic | 1.1 - 1.3 | LaTeX Exercises PDF Solution |
| 01-15 | Predicate logic + LaTeX | 1.4 - 1.5 Syllabus Dr. Mayfield's LaTeX 101 (.pdf) |
||
| 01-17 | Proof Techniques | 1.6 - 1.7 | ||
| 2 | 01-20 | MLK DAY | HW1 (.tex) (Due 1/24 at 1:00PM) |
|
| 01-22 | Divisibility | 1.8, 4.1 | ||
| 01-24 | Integer representations | 4.2 | ||
| 3 | 01-27 | Primes (.pdf) Python primes.py |
4.3 Python 101 (.pdf) http://www.learnpython.org/ (Basics) |
HW2 (.tex) |
| 01-29 | Applications of congruence (.pdf) | 4.5 | ||
| 01-31 | Cryptography (.pdf) | 4.6 | ||
| 4 | 02-03 | Set operations and functions set_function_exercises.pdf |
2.1 - 2.3 | HW3 (.tex) |
| 02-05 | Recurrence relations, Summations sequence_exercises.pdf |
2.4 | ||
| 02-07 | Matrix operations matrix_exercises.pdf |
2.6 | ||
| 5 | 02-10 | Proof by induction (.pdf) induction_exercises.pdf |
5.1 | HW4 (.tex) |
| 02-12 | Strong induction (.pdf) strong_induction_exercises.pdf |
5.2 | ||
| 02-14 | Exam Review | |||
| 6 | 02-17 | EXAM1 | ||
| 02-19 | Counting (.pdf) counting_exercises_1.pdf |
6.1-6.2 | ||
| 02-21 | counting_exercises_2.pdf | 6.3-6.4 | ||
| 7 | 02-24 | Probability (.pdf) probability_exercises_1.pdf |
7.1 | HW5 (.tex) |
| 02-26 | Probability probability_exercises_2.pdf |
7.2 | ||
| 02-28 | Bayes' Theorem (.pdf) bayes_exercises.pdf |
7.3 | ||
| 8 | 03-03 | SNOW DAY | HW6 (.tex) | |
| 03-05 | Introduction to Relations (.pdf) relation_exercises.pdf |
9.1 | ||
| 03-07 | Representing Relations (.pdf) | 9.3 | ||
| 9 | 03-10 | SPRING BREAK | ||
| 03-12 | SPRING BREAK | |||
| 03-14 | SPRING BREAK | |||
| 10 | 03-17 | SNOW DAY | HW7 (.tex) | |
| 03-19 | Closures of Relations (.pdf) closure_activity.pdf |
9.4 | ||
| 03-21 | Introduction to Graphs (.pdf) intro_graph_activity.pdf |
10.1 - 10.2 | ||
| 11 | 03-24 | Graph Representations and Isomorphism (.pdf) representation_exercises.pdf |
10.3 | HW8 (.tex) |
| 03-26 | Graph Connectivity (.pdf) connectivity_exercises.pdf |
10.4 | ||
| 03-28 | Exam Review | |||
| 12 | 03-31 | EXAM2 | ||
| 04-02 | euler_exercises.pdf | 10.5 | ||
| 04-04 | Shortests Paths (.pdf) dijkstra_exercises.pdf |
10.6 | ||
| 13 | 04-07 | Graph Coloring | 10.8 | HW9 (.tex) |
| 04-09 | Trees (.pdf) Tree Applications |
11.1,11.2 | ||
| 04-11 | Tree Traversals | 11.3 | ||
| 14 | 04-14 | Spanning Trees spanning_tree_exercises.pdf |
11.4 | HW10 (.tex) |
| 04-16 | Minimum Spanning Trees MST Exercises (.pdf) |
11.5 | ||
| 04-18 | Finite State Machines Finite State Machine Exercises (.pdf) |
13.2 | ||
| 15 | 04-21 | Finite State Automata (.pdf) FSA Exercises (.pdf) |
13.3 | HW11 (.tex) |
| 04-23 | Regular Expressions Regular Expression Exercies (.pdf) |
13.4 | ||
| 04-25 | Turing Machines | 13.5 | ||
| 16 | 04-28 | Review | ||
| 04-30 | Review | |||
| 05-02 | SECTION 1 FINAL 10:30-12:30 | |||
| 16 | 05-05 | SECTION 2 FINAL 1:00-3:00 |