Normalization
April 20, 2024Question 16570 – Clique
April 20, 2024Database-Management-System
|
Question 40
|
Let R (A, B, C, D, E, P, G) be a relational schema in which the following functional dependencies are known to hold:
AB → CD, DE → P, C → E, P → C and B → G.
The relational schema R is
|
in BCNF
|
|
|
in 3NF, but not in BCNF
|
|
|
in 2NF, but not in 3NF
|
|
|
not in 2NF
|
Question 40 Explanation:
Candidate key is AB.
Since there is a partial dependency B→G.
So the relational schema R is Not in 2NF.
Since there is a partial dependency B→G.
So the relational schema R is Not in 2NF.
Correct Answer: D
Question 40 Explanation:
Candidate key is AB.
Since there is a partial dependency B→G.
So the relational schema R is Not in 2NF.
Since there is a partial dependency B→G.
So the relational schema R is Not in 2NF.