Representing algorithms using flowcharts and pseudocode - ITT Invitation Only CA420 / B02

Start date
1 Jun 20
Duration
5 Hours
Location
Virtual, Adobe Connect, Remote delivered CPD View on Google Map

Summary

Overview

An understanding of algorithms is vital for success in GCSE 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 GCSE teaching. Become confident in using the key building blocks of sequence, selection and iteration, and learn to apply algorithmic thinking. See what’s expected for GCSE examinations by different awarding bodies, and understand 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, facilitator-led sessions and are not available for instant access. Please refer to the schedule of dates publised for each course instance.

Who is it for?

This course is for current or prospective teachers of GCSE computer science with some understanding of computer science fundamentals.

 

Prior knowledge

You’ll need to know some basic concepts and terminology to access this GCSE-level 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 GCSE computer science. 

 

What does it cost?

This course is fully funded for participants from maintained schools in England. If you are from an independent school or from an organisation outside England, then the course fee is £220.

 

Course units

  • 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.

 

How will you learn?

Scheduled live, interactive online sessions led by an experienced practitioner. Flexible facilitator-supported, participant-led sessions, involving deep exploration of the subject content.

 

How long is the course?

This course is approximately 5 hours in duration, split across several days.

 

Outcomes

Learning outcomes

  • 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.

 

Sessions

DateTimeLocation
Representing algorithms using flowcharts and pseudocode - RD01 June 202010:00-11:00Virtual
Representing algorithms using flowcharts and pseudocode - RD02 June 202010:00-11:00
Representing algorithms using flowcharts and pseudocode - RD03 June 202010:00-11:30Virtual

Share with your CPD booker