Assess students' ability to apply normalization rules to convert relational schemas into Third Normal Form (3NF): identify candidate keys and all relevant functional dependencies, detect partial and transitive dependencies, perform a lossless, dependency-preserving decomposition into 3NF, and justify each step and resulting relations. Problems will present relations with attribute sets and FDs; students must show keys, intermediate normal-form checks, the decomposition algorithm used, and final 3NF schemas with explanation of dependency preservation and lossless join.