Normalization in Database Design- Practice Questions Answered Correctly Latest Update 2025 (Already
Passed)
Good Relational Design - Answers Minimizes redundancy and avoids null values.
Functional Dependency - Answers Attribute value determines another attribute value.
Decomposition - Answers Breaking a relation into smaller relations.
Lossy Decomposition - Answers Information loss occurs when reconstructing original relation.
Lossless Decomposition - Answers No information loss when combining decomposed relations.
Normalization Theory - Answers Process of organizing data to reduce redundancy.
Legal Instance - Answers A relation instance satisfying all constraints.
Closure of Functional Dependencies - Answers Set of all functional dependencies implied by F.
Superkey - Answers Set of attributes uniquely identifying a relation.
Candidate Key - Answers Minimal superkey uniquely identifying a relation.
Trivial Functional Dependency - Answers Dependency satisfied by all relation instances.
Dependency Preservation - Answers Ability to test constraints efficiently after decomposition.
Atomic Domains - Answers Values in a relation must be indivisible.
First Normal Form (1NF) - Answers All attributes must contain atomic values.
Functional Dependency Theory - Answers Rules governing relationships between attributes.
Multivalued Dependency - Answers One attribute determines multiple values of another.
Decomposition Algorithms - Answers Methods for breaking relations based on dependencies.
More Normal Form - Answers Advanced normalization beyond standard forms.
Modeling Temporal Data - Answers Representing data that changes over time.
Example of Lossless Decomposition - Answers R = (A, B, C) decomposed into R1 and R2.
Functional Dependency Example - Answers B → A holds; A → B does not.
Decomposition Criteria - Answers Must maintain lossless and dependency preservation.
Reconstruction of Relations - Answers Combining decomposed relations to retrieve original.
Constraints on Legal Relations - Answers Rules that must be satisfied by relation instances.
, ID Uniqueness - Answers Each student and instructor has a unique ID.
Department Budget - Answers Each department has a single budget value.
Information Loss - Answers Occurs during lossy decomposition of relations.
Boyce-Codd Normal Form (BCNF) - Answers A schema where every FD's left side is a superkey.
Lossless Join - Answers Decomposition that allows original data recovery.
Third Normal Form (3NF) - Answers A schema where every FD meets specific conditions.
Redundancy - Answers Unnecessary repetition of data within a database.
Null Value - Answers Represents missing or undefined data in a table.
Higher Normal Forms - Answers Normal forms beyond BCNF, like Fourth Normal Form (4NF).
Armstrong's Axioms - Answers Rules for inferring all functional dependencies in F.
Reflexive Rule - Answers If β is a subset of α, then α → β holds.
Augmentation Rule - Answers If α → β, then γα → γβ holds for any γ.
Transitivity Rule - Answers If α → β and β → γ, then α → γ holds.
Schema - Answers Structure that defines the organization of data.
Functional Dependency Set (F) - Answers Collection of functional dependencies in a schema.
Instance Table - Answers Actual data representation of a schema.
Decomposing a Schema - Answers Process of splitting a schema to achieve normalization.
Anomalies - Answers Issues arising from data redundancy in databases.
BCNF Violation - Answers Occurs when a non-superkey functionally determines attributes.
Dependency-Preserving Decomposition - Answers Decomposition that retains all original functional
dependencies.
Example Schema - Answers A specific arrangement of attributes for demonstration.
Department Advisor Schema - Answers Schema representing advisors for different departments.
In_Dep Schema - Answers Schema containing instructor and department details.
Repetition of Information - Answers Duplicating data entries within a table.
Closure of F - Answers Set of all functional dependencies implied by F.
Passed)
Good Relational Design - Answers Minimizes redundancy and avoids null values.
Functional Dependency - Answers Attribute value determines another attribute value.
Decomposition - Answers Breaking a relation into smaller relations.
Lossy Decomposition - Answers Information loss occurs when reconstructing original relation.
Lossless Decomposition - Answers No information loss when combining decomposed relations.
Normalization Theory - Answers Process of organizing data to reduce redundancy.
Legal Instance - Answers A relation instance satisfying all constraints.
Closure of Functional Dependencies - Answers Set of all functional dependencies implied by F.
Superkey - Answers Set of attributes uniquely identifying a relation.
Candidate Key - Answers Minimal superkey uniquely identifying a relation.
Trivial Functional Dependency - Answers Dependency satisfied by all relation instances.
Dependency Preservation - Answers Ability to test constraints efficiently after decomposition.
Atomic Domains - Answers Values in a relation must be indivisible.
First Normal Form (1NF) - Answers All attributes must contain atomic values.
Functional Dependency Theory - Answers Rules governing relationships between attributes.
Multivalued Dependency - Answers One attribute determines multiple values of another.
Decomposition Algorithms - Answers Methods for breaking relations based on dependencies.
More Normal Form - Answers Advanced normalization beyond standard forms.
Modeling Temporal Data - Answers Representing data that changes over time.
Example of Lossless Decomposition - Answers R = (A, B, C) decomposed into R1 and R2.
Functional Dependency Example - Answers B → A holds; A → B does not.
Decomposition Criteria - Answers Must maintain lossless and dependency preservation.
Reconstruction of Relations - Answers Combining decomposed relations to retrieve original.
Constraints on Legal Relations - Answers Rules that must be satisfied by relation instances.
, ID Uniqueness - Answers Each student and instructor has a unique ID.
Department Budget - Answers Each department has a single budget value.
Information Loss - Answers Occurs during lossy decomposition of relations.
Boyce-Codd Normal Form (BCNF) - Answers A schema where every FD's left side is a superkey.
Lossless Join - Answers Decomposition that allows original data recovery.
Third Normal Form (3NF) - Answers A schema where every FD meets specific conditions.
Redundancy - Answers Unnecessary repetition of data within a database.
Null Value - Answers Represents missing or undefined data in a table.
Higher Normal Forms - Answers Normal forms beyond BCNF, like Fourth Normal Form (4NF).
Armstrong's Axioms - Answers Rules for inferring all functional dependencies in F.
Reflexive Rule - Answers If β is a subset of α, then α → β holds.
Augmentation Rule - Answers If α → β, then γα → γβ holds for any γ.
Transitivity Rule - Answers If α → β and β → γ, then α → γ holds.
Schema - Answers Structure that defines the organization of data.
Functional Dependency Set (F) - Answers Collection of functional dependencies in a schema.
Instance Table - Answers Actual data representation of a schema.
Decomposing a Schema - Answers Process of splitting a schema to achieve normalization.
Anomalies - Answers Issues arising from data redundancy in databases.
BCNF Violation - Answers Occurs when a non-superkey functionally determines attributes.
Dependency-Preserving Decomposition - Answers Decomposition that retains all original functional
dependencies.
Example Schema - Answers A specific arrangement of attributes for demonstration.
Department Advisor Schema - Answers Schema representing advisors for different departments.
In_Dep Schema - Answers Schema containing instructor and department details.
Repetition of Information - Answers Duplicating data entries within a table.
Closure of F - Answers Set of all functional dependencies implied by F.
