Algorithms in GCSE computer science CY205 / A17
Summary
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 enquiries@stem.org.uk.
Meals and refreshments are included in the fees.
Course fees vary for participants outside the UK. Please contact enquiries@stem.org.uk
"All sessions were useful and increased my understanding of the subject, sufficient enough that I could teach the topic confidently."
"provided me with a good subject knowledge of the different sorting algorithms and the difference between them"
Past participants
Outcomes
- 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
Sessions
| Date | Time | Location | |
|---|---|---|---|
| Teaching algorithms for GCSE computer science | 08 May 2018 | 09:30-16:30 | National STEM Learning Centre |
Actions
Fees & Subsidies
Additional information
Would you like this course delivered at your school? Contact enquiries@stem.org.uk to find out more.
Interested in this course?
Sign up to receive our emails to hear about the latest CPD available