Flowcharts

Create, interpret, correct, complete, and refine algorithms using: Flowcharts

2.1.2 Designing, creating and refining algorithms

Designing, creating and refining algorithms — Note 4 of 7

Complete, write or refine an algorithm

What you need to know

Flowcharts are diagrams that use standard symbols and shapes to represent the steps and decision-making processes of an algorithm. Each shape has a specific meaning, and arrows show the flow of the algorithm from start to finish. You must know the standard flowchart symbols and be able to create, interpret, and complete flowcharts.

What to know

Terminal (oval): marks the Start or Stop of an algorithm.
Process (rectangle): represents an operation or calculation being performed.
Input/Output (parallelogram): represents data being entered or displayed.
Decision (diamond): represents a Yes/No or True/False question, leading to different paths.
Sub-program (rectangle with double vertical lines): refers to a predefined function or procedure.
Lines/Arrows: connect symbols and show the direction of flow through the algorithm.
Flowcharts make it easy to visualise the logic of an algorithm, especially selection and iteration.

Exam technique

Tip:Decision boxes MUST be labelled with True/False or Yes/No on each branch — missing labels lose marks.
Tip:All paths must connect properly — start at Start and end at Stop. No 'dangling' boxes.
Tip:Use parallelograms for BOTH input AND output — not just input.

Ready to test yourself?

Practise 2.1.2 questions

← Previous notePseudocode2.1.2 Designing, creating and refining algorithms Next note →Reference language/high-level programming language2.1.2 Designing, creating and refining algorithms

Back to Designing, creating and refining algorithms

Revise another OCR GCSE topic: Searching and sorting algorithms, Computational Thinking