IAE Academy

GATE 2025 CS1 Q.47: solution and answer

GATE 2025 · CS1Q.47 · 2 marks · MSQ

Consider a relational schema team(name, city, owner), with functional dependencies .

The relation team is decomposed into two relations, t1(name, city) and t2(name, owner). Which of the following statement(s) is/are TRUE?

  1. (A)

    The relation team is NOT in BCNF.

  2. (B)

    The relations t1 and t2 are in BCNF.

  3. (C)

    The decomposition constitutes a lossless join.

  4. (D)

    The relation team is NOT in 3NF.

See the question in the paper

Answer and solution

ANSWER

Options (B) and (C) are true: t1 and t2 are both in BCNF, and the decomposition is lossless. Options (A) and (D) are false because team is already in BCNF and therefore in 3NF.

Official answer: B, CSource: Official answer key, GATE 2025 CS1 (IIT Roorkee)

  1. Attribute closure: , which is all of team. So name is a candidate key. It is the only one, because city and owner determine nothing.

  2. BCNF test on team: both FDs, and , have a superkey on the left. So team is in BCNF, and (A) is false.

  3. Every relation in BCNF is also in 3NF, so team is in 3NF and (D) is false.

  4. Projected FDs: t1(name, city) holds only , and name is its key. t2(name, owner) holds only , and name is its key. Every FD has a superkey on its left in both relations, so both are in BCNF and (B) is true.

  5. Lossless-join test for a binary decomposition: . Since contains all of (and of ), holds. The decomposition is lossless, and (C) is true.

  6. True statements: (B) and (C).

KEY IDEA

Find the key by attribute closure. Here name is the only key, so every FD has a superkey on its left and team is in BCNF. A binary decomposition is lossless when the common attributes functionally determine one of the two relations. Here name determines both.

WATCH OUT FOR

Thinking that team must be un-normalised because it was decomposed. Decomposing an already-BCNF relation is still allowed, and here it is lossless. Another slip is to claim a relation is not in 3NF without checking that the left side of each FD is a superkey.

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

More Normal forms questions