In the context of relational database normalization, which of the following statements is/are true?
Solution :
The correct statements are:
1. It is always possible to obtain a dependency-preserving 3NF decomposition of a relation
2. It is always possible to obtain a dependency-preserving 1NF decomposition of a relation
3. It is not always possible to obtain a dependency-preserving BCNF decomposition of a relation
Let us analyze each statement step-by-step:
1. Dependency Preservation in 3NF (Third Normal Form):
For any relational schema and a set of functional dependencies , there is a standard algorithm (often called the 3NF Synthesis Algorithm) that guarantees a decomposition into schemas such that:
• Each is in 3NF.
• The decomposition is lossless-join.
• The decomposition preserves all functional dependencies in (i.e., the union of the projections of onto each is equivalent to ).
Thus, a dependency-preserving 3NF decomposition is always possible.
2. Dependency Preservation in 1NF (First Normal Form):
First Normal Form (1NF) only requires that the domain of each attribute contains only atomic values and that the value of each attribute in a tuple is a single value from its domain. It does not impose any restrictions on functional dependencies. Since a relation is already in 1NF or can trivially be decomposed/flattened into 1NF without losing any attributes or functional dependencies, obtaining a dependency-preserving 1NF decomposition is always possible.
3. Dependency Preservation in BCNF (Boyce-Codd Normal Form):
Boyce-Codd Normal Form is stricter than 3NF. It requires that for every non-trivial functional dependency , the determinant must be a superkey. Due to this strict requirement, we cannot always guarantee dependency preservation.
For example, consider the relation with functional dependencies:
Here, the candidate keys are and . The dependency violates BCNF because is not a superkey. If we decompose the relation to satisfy BCNF, we get and . However, in this decomposition, the functional dependency cannot be checked within any single decomposed relation without performing a join. Hence, the dependency is lost. This proves that it is not always possible to obtain a dependency-preserving BCNF decomposition.
Completely free for students. Educators & coaching institutes get 2 months free Pro trial to create tests.
Access unlimited practice questions, detailed step-by-step solutions, and exam study materials — completely free for students.
Create and conduct professional online assessments with AI question generation, tab proctoring, and comprehensive batch management.
Prepare for GATE 2026 Civil Engineering with the latest question papers, previous year papers, detailed solutions, syllabus, exam pattern, preparation tips, mock tests, and subject-wise study material. Download GATE 2026 CE question papers with solutions in PDF format and boost your preparation for top engineering institutes and PSU recruitment.
Prepare effectively for GATE 2026 Electronics & Communication Engineering (EC) with this comprehensive Question Paper with Solutions. This resource includes detailed explanations, concept-wise solutions, previous year paper analysis, and exam-oriented practice to help aspirants strengthen core subjects like Electronic Devices, Analog Circuits, Digital Circuits, Signals & Systems, Network Theory, Control Systems, Electromagnetics, Communications, and more. Perfect for revision, self-assessment, and boosting your GATE 2026 EC preparation strategy.
Copyright © 2026 Combe Labs Private Limited. All Rights Reserved.