Stewdent.eu
โ–พ

Drawing Flowcharts

Drawing a flowchart means turning an algorithm into a clear visual diagram using the correct symbols, decision paths, and loop structures. A well-drawn flowchart communicates logic better than code alone.

Last updated: 22 March 2026

โ˜…โ˜…โ˜†โ˜†โ˜† Level 2computingalgorithmsflowchartsdesigndiagrams4 min read

Report an error

Knowing the symbols is only the first step. Drawing a flowchart that clearly communicates an algorithm takes practice and a few key techniques. A good flowchart should be easy to follow from START to END, with arrows that never leave the reader guessing.

The Golden Rules of Drawing Flowcharts

  1. Start and end with terminals โ€” every flowchart needs a START and at least one END.
  2. Use the correct symbol for each step โ€” mixing up process and I/O shapes confuses readers.
  3. Label every decision path โ€” always mark the Yes and No branches of a diamond.
  4. Flow generally top-to-bottom โ€” this is the natural reading direction; exceptions (like loop arrows) should be clearly visible.
  5. Arrows must always have arrowheads โ€” direction matters.

Drawing a Sequence Algorithm

Task: calculate the area of a rectangle.

    โ•ญโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ•ฎ
    โ”‚  START  โ”‚
    โ•ฐโ”€โ”€โ”€โ”€โ”ฌโ”€โ”€โ”€โ”€โ•ฏ
         โ†“
    โ•ฑโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ•ฒ
   โ•ฑ INPUT width  โ•ฒ
   โ•ฒ              โ•ฑ
    โ•ฒโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ•ฑ
         โ†“
    โ•ฑโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ•ฒ
   โ•ฑ INPUT height  โ•ฒ
   โ•ฒ               โ•ฑ
    โ•ฒโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ•ฑ
         โ†“
    โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”
    โ”‚ SET area โ† width ร— height โ”‚
    โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”ฌโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜
               โ†“
    โ•ฑโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ•ฒ
   โ•ฑ  OUTPUT "Area:" + area โ•ฒ
   โ•ฒ                        โ•ฑ
    โ•ฒโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ•ฑ
               โ†“
    โ•ญโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ•ฎ
    โ”‚   END   โ”‚
    โ•ฐโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ•ฏ

Drawing Selection (IF Statement)

Task: display "Pass" or "Fail" based on a score.

The decision diamond has one entry arrow and two exit arrows labelled Yes and No:

         โ†“
    โ•ฑโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ•ฒ
   โ•ฑ INPUT score  โ•ฒ
   โ•ฒ              โ•ฑ
    โ•ฒโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ•ฑ
         โ†“
    โ—‡โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ—‡
    โ”‚   Is score โ‰ฅ 50?    โ”‚
    โ—‡โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ—‡
      Yes โ†“         No โ†“
  โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”   โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”
  โ”‚OUTPUT    โ”‚   โ”‚ OUTPUT   โ”‚
  โ”‚ "Pass"   โ”‚   โ”‚  "Fail"  โ”‚
  โ””โ”€โ”€โ”€โ”€โ”ฌโ”€โ”€โ”€โ”€โ”€โ”˜   โ””โ”€โ”€โ”€โ”€โ”ฌโ”€โ”€โ”€โ”€โ”€โ”˜
       โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”ฌโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜
              โ†“
         โ•ญโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ•ฎ
         โ”‚   END   โ”‚
         โ•ฐโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ•ฏ
Note

Notice how both branches from the diamond eventually merge before the END. When drawing multiple paths, merge them cleanly using a joining point โ€” this keeps the diagram readable.

Drawing a Loop

Loops are shown by drawing an arrow that goes backwards up the diagram. This is the main exception to the top-to-bottom rule.

Task: count down from 5 to 1.

         โ†“
    โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”
    โ”‚ SET n โ† 5   โ”‚
    โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”ฌโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜
           โ†“
    โ—‡โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ—‡ โ†โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”
    โ”‚    Is n > 0?     โ”‚                 โ”‚
    โ—‡โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ—‡                 โ”‚
      Yes โ†“        No โ†“                  โ”‚
  โ•ฑโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ•ฒ    โ•ญโ”€โ”€โ”€โ”€โ”€โ•ฎ   โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ” โ”‚
 โ•ฑ OUTPUT n   โ•ฒ   โ”‚ END โ”‚   โ”‚SET nโ†n-1 โ”‚ โ”‚
 โ•ฒ             โ•ฑ  โ•ฐโ”€โ”€โ”€โ”€โ”€โ•ฏ   โ””โ”€โ”€โ”€โ”€โ”€โ”ฌโ”€โ”€โ”€โ”€โ”˜ โ”‚
  โ•ฒโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ•ฑ                   โ””โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”˜
       โ†“
  โ”Œโ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”€โ”
  โ”‚SET nโ†n-1 โ”‚
  โ””โ”€โ”€โ”€โ”€โ”ฌโ”€โ”€โ”€โ”€โ”€โ”˜
       โ””โ”€โ”€โ”€โ”€โ”€โ”€โ†’ (back up to condition diamond)
Tip

When drawing a loop, clearly show where the backwards arrow re-enters the diagram โ€” usually at the decision diamond. Use a slight curve or an explicit junction dot to make it obvious.

Common Mistakes to Avoid

MistakeFix
Unlabelled decision arrowsAlways write Yes/No on both paths
Missing START or END terminalAdd them โ€” they are mandatory
Arrows with no arrowheadAdd arrowheads to show direction
Dead-end paths that never reach ENDEvery path must lead to an END
Using rectangles for input/outputUse parallelograms instead
Warning

A decision diamond with only one exit arrow is a logic error. A condition is always either True or False โ€” both outcomes must have a defined path in your flowchart.

Practice Problems

List the shapes (in order) you would use to draw a flowchart for: start, ask the user for a number, check if the number is even, output 'even' or 'odd', then end.

Show answer
Terminal (START) โ†’ Parallelogram (INPUT number) โ†’ Diamond (Is number MOD 2 = 0?) โ†’ two branches: Parallelogram (OUTPUT 'even') and Parallelogram (OUTPUT 'odd') โ†’ both paths merge โ†’ Terminal (END).

A student draws a flowchart with a decision diamond but only draws one exit arrow. What is wrong and how do they fix it?

Show answer
A decision has exactly two outcomes (Yes and No), so it must have two exit arrows, each labelled clearly. The fix is to add the missing arrow for the other outcome and label both arrows as Yes and No.