Revise Computingrevisecomputing.co.uk
At a glanceFeaturesStudentsPricingHow it worksFree GCSE notesExam dates
At a glanceFeaturesStudentsPricingHow it worksFree GCSE notesExam dates

Knowledge organisers / Designing, creating and refining algorithms

Structure diagrams

All topicsPractise exam questions
Knowledge organiser

Designing, creating and refining algorithms

2.1.2b

Produce simple diagrams to show:The structure of a problem, Subsections and their links to other subsections

What you need to know

Structure diagrams are visual representations that show how a problem can be broken down into smaller sub-problems. They use a tree-like hierarchy where the main problem is at the top and each level below breaks it into smaller tasks. This is a direct application of decomposition and helps plan the design of a program before writing code.

Key points

  • Structure diagrams show the hierarchy of a problem broken into sub-problems.
  • The main problem sits at the top, with sub-problems branching below it.
  • Each sub-problem can be further broken down into even smaller tasks.
  • They help visualise how different parts of a program relate to each other.
  • Structure diagrams are useful for planning before writing pseudocode or program code.
  • They are a direct application of the decomposition principle of computational thinking.
  • Exam Tip:You may be asked to complete a structure diagram by placing tasks into boxes. Read the scenario carefully to identify which tasks belong at each level.
  • Example: Parents' Evening App → Log in, Book appointment, View appointments (→ On-screen, Print), Update details.