Monday, October 31, 2011
Monday, October 31st:
Friday, October 28, 2011
Friday, October 28th:
Thursday, October 27, 2011
classes/HW 10/27/11
A&W-orienteering
science- review of genes and chromosomes and transcription and translation
reading workshop- intro to reading workshop,
HW: goals for RW(asap), letter to Sally(next thursday), sign up for GoodReads(talk to Sally)
Wednesday, October 26, 2011
classes/HW for 10/25/2011
HW: paper on a time someone has expected you to do something
art: working on your project
wednsday workshops
Yay...Reading Workshop Begins Tomorrow! (10.27.11)
• WOD Journal
(We'll always begin RW with WOD!)
• Your "Reading Workshop Journal"
(one of the several you were asked to buy and bring in your summer supply list.)
• Your computer
(We'll officially sign in to "GoodReads" at the beginning of RW.)
• The book you're in the process of reading...if that fits.
(If you're not reading something at the moment, that's FINE...we'll find something interesting for you to dive into.)
Can't wait to see you there!
Sally
Tuesday, October 25, 2011
classes/HW for 10/25/2011
Math: 1,2 step--- table to equation.
AW: orienteering
spanish: "the people" (nurse, police, musician, etc.)
HW: entrada, word search(due halloween,) and labling "los lugares" vocab words(due halloween)
humanities:"toddlers and tiaras" video.
HW: toddlers and tiaras Qs due fri., newspaper article summary due wed. two journal entries due fri.
science: translation and transcription of mDNA
Monday, October 24th:
Wednesday, October 19, 2011
Next Schools Form
Tuesday, October 18, 2011
POW #2
A student is playing a game that begins with three coins, each with heads showing. At each turn, the student turns over exactly two of the three coins.
a. After the first turn, how many heads are showing? b. Suppose an odd number of heads are showing. Explain why taking one
turn cannot produce an even number of heads.
c. Using the result from part (b), explain why the student will never get exactly 2 heads showing.
Cover Me
Two FBI agents arrive at a dangerous junkyard, at position K. As a shootout ensues, they receive a local map on their cell phones. The circles represent regions of safety. If one agent stays on a colored circle, and covers for their partner, then the partner may safely run along paths of that color. In order to apprehend the suspect, both agents must arrive safely at circle I. For example, KK (start with two agents on K) - KP (agent on yellow K covers for partn
er's run on yellow path) - AP (agent on yellow P covers for partner's run on yellow path) - AF (agent on red A covers for partner's run on red path) - AA (agent on red A covers for partner's run on red path) - AB. But this seems to be a dead end. Can you guide the two agents to I, safely? Write the steps out below the picture.