Webinar: Representing algorithms using flowcharts and pseudocode – 06/02/2023
Summary
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.
Improve 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.
Book now and you will be automatically registered for the scheduled sessions for the course. Remote CPD courses have live, Professional Development Leader-led sessions and are not available for instant access. Please refer to the schedule of dates published for each course instance.
Prior knowledge:
You’ll need to know some basic concepts and terminology to access this subject knowledge enhancement. If you are entirely new to computer science, we recommend first participating in our one-day course, An introduction to algorithms, programming and data in computer science.
Do you prefer to learn in a classroom? If so, take a look at:
Who is it for?
This course is for current or prospective teachers of computer science with some understanding of computer science fundamentals.
What topics are covered?
- 01 | Core concepts – get to grips with the fundamentals of algorithms by exploring sequencing, selection, iteration.
- 02 | Implementing core concepts – examine how the core concepts can be implemented within an algorithm.
- 03 | Flowcharts – learn how to read and write flowcharts, which can be used to represent algorithms.
- 04 | Creating your own flowchart algorithm – decompose and create your own algorithms represented as flowcharts.
- 05 | Pseudocode – learn how to read and write pseudocode, and use these to represent a range of algorithms.