Tuesday, August 24, 2010

DUE: Monday, September 20

RECURSION

  1. Read pages 443 - 445.
  2. Use what you have learned in class to write recursive and explicit (closed-end) functions. Proper notation is VERY important.
  3. Do problems: 8.1 (3, 4, 5, and 6).
  • 6 is the most important. Draw the diagrams. Make a table. Carefully count the number of angles.

DUE: Friday, September 17

Skeleton Ziggarat
  • Answer the 3 questions. I expect that you will use another sheet to complete the answer to the third question. I am looking for the logic of your reasoning to answer the questions.

DUE: Thursday, September 16

Being Systematic Test

  • The test will include all that we have discussed (syllabus, class rules, definitions, etc.) as well as the problems.
  • To complete the test on time, make sure you understand how the problems were solved so that you can do ones that are similar (not the same).
  • You will staple the Wolves 7 Sheep, Game of 21, and 3 systematic problems to the test and their completion will be part of the test grade.

Wednesday, September 15

Being Systematic Problems
  • You are to solve the three Being Systematic Problems.
  • Some or all of them will be on the unit test on Thursday.
  • You will be asked to hand in your solutions with explanations. I will grade them on how well you explain your answers.

DUE: Tuesday, September 14

How High School is Different than College
  • Read the two-page comparison. Highlight items that you finding interesting/surprising.
  • Write up:
  • 3 items that surprise you
  • 3 items that you welcome in college
  • 3 items that will be hardest for you to adjust to

DUE: Monday, September 13

Game of 21
  • Solve Game of 21. Discover the answer by working systematically. Start with a number much smaller than 21 and work our way up to 21.
  • Answer the questions with the problem to show how you thought logically to reach a solution.

DUE: Friday, September 10

Wolves & Sheep:
  • Solve Wolves & Sheep.
  • Write up answers to questions on back of problem. What I am looking for is your logical thinking in discovering the answer.

DUE: Thursday, September 9

Complete these two items that were distributed in class:
  • Student survey (name, address, etc.): If you need another copy, print off from uploaded items on this blog.
  • Multiple Intelligence Survey: Circle items that relate to you and fill in continuous bargraph at bottom of page.

Sunday, May 2, 2010

Queuing Theory Project due Monday, May 24th

(7) DUE: Monday, May 17

  • Homework problem #2: The book checkout (pg. 81)
  • Show all work.

(6) DUE: Friday, May 14

  • Homework problem #1: The queue at the WC (pg. 81)
  • Show all work.

(5) DUE: Thursday, May 13

  • Complete questions 17 - 25 (pg. 80 - 81)
  • Be prepared to explain your answers completely.

(4) DUE: Wednesday, May 12

  • Does this line ever move? (Activity 7)
  • Complete questions 1 - 16 (pg. 78 - 80)
  • Write out answers completely and be prepared to explain.

(3) DUE: Tuesday, May 11

  • Revise linear programming project.
  • Make poster for presentation.

(2) DUE: Monday, May 10

  • Read pg. 75 - 77 to understand what is queuing theory.
  • Do: Project 1: Psychology of Waiting (pg. 82). Type.

(1) DUE: Friday, May 7

  • Read the 4 articles in the queuing theory packet (Disney, Best Buy, Logan, and Supermarket).
  • Summarize each. What does it explaining about "queuing?"

(16) DUE: Thursday, May 6

  • Linear Programming Project Report
  • See rubric for report. Include all parts.
  • I will return your report with comments so that you can make changes for your poster and presentation, which will be NEXT WEEK.

Saturday, April 10, 2010

(15) DUE: Monday, May 3

  • TAKE HOME double linear programming test
  • Work on your own and sign pledge.

(14) DUE: Friday, April 30

  • Do Extenstions 1, 2, and 3 on LP sheets and hand in.
  • Complete all steps of LP and give conclusion in context.
  • Linear Programming Test

(13) DUE: Thursday, April 29

  • Do Pizza Pie Extension #1 (pg. 58)
  • this will be assembled with Extensions #2 and #3 and handed in on Friday.

(13) DUE: Wednesday, April 28

  • Pizza Pie. Complete questions 1 - 17. (Pg. 56 - 57.)
  • Use LP sheet.

(12) DUE: Tuesday, April 27

Pizza Pie (pg. 55 - 56)
  • Do # 1 - 8 on LP sheet
Complete Art Poster
  • How do you define best?
  • What is the "best" decision?

(10) DUE: Monday, April 26

  • EXTRA CREDIT: Optimization Project
  • Use "How Optimiation is achieved in the real word" sheet as a guide.
  • Interview someone who has to optimize in their job. Discover how they optimize and write it up. Be willing to share this information with the class.

(9) DUE: Friday, April 16

  • Linear Programming page
  • Your very best LP page with an explanation of what you did so you can use this for quizzes and tests.
  • LP quiz on High Step Shoes.
  • Bring High Step Shoes to class for quiz.

(8) DUE: Thursday, April 15

  • Cutting times: Questions 1 - 21 on sheet. (pg. 43 - 46)
  • Do work on LP sheet.

(7) DUE: Wednesday, April 14

  • Do Not-Whole Plywood extension (pg. 33 - 34)
  • Quiz grade.
  • Work together, but then write up answers separately. Hand in your own work.
  • Write up on LP sheet.

(6) DUE: Tuesday, April 13

  • Complete Extension 1 of High Step Shoes.
  • Do all 3 parts to be handed in.
  • Be prepared to present your part.

Friday, April 2, 2010

(5) DUE: Monday, April 12

  • High Step Extension 1.
  • Solve using LP template sheet.

(4) DUE: Friday, April 9

  • High Step Shoes. Read page 29 - 31.
  • Do: 1 - 13 on Linear Programming sheet in packet.

(3) DUE: Thursday, April 8

  • Complete LEGO problem
  • Linear algebra Quiz

(2) DUE: Wednesday, April 7

  • Solve Linear Algebra Problems
  1. Graph
  2. Convert to standard form
  3. Convert to matrices
  4. Solve for intersection

(1) DUE: Tuesday, April 6

  • Read article on Malthus. How does this relate to linear programming.
  • Start thinking about your own linear programming problem in which you have several variables and constraints and you are looking to optimize the solution.

Saturday, March 27, 2010

(10) DUE: Thursday, April 1

  • What are diophantine equations? Google on web and bring in answer.
  • How do you solve them? Google "Cows, Pigs, and Chickens" and read how it is done with an easy problem.

(9) DUE: Tuesday & Wednesday, March 30 & 31

  • Presentations on College MCDM

Sunday, March 21, 2010

(8) DUE: Monday, March 29

  • Complete College Project including one sensitivity analysis.
  • Discuss your results. Is it waht you expected? Are there other changes you should make?
  • Multi-Criteria Decision Making Assessment
  • Open notes.

(7) DUE: Friday, March 26

  • Calculate the weights for each of your measures.
  • Compare and re-evaluate the criteria weights.
  • Calculate the total scores for each college.

(6) DUE: Thursday, March 25

  • Re-scale your data after determining the range and creating structured categories.

(6) DUE: Wednesday, March 24

  • List a minimum of 5 college options
  • List the measures you will use for each of the four criteria: Academic, Financial, Social, and Location
  • Collect data for your measures (You will need this data to re-scale for tomorrow's assignment, so do not delay in gathering it.)

(5) DUE: Tuesday, March 23

  • Cars analysis with sensitivity analysis
  • (This is a project grade.)
  • Hand in: 2 pages of analysis, one sensitivity analysis, and discussion of your results.
  • Discussion: Is this what you expected? What criteria or measure most influenced your result. Did your analysis change your mind about which car is "best" for you?

(3) DUE: Monday, March 22

  • Complete two page analysis of choosing a used car for purchase.
  • How do you range your three cars?
  • Do one sensitivity analysis in which you adjust weights.
  • How does this change your rankings?

(2) DUE: Friday, March 19

  • Using class criteria and measures for purchasing used cars, collect data and rescale it to standard units.
  • Set range.
  • Determine if categorical or quantitative.
  • Determine if natural or structured.
  • Re-scale to standard units.

Sunday, March 7, 2010

(1) DUE: Thursday, March 18

  • Select THREE used cars priced at less than $5,000 that you like.
  • Print off offering.
  • Find and write on summary tables: year, price, mileage, distance from your home, EPA(city and highway), Consumer review, safety rating, and general description
  • All of this information may be obtained from www.cars.org or the sites it directs you (including www.safercar.gov). You may use other sites, including www.vehix.com, but you need all of this info.
  • If you find a car without some of this info, select another car.

DUE: Tuesday, March 16

  • Read two operations research articles from packet:
  • "Operation Everything": What is operations research and why so important?
  • "When Shove Comes To Push": Why is intuition sometimes faulty? Answer questions at end of article.

DUE: Monday, March 15

  • Read Checkboard Code from NUMB3RS.
  • Answer questions.
  • Be ready for the NUMB3RS show Janus that uses encryption.

DUE: Friday, March 12

  • Solve Hill Code message.
  • (You may wnat to write portfolio page now, while it is fresh in your head. Otherwise, it's due next Tuesday.)

DUE: Thursday, March 11

  • Matrices Chapter Extension: Keyword Code
  • Read extension.
  • Summarized method.
  • SOLVE coded message at end!

Sunday, February 28, 2010

DUE: Wednesday, March 10

  • Chapter 3 Matrices Test
  • Portfolio, except for Keyword Matrices

DUE: Tuesday, March 9

  • Matrices Review Problems: 16 and 17

DUE: Monday, March 8

  • Matrix Review
  • 6 (answer in back, so check thoroughly)
  • 8
  • 9
  • 10
  • ALL of portfolio complete but for Keyword Matrix

DUE: Friday, March 5

  • Term III SAT Questions Test

DUE: Thursday, March 4

  • Leslie Model Quiz

Wednesday, March 3

  • Portfolio page for Leslie Model
  • BUG problem given in class

DUE: Tuesday, March 2

  • 3.5: Problem 5
  • ALL parts!

Friday, February 26, 2010

Due: Monday, March 1, 2010
  • 3.5 Do # 1, 2, (3 and 4 if snow day for Tuesday, too)

Sunday, February 21, 2010

Due: Friday, February 26, 2010
  • Page 165, #12, 13, 14, 15
Due: Thursday, February 25, 2010
  • 3.4 # 2, 3
Due: Wednesday, February 24, 2010
  • Read 3.4 p.148-152
  • Do #1 and #4
Due: Tuesday, February 23, 2010
  • Portfolio pages
  • quiz

Sunday, February 7, 2010

Due: Friday, February 12, 2010
  • Take home quiz
Due: Thursday, February 11, 2010
  • 3.3 #10, 11
Due: Wednesday, February 10, 2010
  • Read pages 139-141
  • Finish Manufacturing Toys worksheet
Due: Tuesday February 9, 2010
  • Read pages 132-134
  • Do 3.2 #6, 10, 12
Due: Monday, February 8, 2010
  • Read page 129-134
  • Do #2, 3, 4, 8, 9 in 3.2

Thursday, February 4, 2010

Due: Friday, February 5, 2010
  • Do 3.1 #6, 9, 11, 13, 17
Due: Thursday, February 4, 2010
  • Read page 120-122
  • Answer the following question: What are matrices used for besides graph theory?

Saturday, January 30, 2010

(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.

Saturday, January 23, 2010

(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.

Saturday, January 16, 2010

(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

Saturday, January 9, 2010

(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