432 views
0 votes
0 votes

I feel that answer is none of the above , because in question it is given AB is key , so any partial dependency will not be accepted , so none will be in 2NF.

what you say , anyways the answer in booklet is D

1 Answer

Best answer
3 votes
3 votes
A. $A \to C$, $C$ is non-key attribute. $AB$ is candidate key and so is a partial FD. Hence, not in 2NF.

B. Here, $C\to B$ makes $AC$ also a candidate key. So, $B \to C$ and $C \to B$ are not violating 2NF as they are detrmining "key" attribute. But $A \to D$ violate 2NF.

C. $AB$ and $DB$ are candidate keys here. Due to $C \to D$, $CB$ also becomes a candidate key. So, no other attribute present other than prime(key) attributes. So, $R$ is in 2NF as well as 3NF.

D. Only $AB$ is the candidate key. $BC$ is not a super key, is also not a proper subset of candidate key. $D$ is not a prime attribute. So, $BC \to D$ violate 3NF but due to no partial dependency, $R$ is in 2NF.

So, D is the answer.
selected by

Related questions

3 votes
3 votes
1 answer
1
0 votes
0 votes
1 answer
2
Ajit J asked Nov 28, 2018
648 views
Consider the following subquery on the relation R(A,B,C,D)SELECT […..] FROM R GROUP BY A,BAssuming A,B,C,D take integer values, which of the following can appear in the...
0 votes
0 votes
0 answers
3
joshi_nitish asked Jun 20, 2017
621 views
2 votes
2 votes
1 answer
4
tvkkk asked Sep 16, 2016
588 views
The schedule S:T1: Read(X); T2: Write(X);T2: Write(Y);T3: Write(Y);T1: Write(Y);T1: commit; T2: commit;T3: commit;is Recoverable or non-recoverable?