Part of this course will be presentations tenth week. Your presentations will be from a topic in Discrete Math selected from the following list. This project will be a 20-25 minute presentation on the topic to the entire class. The presentation should include examples and problems, even a few homework problems. The homework problems should not be trivial but not impossible. You should turn in to me an answer sheet for the problems. You may also choose a topic not on this list if it has close ties to Discrete Math. You need to get the topic okayed by me by February 22th.
You may work in groups of 2 people. Look over the following topics and email me your top three choices of topics with all the names in your group listed. The selection of topics will be in a FIFO manner so the sooner you email the better.
| Topic | Sections in Discrete Math | Assigned To... | |
|---|---|---|---|
| Instant Insanity & Game Trees | 6.8 & 7.9 | Susan & Tonia | |
| Network Models & Maximal Flow | 8.1-8.3 | Eric P. & Neenef | |
| Matching & Petri Nets | 8.4-8.5 | ||
| Combinatorial Circuits & Properties | 9.1-9.2 | Rob & Garret | |
| Boolean Algebras and Synthesis of Circuits | 9.3-9.4 | Eric S. & Mike | |
| Applications of Boolean Algebras | 9.5 + outside research | ||
| Closest Pair Problems | 11.1-11.2 | Jesse and Jim | |
| Convex Hull Computation | 11.3 + outside research | Joshua & Autumn | |
| Relational Databases | 2.7 + outside research | ||
| Cryptosystems | 3.7 + outside research | Brian and Sean |
| Topic | Tentative Scheduled Presentation Date |
|---|---|
| Cryptosystems | Wednesday, March 1 |
| Games | Friday, March 5, #1 |
| Networks | Friday, March 5, #2 |
| Combinatorial Circuits | Monday, March 8, #1 |
| Boolean Algebras | Monday, March 8, #2 |
| Closest Pair Problems | Wednesday, March 10, #1 |
| Convex Hull Computations | Wednesday, March 10, #2 |