Turtle Snowflakes (with Scratch)
- Understand and use sequence in an algorithm
- Understand and use iteration in an algorithm (FOR and WHILE loops)
EDUCATOR: COMPUTATIONAL THINKING COMPETENCIES:
COMPUTER SCIENCE EDUCATORS:
CSTA K–12 CS Standards:
AREA OF LEARNING AND EXPERIENCE: Science and Technology:
Computation is the foundation for our digital world.
Progression step 3
- I can use conditional statements to add control and decision-making to algorithms.
- I can identify repeating patterns and use loops to make my algorithms more concise.
- I can explain and debug algorithms.
Progression step 4
- I can decompose given problems and select appropriate constructs to express solutions in a variety of environments.
- I can select and use data structures that efficiently manage data in algorithms.
- I can plan and implement test strategies to identify errors in programs.
Progression step 5
- I can identify, define and decompose problems, choose appropriate constructs and express solutions in a variety of environments.
- I can use file-handling techniques to manipulate data in algorithms.
- I can test, evaluate and improve a solution in software.
Start by sharing the following code. Ask students to make a prediction about the output from the code.
Go through each line of code (line-by-line) and explain what each line does.
Share the link to the code sample below and ask the students to modify their code to draw another regular polygon, e.g. triangle, hexagon etc.
Challenge the students to recreate one or more of the following shapes:
Explain to the students that they are going to use what they have learnt so far to draw a snowflake in Scratch.
Share the following example:
Challenge the class to see who can create the best snowflake.
For example, if the the first repeat is 6 then the last turn should be 360 / 6 = 60. Try it! :)