In IB Computer Science, normalisation is the kind of topic that feels like it should be simple… until you try explaining it under exam pressure. You remember the names (1NF, 2NF, 3NF). You might even remember a definition. But the marks usually go to the student who can calmly answer the real question: what problem is normalisation solving, and how does it solve it?

Normalisation in IB Computer Science (what it actually means)
Normalisation is the process of organising data in a relational database so the structure is logical and reliable. In IB Computer Science, you can think of it as designing tables so that:
-
each fact is stored in the right place
-
duplication is reduced
-
consistency is easier to maintain
-
changes don’t create accidental errors
Practically, normalisation usually means splitting one messy table into smaller tables and connecting them using primary keys and foreign keys.
If you want a wider map of the database unit alongside normalisation, keep this open while you revise: The Best Way to Revise Databases for IB Computer Science.
Quick checklist: what to say in exam answers
When an IB Computer Science question asks about normalisation, aim to include:
-
a purpose statement (reduce redundancy, improve integrity)
-
one anomaly (update, insertion, deletion)
-
mention of splitting tables + linking with keys
-
a quick reference to 1NF/2NF/3NF goals (not long theory)
To practise phrasing under time pressure, use the Databases Questionbank on RevisionDojo and self-check against mark-scheme style wording.
Why normalisation exists: anomalies (the exam-friendly reason)
Without normalisation, databases tend to create anomalies. This is the easiest way to explain “why” in IB Computer Science.
Update anomaly
The same fact is stored in more than one place, and you update one copy but forget the other. Now the database contradicts itself.
Insertion anomaly
You can’t add a new piece of information without adding unrelated data. The table structure blocks you.
Deletion anomaly
You remove a record, and accidentally lose a fact you still needed because it was only stored there.

Normalisation reduces these risks by enforcing a cleaner structure: one fact, one place.
The three normal forms you need (1NF to 3NF)
In IB Computer Science, normal forms are not about memorising fancy language. They’re about showing you understand what “better structure” looks like.
First Normal Form (1NF): make values atomic
1NF means each field contains a single, indivisible value. No lists inside a cell. No repeating groups.
A classic example is storing multiple phone numbers in one attribute. 1NF pushes you to store each phone number as its own record or in a related table.
For a more detailed walk-through aligned to the syllabus, see A.2.10 Normalization Forms Notes.
Second Normal Form (2NF): remove partial dependency
2NF builds on 1NF and mainly matters when a table has a composite primary key. The rule is: every non-key attribute should depend on the whole key, not just part of it.
This helps cut duplication that appears when a piece of data is repeatedly copied because it only depends on one part of a combined identifier.
Third Normal Form (3NF): remove transitive dependency
3NF builds on 2NF by ensuring non-key attributes depend only on the primary key, not on other non-key fields.
In simpler terms for IB Computer Science: avoid storing a chain of facts in the same table (A determines B, and B determines C). Put C where it truly belongs.
If you want a scenario-based version (the kind that mirrors exam thinking), use A3.2.6 Constructing a Database Normalized to 3NF.
Keys: the glue that makes normalisation work
Normalisation depends on relationships, and relationships depend on keys:
-
Primary key uniquely identifies each record in a table.
-
Foreign key creates the link to another table’s primary key.
If your key vocabulary is shaky, revise the core database model alongside it in IB Computer Science Databases Notes and the DBMS and RDBMS notes.
Common student mistake: “normalisation makes databases faster”
Normalisation can sometimes make certain queries feel more complex because you may need joins. In IB Computer Science, the safer claim is this:
Normalisation primarily improves consistency and data integrity, not raw speed.

If you connect normalisation to “fewer anomalies” and “safer updates,” you’re speaking the examiner’s language.
Closing: the examiner wants the ‘why’
Normalisation in IB Computer Science is really a story about avoiding regret. When data is duplicated, reality starts to fork into competing versions, and anomalies show up at the worst time. Normalisation is how you design a database that stays consistent even when people insert, update, and delete records.
If you want to lock this down before exams, revise the notes, drill exam-style questions, and get instant feedback using RevisionDojo’s Questionbank, Study Notes, Flashcards, AI Chat, and Mock Exams. Your future self (and your database) will be calmer for it.