An "A" level student will
TA: Viet Hoang
Tutor Hours: Mon, Wed 3-5
Location: Student Lounge
The primary text for the course is Discrete Mathematics and Its Applications by Rosen. An online web resource is available here.
Students will be evaluated on homework and five exams. Homework will be due EVERY Thursday (even when an exam was on the previous Tuesday). No late homework will be accepted. However, if you have a university excuse (illness, family emergency, etc.) the home work can be dropped from your average. Each homework assignemnt will consist of a set of problems. Your lowest test grade on a partial exam will be replaced by your homework average.
The course will have four partial exams and one comprehensive exam. All exams, including the final, will be open book, open notes, but closed electronics. You can bring any printed material you wish to the exam. The last partial exam and the comprehensive exam will both be given on the date of the final exam. Each exam will count 20%. NOTE! The comprehensive exam cannot be replaced by your homework average. NOTE! The homework average will replace your lowest exam score even if the homework average is lower than your lowest exam score.
The Baylor University attendance policy will be strictly enforced! Leaving early or arriving late will be counted as an absence.
The course meets at 9:30-11:00 am Tuesday and Thursday,
| Time | Topic | Text Reading | Assignments | ||||||
|---|---|---|---|---|---|---|---|---|---|
| Week 1 | Binary and Hexadecimal Pick a Number |
Section 3.6 ASCII Wodden Adder |
| ||||||
| Week 2 | Propositional Logic Mastermind Knights, Knaves and Spys | Sections 1.1-1.3 |
| ||||||
| Week 3 | Introduction to Proofs Chomp Towers of Hanoi | Section 1.6-1.7 |
| ||||||
| Week 4 | EXAM #1 - February 5 Old Exam Sets | Sections 2.1-2.2 Set Game |
| ||||||
| Week 5 | Functions - Caeser Ciphers Algorithms - Function Races | Sections 2.3 Sections 3.1-3.2 |
| ||||||
| Week 6 |
Affine Transformations | Section 3.3 Section 3.8 |
| ||||||
| Week 7 | Induction Recursion | Section 4.1 Section 4.3 |
| ||||||
| Week 8 | EXAM #2 - March 4 Old Exam Counting | Section 5.1 |
| ||||||
| Week 9 | SPRING BREAK | Work a logic puzzle | |||||||
| Week 10 | Permutations and Combinations Binomail Coefficients | Section 5.3 Section 5.4 |
| ||||||
| Week 11 | Probability Expected Value and Variance | Sections 6.1, 6.2 Section 6.4 |
| ||||||
| Week 12 | Relations Closures and Partial Orders | Sections 8.1 & 8.3 Sections 8.4 & 8.6 |
| ||||||
| Week 13 | Exam #3 - April 8 Old Exam Graphs | Sections 9.1-9.2 |
| ||||||
| Week 14 | Graphs and Paths DIADELOSO | Sections 9.3-9.4 |
| ||||||
| Week 15 | Hamiltonians Shortest Path Problem | Section 9.5 Section 9.6 |
| ||||||
| Week 16 | Introduction to Trees Checkers Tree Traversals | Sections 10.1-3 |
| ||||||
| FINAL EXAM May 10, 9:00am Review Problems Old Exam 4 Old Final |