IAE Academy

GATE 2025 CS2 Q.46: solution and answer

GATE 2025 · CS2Q.46 · 2 marks · MSQ

Consider the following relational schema along with all the functional dependencies that hold on them.

:

:

Which of the following statement(s) is/are TRUE?

  1. (A)

    R1 is in 3NF

  2. (B)

    R2 is in 3NF

  3. (C)

    R1 is NOT in 3NF

  4. (D)

    R2 is NOT in 3NF

See the question in the paper

Answer and solution

ANSWER

Options (C) and (D) are true: neither R1 nor R2 is in 3NF.

Official answer: C, DSource: Official answer key, GATE 2025 CS2 (IIT Roorkee)

  1. R1, find the key. and never appear on a right-hand side, so every candidate key contains . Compute : gives ; gives ; gives . So , and is the only candidate key. The prime attributes are and .

  2. R1, test 3NF. A dependency meets 3NF if is a superkey or is prime (or ). Take : , so is not a superkey, and is not prime. Both conditions fail, so is NOT in 3NF. (It is a partial dependency on the key .)

  3. R2, find the key. never appears on a right-hand side, so every key contains . Compute : gives ; gives ; gives . So , and is the only candidate key. The only prime attribute is .

  4. R2, test 3NF. Take : does not contain , so is not a superkey, and is not prime. So violates 3NF (and does too). is NOT in 3NF. (It is a transitive dependency .)

  5. Hence (C) and (D) are true, and (A) and (B) are false.

KEY IDEA

Find the candidate keys by closure, then look for any functional dependency whose left side is not a superkey and whose right side is not a prime attribute. One such dependency is enough to rule out 3NF.

WATCH OUT FOR

Forgetting that a non-key attribute can depend on part of the key (D to E in R1) or on another non-key attribute (A to D in R2). Both break 3NF, and both are easy to miss when the key is only checked against the dependency that uses it.

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

More Normal forms questions