Representing algorithms using flowcharts and pseudocode for AQA specification
CP420B Live remote training course
Improve your knowledge of algorithms whilst referencing the current AQA GCSE computer science specification. Become confident in using the key building blocks of sequence, selection and iteration, and learn to apply algorithmic thinking.
Skip to course bookingAn 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 AQA 8525 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 AQA 8525 GCSE 9-1 Computer Science specification. If you’re not delivering the AQA specification, an OCR or agnostic version of this course is also available.
Topics covered
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.
Outcomes
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
This course is part of the KS3 and GCSE Computer Science subject knowledge certificate
Key stage 3 and GCSE Computer Science certificate
Our certificate is designed to help you develop or refresh your computer science subject knowledge.
Book this course
You need to be logged in to start the course.
Adapted teaching and effective learning interventions in secondary computing
Develop an evidence-informed approach to education recovery over a sustained period, securing the computing education of young people following a period of great disruption.
Adapting the Teach Computing Curriculum for mixed-year classes - short course
Explore progression within Teach Computing Curriculum and how to use this to adapt it for your own mixed-age setting.
AI and Ethics in GCSE computer science
Artificial intelligence, what is it? How does it work? What are the ethical considerations for GCSE students. How could you teach it to your students?