• retagged by
5,067 views
7 7 votes

Consider the relational schema $\text{R(A B C D)}$ with following functional dependency set $F=\{A\rightarrow BC,C\rightarrow D\};$ The relation $\text{R}$ is in 

  1. $2$NF
  2. BCNF
  3. $3$NF
  4. $1$NF

6 Answers

6 6 votes

here A is key....

So A->BC is in BCNF...

C->D ...is not in BCNF as C is not a super key ...its also not in 3NF as D is not a prime atribute...but its in 2nf as C is not a part of Key..

so overall relation is in 2NF

answer is option A

2 2 votes
(A)2NF

R(A B C D)     HERE A is the CK

so for A->BC  A is the SUPER KEY so  it is in BCNF

BUT C->D    (NP->NP) so TRANSITIVE DEPENDENCY EXIST SO IT IS NOT IN 3NF

SO it is in 2NF
1 1 vote
Given, functional dependencies are F={A→ BC, C→ D}
Finding candidate key of given relation is relation is
A+={A,B,C} because we don’t have an A element in right hand side.
A→ BC dependency A is the candidate key and also part of FD. So, it is lossless.
C→ D is following Transitive dependency. So, it never become 3NF.
According to given choices, A is the correct choice.
1 1 vote
ANS : A  2NF

R(A B C D)     HERE A is the Candidate key

so for A→BC  A is the SUPER KEY so  it is in BCNF

BUT C→D    (NP->NP) so TRANSITIVE DEPENDENCY EXIST SO IT IS NOT IN 3NF

SO it is in 2NF
0 0 votes

A relation is Not in 3NF if and only if there exists a non-trivial FD where Non-superkey determines a Non-prime attribute. 

Here, $C \rightarrow D$ violates 3NF because $C$ is Non-superkey & it determines $D$ which is non-prime attribute. So, the relation is Not in 3NF.


A relation is Not in 2NF if and only if there exists a non-trivial FD where proper subset of a candidate key determines a Non-prime attribute. 

Since, the only candidate key here is $A,$ which doesn't have any proper subset, So, there is No violation of 2NF. Hence, $R$ is in 2NF.

Normalization Complete Playlist: https://youtube.com/playlist?list=PLIPZ2_p3RNHhJjQGnZB2jORa0JxLdMp4X&feature=shared

0 0 votes
A is the key
now
for 3NF and FD X-->Y such that either  x is super key or Y is prime
if all fd follow such condition implies table to be in 3nf
here C-->D doesnot follow hence not in 3nf
 

for 2nf
if subset of ck finding non prime attribute then it violated 2nf but here no such
or saying if u have not any composite ck then u have always 2nf
Answer:
Position:
Show:

Related questions

3 3 votes
2 2 answers
1.8k
1.8k views
admin asked Mar 30, 2020
1,795 views
Which of the following is TRUE?Every relation in $3$NF is also in BCNFA relation R is in $3$NF if every non-prime attribute of R is fully functionally dependent on every ...
4 4 votes
6 6 answers
5.0k
5.0k views
admin asked Mar 30, 2020
5,016 views
Which one of the following statements are not correct?$S1$: $3$NF decomposition is always lossless join and dependency preserving.$S2$: $3$NF decomposition is always loss...
0 0 votes
4 4 answers
6.6k
6.6k views
admin asked Mar 30, 2020
6,590 views
Consider the relational schema $R(A B C D)$ with following $FD$ set $F=\{A \to CE, B \to D, AE \to D\}$. Identify the highest normal form satisfied by the relation $R$.$2...
2 2 votes
3 3 answers
3.7k
3.7k views
admin asked Mar 30, 2020
3,699 views
In conservative two phase locking protocol, a transactionShould release all the locks only at the beginning of transactionShould release exclusive locks only after the co...