• edited by
850 views
1 1 vote

Consider the following statements:
1. The redundancy in the set of relation that have been arised after decomposing a relation R into BCNF is zero irrespective of the type of dependencies.
2. BCNF decompositions are always lossless as well as dependency preserving.
3. A prime attribute of a relation schema R is an attribute that appears in all candidate key of R.
4. A relation R is in 3NF, if every non-prime attribute of R, is fully functionally dependent on some key of R.
The number of statements are correct _______.

WHAT IS DIFFERENCE  BETWEEN TRANSITIVE DEOENDENCY AND FULLY FUNCTIONAL DEPENDENCY??

1 Answer

1 1 vote

Answer 1: False.

BCNF is 100% FREE from Redundancies caused by functional dependencies, But may have redundancies due to MVDs.

Detailed Explanation: https://youtu.be/zypcOTF-Lxw 

Answer 2: False.

It is always possible to decompose a relation into a set of relations that are in BCNF such that the decomposition is lossless But it may not be possible to preserve dependencies.

Answer 3: False.

A prime attribute of a relation schema R is an attribute that appears in at least one candidate key of R.

Explained Here: https://www.youtube.com/watch?v=SN1Fa1c5Kg8&t=638s

Answer 4: False

A relation R is in 3NF, if No non-prime attribute of R, is transitively dependent on any key of R.

Explained Here: https://youtu.be/Ai-zpaUbXzs?t=1540&feature=shared

Answer 5:

WHAT IS DIFFERENCE  BETWEEN TRANSITIVE DEOENDENCY AND FULLY FUNCTIONAL DEPENDENCY??

Understand Clearly Here: https://youtu.be/SN1Fa1c5Kg8?feature=shared

Answer:
Position:
Show:

Related questions

0 0 votes
3 answers 3 answers
1.6k
1.6k views
Souvik33 asked Dec 17, 2022
1,591 views
MSQ A relation R(A,B,C,D) has only trivial functional dependencies of the form ( A→A, AB→AB,ABC→A, etc)Then consider the following options:The relation is surely in BCNFT...
10 10 votes
1 answers 1 answer
6.4k
6.4k views
Na462 asked May 29, 2018
6,405 views
Which of the following statement false of relation $R$ is in $3NF$ but not $BCNF$?Relation $R$ must consist atleast two over-lapped candidate keys.Relation $R$ must consi...
7 7 votes
1 1 answer
3.9k
3.9k views
A_i_$_h asked Sep 9, 2017
3,911 views
A 3NF table which does not have multiple overlapping candidate keys is said to be ina)1NFb)2NFc)4NFd)BCNF
14 14 votes
6 answers 6 answers
21.2k
21.2k views
Shefali asked Sep 17, 2015
21,238 views
Consider the following statements.If relation R is in 3NF and every key is simple, then R is in BCNFIf relation R is in 3NF and R has only one key, then R is in BCNFBoth ...