An understanding of algorithms is vital for success in computer science. Students need to know how algorithms are designed to solve a problem, and how these designs are represented to other humans. This course references the OCR J277 9-1 GCSE Computer Science specification.
During this course, you’ll develop your knowledge of algorithms to the level appropriate for up to GCSE teaching. Become confident in using the key building blocks of sequence, selection and iteration, and learn to apply algorithmic thinking. Explore how to construct or trace pseudocode and flowchart representations of algorithms.
Who is it for?
This course is for current or prospective teachers of computer science with some understanding of computer science fundamentals. If you’re new to computing it’s suggested you engage with the course ‘Foundation knowledge of computer science for KS3 and GCSE’.
It is advised that you should have some understanding of the OCR J277 GCSE 9-1 Computer Science specification. If you’re not delivering the OCR specification, an AQA or agnostic version of this course is also available.
01 | Core concepts – get to grips with the fundamentals of algorithms by exploring sequencing, selection, iteration.
02 | Algorithms – building upon the previous session, you’ll examine how the core concepts can be implemented within an algorithm.
03 | Flowcharts – during this session you’ll learn how to read and write flowcharts, which are one mechanism that can be used to represent an algorithm. You’ll get to grips with understanding each of the flowchart symbols and how they’re used in computing.
04 | Developing flowcharts – during this session you’ll build upon your knowledge from the previous session, you’ll decompose and create your own algorithms, based upon given problems, representing your solution as flowcharts.
05 | Pseudocode – during this session you’ll extend your knowledge further by exploring pseudocode. You’ll learn how to read and write pseudocode, before creating your own algorithmic solutions using pseudocode.
How long is this course?
This course is approximately 6 hours in duration, split across multiple sessions.
How will you learn?
Scheduled live, interactive online sessions led by an experienced practitioner. Flexible Professional Development Leader-supported, participant-led sessions, involving deep exploration of the subject content. The course will model teaching approaches that can be taken back to the classroom.
By the end of this CPD package you will:
- Learn the key building blocks of algorithms to be executed using a computer
- Analyse problems and design algorithmic solutions
- Represent algorithms using pseudocode and flowcharts
- Gain confidence in tracing and improving algorithms
- Take away activities and teaching practice to use in your classroom