The Gateway to Computer Science Excellence
+20 votes
2.3k views

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 $3NF$, but not in $\text{BCNF}$
  3. in $2NF$, but not in $3NF$
  4. not in $2NF$
in Databases by
edited by | 2.3k views
0
Non prime -> Non prime also leads to transitive depedency?
+1
yes

$R(A,B)$

$A \rightarrow B$

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

3 Answers

+37 votes
Best answer
Answer: $D$

Here $AB$ is the candidate key and B->G is a partial dependency. So, $R$ is not in $2NF$.
by
edited by
+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



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

(Ans-D)
by
Answer:

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
52,345 questions
60,510 answers
201,923 comments
95,352 users