Exrcise 352 a What are all the keys for courses b Verify tha

Exrcise 3.5.2:

a) What are all the keys for courses?

b) Verify that the given FD\'s are their own minimal basis.

c) Use the 3NF synthesis algorithm to find a a lossless-join, dependency-preserving decomposition of R into 3NF relations. Are any of the relations not in BCNF?

Solution

Solution:

a) Key for the relation courses is HS.

b) FD\'s are already minimal basis, as no attributes can be removed from the left side, right side is having only single attributes and none of the FD can be removed as given in the question.

c) By using the 3NF synthesis algorithm, the final set of relations obtained will be CT, HRC, HTR, HSR, CSG (FD\'S are already proved to be minimal basis in part (b)). All the relations are in BCNF.