Consider the following set of functional dependencies of a relation R(ABCDE)

F = {A → B, B → C, C → D, D → A} 

Find out the highest normal form

(A) 2NF
(B) 3NF
(C) 4NF
(D) BCNF


Answer: (B)

Explanation: Candidate keys will be {(AE), (BE), (CE), (DE)}, that means all attributes of given relation R(ABCDE) are prime attributes, therefore relation R always satisfy 3NF.
But it violates the BCNF condition because LHS of given FDs are not superkeys.

Quiz of this Question