for Kindle Fire, Apple, Android, Nook, Kobo, PC, Mac, BlackBerry ...

New to eBooks.com?

Learn more

Shapes and Spaces for Middle Primary

For 8-10 year old students

Shapes and Spaces for Middle Primary by Judy Gabrovec
Add to cart
US$ 8.40

"Shapes and Spaces for Intermediate Students" is a comprehensive blackline master activity book suitable for 8 to 10 year old children, which explores the theme of spatial language and concepts. The activities are Standards-based and provide children with the opportunity to develop spatial knowledge of: pathways mazes spatial features of everyday objects matching shapes recognizing the similarities and differences in shapes arranging shapes according to size, shapes symmetry tessellations classifying shapes using spatial features mapping ordered pairs spatial features of 3-D shapes enlarging and reducing symmetrical patterns traversable networks model making cross sections of 3-D shapes manipulating 3-D shapes

Included in the book are the templates for a variety of 3-D shapes that can be used to support the activities.

Ready-Ed Publications; June 2000
48 pages; ISBN 9781863973380
Read online, or download in secure PDF format
Title: Shapes and Spaces for Middle Primary
Author: Judy Gabrovec; Melinda Parker
 
Buy, download and read Shapes and Spaces for Middle Primary (eBook) by Judy Gabrovec; Melinda Parker today!
Excerpt

Symmetry

A shape has symmetry if both its parts match when it is folded along a line.

Cut and fold the shapes below along the fold line to see if they are symmetrical. Experiment with folding the shapes in different ways to discover which shapes have more than one line of symmetry.

(images)

Traversable Networks

A network is traversable if you can trace over it without retracing any line of the network.
These networks are traversable.

Experiment with the following shapes to discover which ones are traversable.

Using a geoboard, make your own traversable networks. Record your networks on the back of this sheet. Challenge your classmates to find the correct path around the networks. Can you find a rule that will help you work out whether a network is traversable?

Hint: The rule applies to the number of odd and even points or vertices in a network.