Test by Bikram | Databases | Test 2 | Question: 7

Question

What is the highest normal form of the relation $R(ABCDEF)$ having functional dependency set at 

$F = \{ A \rightarrow BC, \ \ C \rightarrow AD, \ \ E \rightarrow ABC, \ \ F \rightarrow CD,  \ \ CD \rightarrow BEF, \ \ AB \rightarrow D \}$?

• A. $1NF$
• B. $2NF$
• C. $3NF$
• D. $BCNF$

Answer 1

If we find the candidate keys here we can clearly see that (A, C, E, F) are candidate keys. hence CD and AB are also superkeys.

so all the FD's will be like SUPERKEY-> ATTRIBUTE. that;s the only condition for BCNF. hence it is in BCNF normal form.

Comments

It is not bcnf

---

I think this is a very appropriate explanation. Nice explanation thanks.

This is definitely in BCNF.

 

Adding to the explanation:

All the FD's will be like SUPERKEY-> ATTRIBUTE. that's the only condition for BCNF.

ATTRIBUTE can be prime or non prime; doesn't matter.