• edited by
913 views
0 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 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
Position:
Show:

Related questions

0 0 votes
2 2 answers
1.5k
1.5k views
Shivam_j asked Oct 16, 2022
1,503 views
Class B network on the internet has a subnet mask of 255.255.119.0 what is maximum possible hosts per subnet. Assuming Classfull Addressing Scheme
5 5 votes
3 answers 3 answers
1.9k
1.9k views
`JEET asked May 26, 2019
1,920 views
Let $G$ $=$ $(V, E)$ be a simple non-empty connected undirected graph, in which every vertex has degree 4. For any partition $V$ into two non-empty and non-overlapping su...
2 2 votes
3 answers 3 answers
2.5k
2.5k views
`JEET asked May 26, 2019
2,519 views
Which of the following is $\textbf{not}$ TRUE?(a) In a complete graph $K_n$ ($n$ $\geq$ $3$), Euler circuit exists $\Leftrightarrow$ $n$ is odd.(b) In a complete bipartit...
3 3 votes
1 1 answer
1.0k
1.0k views
`JEET asked May 26, 2019
1,020 views
Which of the following is $\textbf{not}$ TRUE?(a) In a complete graph $K_n$ ($n$ $\geq$ $3$), Hamiltonian cycle exists for all n.(b) In a complete bipartite graph $K_{m,n...