IAE Academy

GATE 2026 CS1 Q.31: solution and answer

GATE 2026 · CS1Q.31 · 1 mark · MSQ

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

  1. (A)

    It is always possible to obtain a dependency-preserving 3NF decomposition of a relation

  2. (B)

    It is always possible to obtain a dependency-preserving 1NF decomposition of a relation

  3. (C)

    It is not always possible to obtain a dependency-preserving BCNF decomposition of a relation

  4. (D)

    It is not always possible to obtain a dependency-preserving 2NF decomposition of a relation

See the question in the paper

Answer and solution

ANSWER

The true statements are A, B and C.

Official answer: A, B, CSource: Official answer key, GATE 2026 CS1 (IIT Guwahati)

  1. (A) The 3NF synthesis algorithm starts from a minimal cover, makes one relation per functional dependency (merging those with the same left side), and adds a relation holding a candidate key if none is present. The result is lossless and dependency-preserving, so (A) is true.

  2. (B) Every relation in the relational model has atomic attribute values, so it is already in 1NF. The trivial decomposition, the relation itself, is in 1NF and preserves every dependency. A dependency-preserving 1NF decomposition therefore always exists, and (B) is true.

  3. (C) Take with and . The candidate keys are and . The dependency violates BCNF because is not a superkey. The only lossless BCNF decomposition is and , since the other two splits of a three-attribute relation, and , share an attribute that determines neither side. That decomposition cannot enforce locally, because and are in different relations. So a dependency-preserving BCNF decomposition does not always exist, and (C) is true.

  4. (D) Every 3NF relation is also in 2NF. By (A), a dependency-preserving 3NF decomposition always exists, and it is also a dependency-preserving 2NF decomposition. So it is always possible, the statement that it is not always possible is false, and (D) is false.

  5. Hence the true statements are A, B and C.

KEY IDEA

A lossless, dependency-preserving 3NF decomposition always exists, so the same holds for the weaker 2NF and 1NF. BCNF can lose dependencies, for example in with and .

WATCH OUT FOR

Assuming BCNF decomposition can always preserve dependencies, as 3NF synthesis does. Or reading (D) as true, forgetting that 2NF is weaker than 3NF, so the 3NF guarantee carries over.

From the GATE 2026 CS1 paper. Every question of this paper · Download the full paper · All 19 Normal forms questions, with notes

More Normal forms questions