Consider the following relational schema along with all the functional dependencies that hold on them.
Which of the following statement(s) is/are TRUE?
View worked solution
Answer: C;D
To determine if the relations are in 3NF, we find their candidate keys and check the 3NF conditions for each functional dependency (FD). A relation is in 3NF if, for every non-trivial FD , either is a superkey or is a prime attribute.
Analysis of with FDs:
- The attributes and do not appear on the right-hand side of any FD. Thus, they must be part of any candidate key.
- Computing the closure: .
- Therefore, is the unique candidate key.
- Prime attributes: ; Non-prime attributes: .
- For the FD , is not a superkey and is not a prime attribute. This violates the 3NF condition.
- Hence, is NOT in 3NF (Option C is TRUE).
Analysis of with FDs:
- The attribute does not appear on the right-hand side of any FD. Thus, it must be part of any candidate key.
- Computing the closure: .
- Therefore, is the unique candidate key.
- Prime attributes: ; Non-prime attributes: .
- For the FD , is not a superkey and is not a prime attribute. This violates the 3NF condition.
- Hence, is NOT in 3NF (Option D is TRUE).
Free practice · Your answers on this page are not saved.
