Home /
Expert Answers /
Computer Science /
a-state-the-algorithm-for-computing-the-minimal-cover-of-a-set-of-functional-dependencies-and-henc-pa657

a) State the algorithm for computing the minimal cover of a set of functional dependencies and hence or otherwise find the minimal cover for R (A,B,C) and set of FDs F: {A C, AC B,B A,C AB} [6 marks] b) Define normalization in databases and hence or otherwise state when a table is in 1st, 2nd , 3 rd and Boyce cord Normal forms. [4 marks] c) Consider the relation R = {A, B, C, D, E, F, G, H, I,J} and the set of functional dependencies. F ={{A, B} {C}, {A} {D, E}, {B} {F}, {F} {G, H},{D} {I, J }}, Determine the key for R and hence or otherwise decompose R into 2NF and then 3NF relations. [10 marks]