Consider the following relation with set of functional dependencies
R(ABCDEF)
ABC->D, ABD->E, CD->F, CDF->B, BF->D
a) Identify the candidate key(s) in the relation (with proper steps followed).
b) Identify which normal form this relation is in and reason for the answer.
a. Candidate keys are A, E, CD, BC explanation is if any closure includes all attributes of a table then it becomes the candidate key.
b. 1 normal form since it's attributes has only atomic values.
Comments
Leave a comment