Sunday, December 16, 2007

(6) DUE: Monday, Jan. 14

  • Make up your own matrix problem.
    • Question very neat on front on TOP 1/4 of page. Answer very neat on back.

(5) DUE: Friday, Jan. 11

  • Do portfolio except Leslie and Keyword matrices
  • Quiz on multiplication of matrices

(4) DUE: Thursday, Jan. 10

  • Do: 3.3 (8, 9, 11)
  • Set up 3.3 (10) on a separate sheet of paper

(3) DUE: Wednesday, Jan. 9

  • Read 3.3

(2) DUE: Tuesday, Jan. 8

  • Outline 3.2
  • Do: 3.2 (4, 6, 7, 10, 12)

(1) DUE: Monday, Jan. 7

  • Outline 3.1
  • Do 3.1 (6, 9, 11, 13, 14, 16, 17, 18)

(12) DUE: Friday, Jan. 4

  • Snowplow algorithms & solutions for presentations

Sunday, December 9, 2007

(11) DUE: Wednesday, Dec. 19

  • Chapter 5 test
  • Chapter 5 portfolio

(10) DUE: Tuesday, Dec. 18

  • Do review questions:
    • 3: Planar
    • 5: Bipartite
    • 8: TSP
    • 12: Shortest path
    • 17: Spanning Tree (use all 3 algorithms, even though it only asks for one)
    • 21, 22, 23: Binary trees

(9) DUE: Monday, Dec. 17

  • Read Steiner Trees (extension) (pg. 286 - 288). Take some notes.
  • Portfolio page(s) for Spanning Trees.
    • Include algorithms for Breadth, Kruskal, and Prim with an example.
  • Quiz on spanning trees. May use portfolio pages.

(8) DUE: Friday, Dec. 14

  • Do: page 261 - # 6
  • Write up your findings. Typed greatly appreciated.
    1. Explain the trick.
    2. What you did to solve it.
    3. What was the result?
    4. Why does it work? ----This is the MOST IMPORTANT part.
LOVE that typing.

(7) DUE: Thursday, Dec. 13

Do: 5.5 (1 - 4, 8, 10, 14 - 18, 20, 21)
  • Show * - ? - !, obviously.

(6) DUE: Wednesday, Dec. 12

  • Outline 5.5
  • BIG suggestion: type Breadth, Kruskal, and Prim (in problems) algorithms. Give an example. this can be used on next Monday's quiz and maybe the chapter test.

PS this is really not due until Thursday.

Sunday, December 2, 2007

(5) DUE: Tuesday, December 11

  • 5.4 read and outline
  • 5.4 (2 - 4, 7 - 9, 11 - 14)
  • Quiz on TSP and Shortest Path (plus planarity & bipartite graphs)

(4) DUE: Monday, Dec. 10

  • 5.4 (16) Card game
  • WRITE UP your findings:
    • What's the problem?
    • What did you do?
    • What did you discover?
    • Relate this to graph theory
  • QUIZ on planarity, TSP, and Shortest path

(3) DUE: Friday, Dec. 7

  • Read & outline 5.3
  • Do 5.3 (1, 5, 8, 9)
  • Extra credit: Numb3rs exploration

(2) DUE: Thursday, Dec. 6

  • Read & outline 5.2
  • Do 5.2 (1 - 4, 7, 8)
  • Of course, DRAW!

(1) DUE: Wednesday, Dec. 5

  • Read & outline 5.1
  • Do: 5.1 (1 - 4, 8, 10, 12, 13, 18) DRAW!!!!!!!!!

(0) DUE: Tuesday, Dec. 4

  • 4- (and 3-, and 5-, and 6-) letter word puzzle
  • See how many points you can find.

Sunday, November 18, 2007

(14) DUE: Monday, Dec. 3

  • Chapter 4 test
  • Portfolio

(12) DUE: Thursday, Nov. 29

  • Review
    • Scheduling: 3, 6
    • Euler: 7, 10, 11, 12, 13, 14
    • Hamilton: 17, 18
    • Directed: 19
    • Coloring: 20
  • Of course, * - ? - !

(11) DUE: Wednesday, Nov. 28

  • 4.6 (9, 10, 11). * - ? - !

910) DUE: Tuesday, Nov. 27

  • 4.6 (1, 3, 4, 7, 8,12). * - ? - !

Sunday, November 11, 2007

(8) DUE: Tuesday, NOV. 20

  • Do: 4.5 (1, 5, 6, 7,8)
  • Quiz on scheduling, Euler and Hamilton circuits

(7) DUE: Monday, NOV. 19

  • Do: 4.4 (8,12, 13, 14)
  • Outline 4.5

(6) DUE: Friday, Nov. 16

  • Do: 4.3 (14, 15, 18)
  • Outline 4.4
  • Do 4.4 (5, 6)

(5) DUE: Wednesday, NOV. 14

  • Outline 4.3
  • Do: 4.3 (1, 4, 7c, 8b, 9, 10, 11, 13, 19)

Sunday, November 4, 2007

(28) DUE: Tuesday, Nov. 13

  • Work on those college essays and applications.
  • Not ANY college, but the college that YOU want to go to. Be in the driver's seat.

  • For, discrete math, kick back!

(27) DUE: Friday, No. 9

  • Pick either Spiralaterals or Kick It!
    • * What do you know (given)
    • ? What is the question
    • ! How did you solve it? Even what did not work.
    • The BEST: Can you generalize for any case.
      • Kick It!: "If there were N and M points, then I would know that the minimum impossible score would be .... because ....
      • Spiralaterals: "If I had a sequence Q, R, S, where (the relationship among Q, R, and S), then I know the spiralateral would...... because...
    • TYPE
    • Attach your work papers. NO credit if there are not work papers. And, there need to be enough examples that you can find the pattern.
    • Hey, why is this discrete math?

(26) DUE: Thursday, Nov. 8

  • Complete Kick It!
  • Prepare overhead and presentation on your table's problem: Spiralateral or Kick It!

Sunday, October 28, 2007

(25) DUE: Wednesday, Nov. 7

  • Make your Spiralaterals.
  • Come up with conjectures.
  • Try to explain why these spiralaterals behave this way.
  • Which sequences converge? Which diverge?
  • ENJOY.

(24) DUE: Tuesday, November 6

  • Recursion Test
  • Recursion Portfolio
  • One-3 X 5 index card for test. Both sides is fine.

(23) DUE: Monday, November 5

  • Create a Rule 110 fractal.
  • If you were not in class on Friday, you will need to get the algorithm from someone in class.
  • Start studying for recursion test
  • Get recursion portfolio ready

(22) DUE: Friday, November 2

  • Write chaos page for portfolio
  • Explain for BOTH real and complex seeds

(21) DUE: Thursday, Nov. 1

  • Write Fractal page for portrfolio
  • Explain why coastline is a fractal

(20) DUE: Wednesday, Oct. 31

  • 8.6 (1 all, 2, 3, 4, 5)
  • Use * - ? - !
  • Write Cobweb page for portfolio

(19) DUE: Tuesday, Oct. 30

  • Make table and cobweb graph for Sn = S(n-1)^2 - 2
  • Describe what occurs.

Sunday, October 21, 2007

(18) DUE: Monday, Oct 29

  • Outline 8.6 and add to today's notes
  • Do: 1, 2, 3, 4, 5
  • Do portfolio page on cobwebs

(17) DUE: Friday, Oct 26

  • Do these 4 problems completely. For each:
    • * - ? - !
    • Give mixed recursive function
    • Give TI-83 instructions
    • Write conclusion in context. For example, what happens when you increase the periodic payment? Take more medicine? etc.
  • Pg. 481 - #1 (b, c, e, f)
  • Pg.483 - #5 (a, b, d)
  • Pg. 494 - #8
  • Pg. 513 - #16 (a, b, c)
You want these to be so easy to understand that you can put them in your portfolio.

(16) DUE: Thurs, Oct 25

  • Do Koch Snowflake page
  • Read Chapter 8 Extension (pg. 504 - 507) Add to today's notes.
  • Write Fractals & Chaos portfolio page

(15) DUE: Wednesday, Oct 24

  • Notes from the field trip with 5 BIG Ah-Has! highlighted.

(14) DUE: Tuesday, October 23

  • Practice Target Practice. (Google: "target practice" fractal)
  • Practice Chaos Game (Google: "Chaos Game")
  • See you at the Sherman Union (775 Commonwealth Avenue: BU Central stop on the B line of the Green Line) at
7:45 AM sharp

Last one there gets the liquorice donuts.

Sunday, October 7, 2007

(13) DUE: Monday, October 22

Do Sierpinski Gasket Sheets

(12) DUE: Friday, October 19

  • Prepare all sequence portfolio pages except for cobweb graphs and fractals.
    • One item per page
    • DO NOT put in notes from class. Re-organize them to be more concise and easier for YOU to understand.

(11) DUE: Thursday, October 18

Study for quiz on mixed recursive functions

(9) Due: Tuesday, October 16

  • Do 8.5 (3)
    • Use * - ? - !

(8) Due: Monday, October 15

  • Outline 8.4
  • Do 8.4 (4 & 5)
    • Use * - ? - !

(7) Due: Friday, October 12

  • Do 8.3 (5 (a-c), 6, 10, 11)
    • Use * - ? - !
  • Study for quiz on 8.1 and 8.2

(6) DUE: Thursday, October 11

  • Do: 8.2 (1, 4, 5 (a - c), 13)
  • Use * - ? - !

Monday, September 24, 2007

(5) DUE: Wednesday, October 10

  • Do 8.2 (6 and 7)
    • Use * - ? - !
    • For each, give: talbe, explicit and recursive function, series of first 10 terms, differences, and degree of function
    • To be handed in for HW quiz grade

(4) DUE: Tuesday, October 9

  • Learn how to use the TI-83 calculator for:
    • Explicit formula: MODE FUNC
    • Recursive formula: MODE SEQ
    • Series: SUM
    • Sequence: SEQ(
    • Table: TLBST AUTO and ASK

(1) DUE: Wednesday, Oct. 3

  • Outline page 441 and 8.1
  • Do: 8.1 (3, 5, 6, 9, 10)

(4) DUE: Tuesday, Oct. 2

  • Critical Path Test
  • Scheduling portfolio page. Be ready to hand it in and save until we complete the Graph theory chapter

(3) DUE: Monday, Oct. 1

  • Outline 4.2
  • Do 4.2 (3, 4, 5)
  • Watch NUMB3RS. Do sheet for extra credit. Use * - ? - !

(2) DUE: Friday, Sept. 28

  • Do: 4.1 (3, 5, 7)

(1) Due: Thursday, Sept. 27

  • Do the Bin Packing sheet from NUMB3RS. If you do * - ? - !, I'll give you extra credit!

Saturday, September 15, 2007

(13) Due: Wednesday, Sept. 26

  • Study for chapter test on voting methods
  • Complete portfolio to be handed in with test. Remember this will help you study. If it is late, it is not only minus 10 points per day, but it won't help you on the test. A double BAD whammy.

(12) Due: Tuesday, Sept. 25

  • Search the web and write about the voting method used in the family's country of origin.
  • Do Review questions: 2, 3, 12, 15

(11) Due: Monday, Sept. 24

  • Create portfolio page for Arrow's Conditions and Matrices
  • Read and outline 1.5.

(10) Due: Friday, Sept. 20

  • Read and outline 1.4
  • Do: 1, 2, 3, 10

(9)Due: Thursday, Sept. 19

  • Study for test on the 5 voting methods was have learned and on sequences.
  • Create a sequence page on Recursive sequences with the notation explained and examples

(8) Due: Wednesday, Sept. 19

  • Complete algorithms.
  • Use preference schedule on page 5 (#9) for examples.

(7) Due: Tuesday, Sept. 18

  • Complete sequence sheet
  • Write portfolio pages for:
    • Plurality & Majority methods
    • Borda method
  • Use my page on the Runoff method as a model.
  • Remember the objective of a portfolio: summarize what you have learned, to be used for studying later.

Sunday, September 9, 2007

Due: Mon., Sept. 17

  • Read 1.2. Take notes.
  • Do: 1 - 7, 11, 13 with * - ? - !.
  • Be prepared to make a presentation with your group on one of the voting methods.

Due: Fri., Sept. 14

  • Read pg. 1 - 3. Take notes.
  • Do: 1:1 (1 - 10). Use * - ? - !.

Due: Wed., Sept. 12

  • Write up Billiards/Pool for a test grade. (Very important.) Use * - ? - !. Neatness counts. Be mindful of the Honesty Code.

Due: tues., Sept. 11

  • Complete finding the algorithm for the pocket the ball will go into, given the dimensions of the table. How do you get to each pocket?
  • Bring in Summer Assignment

Wednesday, September 5, 2007

Monday, September 10

  • Bring in the rest of your supplies.
  • Complete the 22-question, Learning Style survey. Note on the last question, you do not have to solve the problem. You just have to say which way you would approach it.omplete the Determining Your Results page by putting a check next to the answer you selected for each question. Find the totals for each column. We'll do the rest in class.
  • Do a "What's in a name?" Hold the paper vertically. Write you name vertically. Find a word for each letter that describes you. Decoration encouraged.

Wednesday, June 27, 2007

Due Friday, Sept. 7

  • Have your parent/guardian sign the syllabus.
  • Bring in supplies: pencil, 3-ring binder, graph paper, vis-a-vis dry erase marker, highlighter, TI-83 graphing calculator. You can buy graph paper ($1) and the vis-a-vis ($1) from me before or after school.)
  • Complete Wolves and Sheep. Answer all of the questions in complete and neat sentences. These explanations are as important as the answer.