Database-Normalisation

Question

Determine the highest normal for relation R(A,B,C,D)

AB →C

BC→D

Comments

2 NF

---

BC→D is not in 3NF form as BC is not a Superkey, neither D is a prime attribute

---

Please can you support your answer with an explanation. It'll indeed be helpful. :)

Answer 1

R(A,B,C,D)
{AB →C
BC→D}
candidate keys are={AB}
AB->C..no problem here
BC->D..yes problem
BC is nt a superkey...so not in BCNF
its a transitive dependency means non prime attribute deriving non prime attribute..hence not in 3NF also
for 3NF there shouldnt be any partial dependency...which is obviously nt there..hence highest normal form possible is 2NF
(please crooss verify once i have done it a bit fast)

Comments

is BC partial key of Candidate Key AB?

---

no...A-> or B-> would have been partial keys