0 votes 0 votes Given relation R(A, B, C, D, E) and set of functional dependencies F = {AB → C, AB → D, D → A, BC → D, BC → E} What will be the highest normal form satisfied by R ? a. 1 NF b. 2 NF c. 3 NF d. BCNF cse23 asked Jan 14, 2017 cse23 328 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes F = {AB → C, AB → D, D → A, BC → D, BC → E} candidate keys are={BA,BC,BD} for transitive dependency a non key attribute ->non key attribute for partial dependency a prime attribute->non key attribute D->A is not a partial dependency(A is a prime attribute) also D is not a superkey so ,highest normal form possible is 3NF sudsho answered Jan 14, 2017 • selected Jan 14, 2017 by Sushant Gokhale sudsho comment Share Follow See all 0 reply Please log in or register to add a comment.