Q4-A (6 marks) Consider the relation R (A, B, C, D, E, F, G) and the...

Transcribed Image Text:

Q4-A (6 marks) Consider the relation R (A, B, C, D, E, F, G) and the set of functional dependencies Fd = {A->B, BC->F, BD->EG, AD->C, D- >F, BEG->FA}. Determine if we can infer the following functional dependencies from Fd and justify your answer. a. (3 marks) BD->FG b. (3 marks) ACE->BFG Q4-B (20 marks) Suppose that a relation R (A, B, C, D, E, G, H) is given where the functional dependency set is Fd = {E->D, DE->AC, HC- >A, H->B, A->C}. a. (4 marks) List all the candidate keys with respect to Fd and justify your answer. b. (6 marks) If R is not already in BCNF, decompose it into a set of BCNF relations. Justify your answer. c. (4 marks) Compute a minimum cover of Fd. d. (6 marks) If R is not already in 3NF, decompose it into a set of 3NF relations. Justify your answer. Q4-A (6 marks) Consider the relation R (A, B, C, D, E, F, G) and the set of functional dependencies Fd = {A->B, BC->F, BD->EG, AD->C, D- >F, BEG->FA}. Determine if we can infer the following functional dependencies from Fd and justify your answer. a. (3 marks) BD->FG b. (3 marks) ACE->BFG Q4-B (20 marks) Suppose that a relation R (A, B, C, D, E, G, H) is given where the functional dependency set is Fd = {E->D, DE->AC, HC- >A, H->B, A->C}. a. (4 marks) List all the candidate keys with respect to Fd and justify your answer. b. (6 marks) If R is not already in BCNF, decompose it into a set of BCNF relations. Justify your answer. c. (4 marks) Compute a minimum cover of Fd. d. (6 marks) If R is not already in 3NF, decompose it into a set of 3NF relations. Justify your answer.