Teacher resources and professional development across the curriculum

Teacher professional development and classroom resources across the curriculum

Monthly Update sign up
Mailing List signup
Search
MENU
Learning Math Home
Data Session 10, Grades K-2: Solutions
 
Session 10 Session 10 K-2 Part A Part B Part C Part D Homework
 
Glossary
Data Site Map
Session 10 Materials:
Notes
Solutions
 

A B C D

Video

Solutions for Session 10, Part C

See solutions for Problems: C1 | C2 | C3


Problem C1

Here are two possible answers:

a. 

Ms. Sabanosh encouraged students to make inferences and predictions by asking them to think about how many raisins would be in one of the unopened boxes.

b. 

When the students discussed what would not be good guesses about the number of raisins in a box, they clearly suggested numbers that were not likely.

<< back to Problem C1


 

Problem C2

Answers will vary. One example of a question is, "If I went to the store and bought a different brand of raisins, but the same size box, how many raisins do you think would be in that box?"

<< back to Problem C2


 

Problem C3

Two conjectures that might result are, "A small [half-ounce] box of raisins cannot contain 100 raisins" and "A small box of raisins will contain between 14 and 35 raisins." These could be formulated as the following question to be investigated: "What is the smallest and largest number of raisins that a box can hold?" The students could investigate this question by obtaining additional half-ounce boxes of raisins of the same brand, then counting the number of raisins in each box, and finally adding this information to their line plot. An extension would then be to count and analyze the number of raisins in half-ounce boxes of other brand names.

<< back to Problem C3


 

Learning Math Home | Data Home | Register | Glossary | Map | ©

Session 10, Grades K-2: Index | Notes | Solutions | Video

Home | Catalog | About Us | Search | Contact Us | Site Map

  • Follow The Annenberg Learner on Facebook

© Annenberg Foundation 2013. All rights reserved. Privacy Policy