Metadata
Technology & Computer Science Any Level Apply Medium-
Subject
Technology & Computer Science
-
Education level
Any Level
-
Cognitive goals
Apply
-
Difficulty estimate
Medium
-
Tags
normalization, relational databases, 1NF, 2NF, 3NF, functional dependencies
-
Number of questions
5
-
Created on
-
Generation source
-
License
CC0 Public domain
-
Prompt
Assess students' ability to apply normalization (1NF–3NF) by identifying repeating groups, candidate keys, partial and transitive dependencies, and decomposing relations into 1NF, 2NF, and 3NF. Require justification for each decomposition step, show resulting relation schemas and functional dependencies, and evaluate lossless-join and dependency-preservation trade-offs. Include a short denormalized sample table to normalize.
Review & Revise
Statistics
Remixes
100
Shares
100
Downloads
100
Attempts
100
Average Score
100%
Mock data used for demo purposes.