Question

1. Suppose we have the following relation R with composite primary key {A,B} together with the set FD of functional dependencies:
   
   R(A,B,C,D,E,F,G).
   FD = { C -> G, E -> B, A -> D, AB -> C, AB -> D, AB -> E. AB -> F, AB -> G }
   
   1. Draw the initial dependency diagram using the above information.
   2. The relation from part a) is in first normal form. Using the techniques described in the lecture, convert it to 2NF by removing any partial dependencies, and construct the resulting dependency diagram(s).
   3. Modify the dependency diagrams you created in part b) to produce a set of 3NF relations by removing any transitive dependencies.
   4. Convert your result from part c) so that all your relations are in BCNF. (This may take more than one step).       

Answer 1

SOLUTION:

I hope my answer met all your requirements.For any query do ask in comment.

ThankYou!