Skip to content
Official PYQ · 2026

GATE CS 2026 Set 1 Q21 — Normal Forms

Explain with AI

In the context of relational database normalization, which of the following statements is/are true?

Select all correct options
View worked solution

Answer: A;B;C

Let us analyze each statement individually:

  • Statement A: It is always possible to obtain a dependency-preserving 3NF3\text{NF} decomposition of a relation.
    True. By using the 3NF3\text{NF} synthesis algorithm, we can always decompose any relation schema into a set of relations that are in 3NF3\text{NF} while guaranteeing both the lossless-join property and dependency preservation.

  • Statement B: It is always possible to obtain a dependency-preserving 1NF1\text{NF} decomposition of a relation.
    True. 1NF1\text{NF} only requires that all attribute values are atomic. Since any relation can be represented in 1NF1\text{NF} without losing any functional dependencies (the original relation itself with atomic attributes is already in 1NF1\text{NF} and preserves all its dependencies), a dependency-preserving 1NF1\text{NF} decomposition is always trivially possible.

  • Statement C: It is not always possible to obtain a dependency-preserving BCNF decomposition of a relation.
    True. While a lossless-join BCNF decomposition is always possible, dependency preservation is not guaranteed.
    Counterexample: Consider the relation R(A,B,C)R(A, B, C) with functional dependencies:AB→C,C→AAB \rightarrow C, \quad C \rightarrow AHere, the candidate keys are ABAB and BCBC. The dependency C→AC \rightarrow A violates BCNF because CC is not a superkey. Any BCNF decomposition (such as R1(A,C)R_1(A, C) and R2(B,C)R_2(B, C)) will fail to preserve the dependency AB→CAB \rightarrow C.

  • Statement D: It is not always possible to obtain a dependency-preserving 2NF2\text{NF} decomposition of a relation.
    False. Every relation in 3NF3\text{NF} is also in 2NF2\text{NF} by definition (since 3NF3\text{NF} is a stricter normal form). Since we can always obtain a dependency-preserving 3NF3\text{NF} decomposition (as established in Statement A), that same decomposition is guaranteed to be in 2NF2\text{NF} and preserve all dependencies. Thus, it is always possible to obtain a dependency-preserving 2NF2\text{NF} decomposition.

Therefore, statements A, B, and C are true.

Free practice · Your answers on this page are not saved.

Published
Report a correction
Keep exploringMore Normal Forms questions