(0) Due: Wednesday, February 3

Wednesday, I will ask you to fill out a questionnaire about the first 1/2 of the year in Discrete Math: Your likes and dislikes. What you learned and what you did not learn. What you would do more of and what you would do less of.

In addition, for next year, I will ask you:
How would you describe the discrete math course?
Should discrete math be taught at O'Bryant. Explain why or why not.

Your answers will help administrator determine whether discrete math will be offered next year.

Your sincere efforts in completing these questions will be very helpful to O'Bryant.

(20) DUE: Tuesday, February 2

• In Class Midterm
• hand in all portfolios: 1 point added to midterm grade for each portfolio
  

(19) DUE: Monday, February 1

• Midterm review
• Pool pockets: For a 6 x 9 pool table, Which pocket will it end in? How many hits? What is the distance?
  
• Sequences (Chapters 8): Review questions (pg 508 - 512): 2, 4, 5, and 12
  
• Fractals & chaos
• Graphs (Chapters 4 & 5): Everything you know about Euler and Hamiltonian circuits and paths.
  

(18) DUE: Friday, January 29

• Chapter 5 test
• Chapter 5 portfolio
  

(17) DUE: Thursday, January 28

• Do review Problems
• 5: Planar & bipartite
• 8: Nearest Neighbor
• 12: Kruskal
• 13: Tree
• 20: Dice & coin
  

(16) DUE: Wednesday, January 27

• Multi-event Tree problems + Passing Stat
• Makes trees. Show all work
• Check that answermakes sense.
  

(15) DUE: Tuesday, January 26

• Do: single Event problems on sheet
• Does not include Passing Stat.
  
• Make tree. Show al work.
  
• Check that answer makes sense.
  

(14) DUE: Monday, January 25

• TAKE HOME MIDTERM
• Don't be late. Reduce 10 points/day.
• Be neat. It counts.

• Read 5.6 on binary trees
• Do: 1 - 4, 15, 16a
  

(13) DUE: Friday, January 22

• Do 5.5: #20 as a portfolio page
• Minimum Spanning Tree portfolio page
  

(12) DUE: Thursday, January 21

• Read page 267 - Kruskal's algorithm.
• 5.5 Do: 10, 11, 12, 13
  

(11) DUE: Wednesday, January 20

• Read 5.5: pg. 263 - 266
• DO: 1 - 5, 7, 8
  

(10) DUE: Tuesday, January 19

• Trip Planner Project
• Follow sheet.
• Typed answers so preferred.

• Take Home midterm: DUE Monday, January 25.

• Lates midterms: - 10 points/day.
• Sign that work totally independently.
  

(9) DUE: Friday, January 15

• Bring in deck of playing cards
• Portfolio page for Weighted Graphs (cycle vs. tree)
  

(8) DUE: Thursday, January 14

• Read 5.4
• Do: 3, 4, and 14
• Quiz on Traveling Salesman Problem
  

(7) DEU: Wednesday, January 13

• Read 5.3
• Do: 5.3 ((5) and (7) using Dijkstra and (8))
• Portfolio page for Traveling Salesman Problem -- Use ALL THREE methods!
  

(6) DUE: Tuesday, January 12

• Do 5.2 (8) Use Nearest Neighbor and Sorted Edges algorithms
• Do 5.3 (5) and (7) with Nearest Neighbor