Consider a relation R(A, B, C, D, E, F), with FDs AB → C , BC → D, D → E, BE → F and DF → C.
1. Is R in BCNF? Explain why or why not.
2. Find the closure of the following:
1. (A, B)
2. (B, D)
3. (D, F)
3. List one superkey of R that is not a (minimal) key.
The question belongs to Computer Science and it is about finding out whether or not a relation comes under BCNF (Boyce-Codd Normal Form) or not. This has been given in the solution in detail.
Total Word Count 40