We’ve split the one-day Tenderfoot session for teachers on Computational Thinking (Unit 2) into two evening sessions running on Tuesday 14th and Monday 27th June, details below. You can attend either session, there is no dependency, or you can attend both.

• Session One introduces graphs and binary trees
• Session Two looks at arrays, classic and shortest path algorithms.

Session One: Tenderfoot training – Clever Stuff for Common Problems – Developing computational thinking and an understanding of data structures – Focus on Graphs and Binary Trees
Tuesday 14 June 2016, King’s College London
5-7.30pm, Waterloo Bridge Wing Room G14
Tutors: Jane Waite and Trevor Bragg
Tickets: http://community.computingatschool.org.uk/events/4134

• 02 Activity: Data structures matter (Spit not so, Knights Tour, Tour Guide)
• 03 Activity: Many problems, one solution (Map colouring)
• 06 Activity: Beauty of trees (Binary trees)

“Unplugged puzzles are used to explore abstraction, algorithms, decomposition and data structures. Activities can be used in the classroom the next day. KS3 Attainment targets : use and evaluate computational abstractions, understand several key algorithm.”
for Session One

Session Two
Monday 27 June 2016, Lambeth
[precise location and time tbc]
Tutor: Miles Berry

• 00 Activity: Peg swap puzzle
• 01 Activity: Perfect shuffle
• 04 Activity: Toy problems, real world
• 05 Activity: The oracle of bacon

[Ticket link not yet available]

“Unplugged puzzles are used to explore abstraction, algorithms, decomposition and data structures. Activities can be used in the classroom the next day. KS3 attainment targets: use and evaluate computational abstracts, understand several key algorithms.”