Question discussion

A relation R(A, B, C, D) has the functional dependencies A → B, B → C and C → D, and A is its only candidate key. The highest normal form s…

1330Medium DSSSB TGT Computer Science 0 replies 1 views

A relation R(A, B, C, D) has the functional dependencies A → B, B → C and C → D, and A is its only candidate key. The highest normal form satisfied by R is

A2NF
B1NF
C3NF
DBCNF

Correct answer: A

Explanation

The key is a single attribute so there is no partial dependency (2NF holds), but B → C and C → D are transitive dependencies of non-prime attributes, which violate 3NF.

Join the discussion Report an error

Discussion 0

Nobody has replied yet. Start the discussion!