retagged by
17,746 views
77 77 votes

Consider a relational table $R$ that is in $3NF$, but not in BCNF. Which one of the following statements is TRUE?

  1. $R$ has a nontrivial functional dependency $X \rightarrow A$, where $X$ is not a superkey and $A$ is a prime attribute.
  2. $R$ has a nontrivial functional dependency $X \rightarrow A$, where $X$ is not a superkey and $A$ is a non-prime attribute and $X$ is not a proper subset of any key.
  3. $R$ has a nontrivial functional dependency $X \rightarrow A$, where $X$ is not a superkey and $A$ is a non-prime attribute and $X$ is a proper subset of some key
  4. A cell in $R$ holds a set instead of an atomic value.

11 Answers

Best answer
68 68 votes

In $\text{3NF}$  where functional dependency is of type $X  \rightarrow Y$

$X$ can be the super key or $Y$ can be the prime attribute

Whereas in $\text{BCNF}$ where functional dependency is of type $X \rightarrow Y$

$X$ should be super key $\text{(BCNF}$ is more strict compared to $\text{3NF)}$

  • Option (C) says it has a partial dependency $($not even $\text{2NF)}$.
  • Option (D) multiple values in a cell. i.e not atomice $($not even $\text{1NF)}$.
  • Option (B)  says $X$ is not a super key and $Y$ is not a prime attribute. Therefore not $\text{3NF}$.

Ans (A): Says $X$ is not a super key but $Y$ is a prime attribute. Satisfies one of the conditions of the $\text{3NF}$ formal definition. As $X$ is not a Super Key it is not in $\text{BCNF}$.

edited by
32 32 votes

Detailed Video Solution with Complete Analysis: 3NF But Not BCNF - GATE 2020 Question  

When can we say that a Relation $R$ is NOT in a particular Normal Form??


NOT in BCNF:

There exists a nontrivial functional dependency $X \rightarrow A$, where $X$ is not a superkey.


NOT in 3NF:

There exists a nontrivial functional dependency $X \rightarrow A$, where $X$ is not a superkey and $A$ is a non-prime attribute.


If R is in 3NF But NOT in BCNF then:

There exists a nontrivial functional dependency $X \rightarrow A$, where $X$ is not a superkey and $A$ is a prime attribute.


NOT in 2NF:

There exists a nontrivial functional dependency $X \rightarrow A$, where $X$ is a proper subset of some candidate key and $A$ is a non-prime attribute.


NOT in 1NF:

A cell in $R$ holds a set instead of an atomic value.


In $3NF$ but Not in $BCNF$ $\rightarrow $ Option $A$

Option $B$ $\rightarrow $ Not in $3NF$

Option $C$ $=$ Not in $2NF$

Option $D$ $\rightarrow$ Not in $1NF$

Detailed Video Solution with Complete Analysis: https://youtu.be/vx8X9iiaOaw?feature=shared 

edited by
1 1 vote
OPTION A. SINCE X IS NOT A SUPER KEY BUT A  IS PRIME. ( ANY ONE CONDITION (1) X is a Super key (2) A is prime attribute ) .here option A satisfy the condition.
1 1 vote
Simple:-
If its not in BCNF the X is not superkey
so according to 3NF non prime attribute should not depend on non prime attribute. Since in X->A , X is not super key so its non prime attribute, So if A is non prime then non prime depends on non prime So A should be prime attribute
0 0 votes

If ( X  ->  Y ) is trivial function means Y is subset of X (X ∩ Y = not-null),
example (sid+sname) -> sid,  here  X must be SuperKey.

But in question is say (X -> Y) is Non-trivial means X ∩ Y = null , means X is must be not SuperKey.

Given is in 3NF and not in BCNF.

3NF => means (L.H.S = CandidateKey or SuperKey)  or  (R.H.S = Primary Attribute)

BCNF => means  (L.H.S = CandidateKey or SuperKey)  and  (R.H.S = non Primary Attribute) .

We already know X(LHS) is not superKey , hence to fulfill it is in 3NF and not in BCNF Y(RHS) must be a Prime attribute .Since it also clear that its not in BCNF.

 

Option A is correct.

0 0 votes

SE The only condition for That R in 3NF but Not in BCNF in X-Y is X in not super key( then only it is not in BCNF) and  then Y must be prime otherwise it voilates the condition of 3NF...  

Option (A) is Correct 

Answer:
Position:
Show:

Related questions

59 59 votes
4 answers 4 answers
24.9k
24.9k views
Arjun asked Feb 12, 2020
24,850 views
Consider a double hashing scheme in which the primary hash function is $h_1(k)= k \text{ mod } 23$, and the secondary hash function is $h_2(k)=1+(k \text{ mod } 19)$. Ass...
43 43 votes
7 answers 7 answers
21.5k
21.5k views
Arjun asked Feb 12, 2020
21,463 views
Consider a schedule of transactions $T_1$ and $T_2$:$\begin{array}{|c|c|c|c|c|c|c|c|c|c|c|} \hline T_1 & RA & & & RC & & WD & & WB & \text{Commit} & \\ \hline T_2 & & R...
98 98 votes
5 answers 5 answers
40.6k
40.6k views
Arjun asked Feb 12, 2020
40,635 views
Consider a database implemented using $B^+$ tree for file indexing and installed on a disk drive with block size of $\text{4 KB}$. The size of search key is $\text{12 byt...
49 49 votes
3 answers 3 answers
27.4k
27.4k views
Arjun asked Feb 12, 2020
27,380 views
Consider a relational database containing the following schemas.$$\overset{\text{Catalogue}} {\begin{array}{|c|c|c|} \hline \underline{\text{sno}} & \underline{\text{pno}...