Algorithms in GCSE computer science CY205
At GCSE level algorithms become much more complex, moving towards efficient, programmable solutions. This course examines how algorithms are modelled and constructed using decomposition and abstraction, and how they are represented. Sort and search algorithms, iteration and selection are covered, using flow diagrams and pseudocode. Teachers will take away engaging ideas to help students understand how to read and create algorithms to solve problems, recognising patterns and designing for efficiency.
If you require pre-night accommodation, contact firstname.lastname@example.org.
Meals and refreshments are included in the fees.
Course fees vary for participants outside the UK. Please contact email@example.com
- understand common algorithms and represent them in a variety of ways
- use 'unplugged' approaches to help student understanding
- learn about sequence, iteration and selection in algorithms, and how to teach this effectively