in Databases edited by
8,075 views
23 votes
23 votes

Let $R (A, B, C, D, E, P, G)$ be a relational schema in which the following functional depen­dencies are known to hold: $AB \to CD, DE \to P, C \to E, P \to C$ and $B \to G.$ The relational schema $R$ is

  1. in $\text{BCNF}$
  2. in $\text{3NF}$, but not in $\text{BCNF}$
  3. in $\text{2NF}$, but not in $\text{3NF}$
  4. not in $\text{2NF}$
in Databases edited by
8.1k views

2 Comments

Non prime -> Non prime also leads to transitive depedency?
0
0
yes

$R(A,B)$

$A \rightarrow B$

$B \rightarrow C$ (Non prime $ \rightarrow $ Non prime )
1
1

5 Answers

46 votes
46 votes
Best answer
Answer: $D$

Here $AB$ is the candidate key and $B \rightarrow G$ is a partial dependency. So, $R$ is not in $\text{2NF}$.
edited by

4 Comments

ADB is the candidate key. Right? AB not alone can't be ck.
0
0
(AB)+ == { A, B, G, C, E}

(ABD)+ == { A, B, D, C, E, G, P}

 

How is {AB} a Candidate Key???
0
0
(AB)+ = {A,B,C,D,E,G,P}

i.e AB –> CD  : (AB)+ = {A,B,C,D}

B → G : AB+ = {A,B,C,D,G}

C → E : (AB)+ = {A,B,C,D,E,G}

DE → P: (AB)+ = {A,B,C,D,E,G,P}
1
1
B->G is not a Partial dependency according to definition of Partial Dependency(Definition of P.D- "For any FD A->B, B is partially dependent on A if some proper subset of A itself can determine B") so here Partial dependency is in AB->G.
0
0
12 votes
12 votes

not in 2NF because here candidate key is AB and in FD's proper subset of C.K. determine the non prime attribute i.e. B→G



1 comment

Yes, you are right. Answer is D.
1
1
1 vote
1 vote
AB is key and G is non prime attribute which is partially dependent on B.

(Ans-D)
0 votes
0 votes
(AB) forms the candidate key, so the functional dependency B→G violates 2NF.
Answer:

Related questions