Q.6.

6.1 )You are given the following set F of functional dependencies for a relation R(A,B,C,D,E,F): F-{ABCD, ABDE, CD F, CDF B, BF D}.

Is this relation in Boyce-Codd Normal Form? Is it 3NF? Explain. And can the set F be simplified (by removing functional dependencies or by removing attributes from the left-hand side of functional dependencies) without changing the closure of F (i.e. F+)? Hint. Consider the steps of the minimal cover algorithm. Do any of them apply to this functional dependency?

6.2 Consider relation R(X,Y,Z). Relation R currently has three tuples: (6, 4, 2). (6, 6,8) and (6.4.8). Which of the following three functional dependencies can you infer do not hold for relation R? Explain your answer. {Y-> X, Z->Y.XY-> Z)

Question 0.6. 12*10 - 20 Marks 6.1 You are given the following set F of functional dependencies for a relation R(A,B,C,D,E,F): F = ABCD, ABD - ECD-F.CDF - B, BFD). Is this relation in Boyce-Codd Normal Form? Is it 3NF? Explain. And can the set F be simplificd (by removing functional dependencies or by removing attributes from the left-hand side of functional dependencies) without changing the closure of F(.e. F+)? Hint. Consider the steps of the minimal cover algorithm. Do any of them apply to this functional dependency? 6.2 Consider relation RX, Y, Z). Relation R currently has three tuples: (6, 4, 2), (6,6,8) and (6.4,8). Which of the following three functional dependencies can you infer do not hold for relation R? Explain your answer. {Y->X. Z>Y.XYZ