There are no repeating terms, so it is not un-normalised. To be more than first normal form, is must not have any partial key dependencies. B->C is a partial key dependency, so it is in first normal form.
There are no repeating terms, so it is not un-normalised. There is a partial key dependency (B->C), so it is not in second normal form.
There are no repeating terms, so it is not un-normalised. There is a partial key dependency (B->C), so it is not in third normal form.
There are no repeating terms, so it is not un-normalised. There is a partial key dependency (B->C), so it is not in BCNF normal form.
There are no repeating terms, so it is not un-normalised. However, there is a partial key dependency (B->C), so it is in first normal form.
Consider the relational schema R(A,B,C,D,E) with non-key functional dependencies C,D -> E and B -> C.
Select the strongest statement that can be made about the schema R
- R is in first normal form
- R is in second normal form
- R is in third normal form
- R is in BCNF normal form
- None of the above
| ||||
| ||||
|