Master flowcharting standards for Cambridge IGCSE (0478/0984), O-Level (2210), and International A-Level (9618) Paper 2 exam questions. Convert algorithms between code and visual logic seamlessly.
Flowcharts are graphical representations of algorithms that use standardized geometric shapes connected by directional flowlines. Cambridge examiners require exact adherence to standard shapes, and marks are penalized when students confuse rectangles with parallelograms or omit decision branch labels.
Purpose: Indicates the exact beginning (Start) or termination (Stop / End) of an algorithm or subroutine.
Cambridge Exam Rule: Every complete flowchart must have exactly one Start terminator and at least one Stop terminator. Flowlines never enter a Start node and never exit a Stop node.
Purpose: Represents receiving data from the user or sensor (INPUT Score, READFILE) or outputting data to a screen or printer (OUTPUT "Accepted", WRITEFILE).
Cambridge Exam Rule: Always specify the action keyword (e.g., INPUT or OUTPUT) inside the parallelogram to earn full credit on Paper 2 mark schemes.
Purpose: Represents arithmetic calculations, variable assignments (Count ← Count + 1), and data manipulation in memory.
Cambridge Exam Rule: Must have sharp right-angle corners. Never draw a process box with rounded corners, as examiners may confuse it with a terminator.
Purpose: Represents a condition evaluation resulting in a boolean choice (Is Mark >= 50?, Count < 10).
Cambridge Exam Rule: Must have exactly two outgoing flowlines, each clearly labelled (e.g., Yes/No or True/False). Unlabelled branches forfeit marks immediately.
Purpose: Represents a modular subroutine, procedure, or function call (CALL CalculateTax()) defined elsewhere in the codebase.
Cambridge Exam Rule: Indicated by vertical bars on both left and right edges. Used in A-Level (9618) and advanced IGCSE modular programming questions.
Purpose: Directs the execution flow between operations. Conventionally flows top-to-bottom and left-to-right.
Cambridge Exam Rule: Arrowheads are strictly mandatory. Bare lines without arrows are ambiguous and will be penalized in Paper 2.
Every algorithm consists of three fundamental control constructs: Sequence, Selection, and Iteration. Translating pseudocode into a clean flowchart requires mapping each control construct to standard geometric node structures:
Sequential statements execute in linear descending order. A series of pseudocode assignments (Total ← 0) and user interactions (INPUT Value) map to connected rectangles and parallelograms flowing vertically.
An IF condition THEN ... ELSE ... ENDIF construct maps to a Decision Diamond. The condition is placed inside the diamond. The True / Yes branch flows into one path of operations, while the False / No branch executes the alternative path before both branches rejoin at a single common flowline.
Pre-condition loops (WHILE condition DO ... ENDWHILE) place the Decision Diamond at the beginning of the loop body: if the condition is True, the body executes and loops back above the diamond; if False, it exits immediately. Post-condition loops (REPEAT ... UNTIL condition) execute the loop body first, placing the decision diamond at the bottom: if False, the flowline loops back to the top of the body; if True, it terminates.
Analysis of Cambridge examiner reports (0478 and 9618) reveals recurrent mistakes where students lose easy marks on flowchart questions:
Whenever drawing a diamond, both exit paths must be clearly labelled (e.g. Yes and No). If an examiner cannot determine which path corresponds to the True condition, zero marks are awarded for the selection construct.
Using a rectangular box for INPUT Score or OUTPUT "Passed" is an automatic mark deduction. You must use a tilted parallelogram for any operation communicating with hardware, keyboard, screen, or files.
In count-controlled or sentinel-controlled loops, the loop counter (e.g., Index ← Index + 1) must be updated inside the loop body before the flowline returns to the decision diamond. Forgetting this process node creates an infinite loop.
PseudoStudio's interactive flowchart maker gives computer science students and educators a professional algorithm visualization environment right in the browser:
Connect tool, click the origin shape, and drag to the target shape to produce clean orthogonal flow arrows.▶ Convert to generate the flowchart automatically.Tidy button to auto-align nodes vertically and horizontally with balanced spacing.Yes, PseudoStudio's flowchart editor is 100% free with no trial limits, no account signups required, and no watermarks placed on exported PNG or SVG images.
Yes! Type or paste your Cambridge IGCSE (0478) or A-Level (9618) pseudocode into the side editor window and click the "Convert" button. The parser analyzes your sequence, IF statements, and loops, automatically rendering the corresponding flowchart nodes and arrows.
Pseudocode is structured text that uses plain English keywords (such as IF, WHILE, DECLARE) following programming syntax rules. A flowchart is a visual diagram that uses standardized geometric symbols (diamonds, rectangles, parallelograms) to display the sequence of operations. Both describe the same logic, and Cambridge exams frequently test students on converting between them.
Follow the directional flowlines starting from the Start terminator. As you pass through process rectangles and input parallelograms, record variable values in the corresponding columns of your trace table row by row, updating cells only when values change.