The relation scheme has the following functional dependencies:
- name, courseNo, grade
- rollNo, courseNo grade
- name rollNo
- rollNo name
The highest normal form of this relation scheme is
View worked solution
Answer: B
To find the highest normal form, we first determine the candidate keys of the relation :
- Since does not appear on the right-hand side of any functional dependency (FD), it must be part of every candidate key.
- Taking the closure of : Thus, is a candidate key.
- Taking the closure of : Thus, is also a candidate key.
From these candidate keys, we classify the attributes:
- Prime attributes (part of any candidate key):
- Non-prime attributes:
Now, we test the normal forms:
- BCNF: For a relation to be in BCNF, the left-hand side of every non-trivial FD must be a superkey. For the FD , the LHS is not a superkey. Thus, the relation is not in BCNF.
- 3NF: For a relation to be in 3NF, for every non-trivial FD , either must be a superkey or must be a prime attribute.
- : LHS is a superkey.
- : LHS is a superkey.
- : RHS is a prime attribute.
- : RHS is a prime attribute.
Therefore, the highest normal form of the relation is 3NF.
Free practice · Your answers on this page are not saved.
