Database-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

Question 40 Explanation:

Candidate key is AB.
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.