Assess students' ability to analyze relational schemas using functional dependencies: compute attribute closures and candidate keys, derive minimal (canonical) covers, identify violations of 1NF–3NF (including partial and transitive dependencies), and construct/prove lossless, dependency-preserving decompositions using synthesis or decomposition algorithms. Problems will require step-by-step normalization, short proofs of lossless join, and checks for dependency preservation.