📁 Topic 1 · 1.1 Algorithms
1.1b Representing algorithms — flowcharts
Edexcel 4CP0 · iGCSE Computer Science · ~9 min read
Notes
──
Video
──
Slides
──
Worksheet
──
Quiz

What is a Flowchart?

A flowchart is a visual diagram used to represent an algorithm. Each step is shown as a shape connected by arrows that show the direction of flow. Flowcharts make it easier to visualise the logic of an algorithm, especially selection and iteration.

Flowchart Symbols

The Edexcel 4CP0 specification requires you to know and use the following standard flowchart symbols:

Symbol ShapeNamePurpose
Rounded rectangle (oval)TerminalMarks the START or END of the algorithm
RectangleProcessA calculation or assignment, e.g. SET total TO total + num
ParallelogramInput / OutputReceiving data from the user or displaying a result
DiamondDecisionA YES/NO question; the flow branches into two paths
ArrowFlow lineShows the direction / order of steps

Representing Selection in a Flowchart

A decision (diamond) symbol has one entry arrow and two exit arrows labelled YES and NO (or TRUE/FALSE). The algorithm follows one path if the condition is true, and the other if it is false.

Example: A flowchart to check if a number is positive:

  1. START (terminal)
  2. RECEIVE number from user (parallelogram)
  3. Is number > 0? (diamond) → YES → SEND "Positive" (parallelogram) → END
  4. NO → SEND "Not positive" (parallelogram) → END

Representing Iteration in a Flowchart

A loop is shown by an arrow that goes backwards (upwards or sideways) from a later step back to an earlier step, creating a cycle. The decision diamond acts as the loop condition.

Count-controlled loop: A counter variable is incremented each time round. The decision checks if the counter has reached the target.

Condition-controlled loop: The decision checks a condition (e.g. "Has the user entered -1?"). The loop repeats until the condition is true (or false).

Reading Flowcharts

To interpret a flowchart: start at the START terminal, follow the arrows, and trace variable values through process boxes and decision branches. At each diamond, evaluate the condition to decide which path to follow.

📝 Exam Tip: In Paper 1, you may be asked to "complete the flowchart" (draw a missing symbol or add arrows) or "trace the flowchart" for a given input. Always label decision exits YES/NO — an unlabelled diamond loses marks.
⚠️ Common Mistakes
  • Using a rectangle for input/output — it must be a parallelogram
  • Forgetting to label the YES and NO exits of a decision diamond
  • Drawing loops that flow forward instead of looping back to an earlier step
  • Missing the START or END terminal
← 1.1a What are algorithms? Topic 1 · 1.1 Algorithms Next: 1.1c Pseudocode →
🔒
Pro Content
Subscribe to access all 47 Edexcel iGCSE lessons.
£7.99/month
or £59/year