Up to this point in the module you have studied each normal form on its own: atomicity and repeating groups for 1NF, partial dependencies for 2NF, and transitive dependencies for 3NF. This topic puts those pieces together into a single workflow. You start with a messy, unnormalized table — the kind that holds multiple values in one cell, repeats the same customer or product facts on many rows, and breaks when you try to insert, update, or delete a record — and you carry it step by step all the way to a set of 3NF tables.
The reason this end-to-end practice matters is that normalization in real design work is rarely one isolated decision. Each step changes the table you are working with, and the dependencies you must examine at step two are the ones left over after step one. Working through a full example also trains you to justify each decomposition: which functional dependency forced the split, which key the new table uses, and how the original data can still be reconstructed through foreign keys.
As you watch the videos below, keep a pencil moving. Write down the candidate keys at each stage, mark which attributes depend on only part of a composite key (partial dependency) and which depend on another non-key attribute (transitive dependency), and sketch the resulting tables yourself before the presenter reveals them. Afterwards, check your final schema against all three normal forms, table by table, the same way you would validate your own design in an assignment.
A roughly ten-minute walkthrough of the first three normal forms, presented as a connected progression rather than three separate rules. Based on its title and framing, expect the video to explain the reasoning behind normalization — why data is organized and connected the way it is — and then apply 1NF, 2NF, and 3NF in sequence to sample data. Pay attention to how the presenter motivates each step before performing the decomposition.
It covers the entire 1NF-to-3NF journey in one continuous explanation, which matches this topic's goal of seeing normalization as a single end-to-end process rather than isolated definitions.
A short, exercise-driven video that takes a denormalized dataset and works it into Third Normal Form, with some discussion of denormalization as a contrast. Expect a worked practice problem: identify the problems in the starting table, apply the normal forms in order, and arrive at a final set of related tables. The brief runtime makes it well suited to pausing and attempting each step yourself first.
It is explicitly a practice exercise rather than a lecture, giving you a second worked example to test the procedure you learned from the longer video, and its mention of denormalization helps you see why designers sometimes trade normalization away.
Together these videos trace the same path as the module outcomes. Both begin from a problematic, unnormalized table, which gives you concrete material for spotting insertion, update, and deletion anomalies (MO1) and for removing repeating groups and choosing a primary key on the way to 1NF (MO2). As each example moves into 2NF, you see partial dependencies on a composite key identified and split out (MO3), and the 3NF step demonstrates decomposing transitive dependencies into separate, linked tables (MO4). Because both treat the process as a continuous sequence ending in a finished schema, they also model the final validation pass — checking every resulting table against 1NF, 2NF, and 3NF before calling the design done (MO5).
These videos were chosen from YouTube on October 2, 2026. Each has captions; the player turns them on. Videos on YouTube can be changed or removed — if one no longer plays, tell your instructor. If a player does not appear, use its Watch on YouTube link.