in Databases retagged by
408 views
3 votes
3 votes

An attribute $A$ is called prime if $A$ is in any of the candidate keys. Assume in the following statements, $\mathrm{A}$ is an attribute $\&\;\mathcal{X}$ is a set of attributes.

Consider the following statements:

  1. Domain of each attribute is an elementary type; that is, not a set or a record structure.
     
  2. Whenever $\mathcal{X} \mapsto A$ is a functional dependency that holds in relation $\mathbf{R}$ and $A \notin \mathcal{X}$, then either
    • $A$ is prime, or
    • $\quad \mathcal{X}$ is a key or a super-key for $\mathbf{R}$.
       
  3. Whenever $\mathcal{X} \mapsto A$ is a functional dependency that holds in relation $\mathbf{R}$ and $A \notin \mathcal{X}$, then either
    • $A$ is prime, or
    • $\mathcal{X}$ is not a proper subset of any key for $\mathbf{R}$.
       
  4. Whenever $\mathcal{X} \mapsto A$ is a functional dependency that holds in relation $\mathbf{R}$ and $A \notin \mathcal{X}$, then
    • $\mathcal{X}$ is a key or a super-key for $\mathbf{R}$.

Which of the following is a correct match??

  1. $\text{A – 1NF, B – 2NF, C – 3NF, D – BCNF}$
  2. $\text{A – 1NF, B – BCNF, C – 2NF, D – 3NF}$
  3. $\text{A – 1NF, B – 3NF, C – 2NF, D – BCNF}$
  4. $\text{A – BCNF, B – 3NF, C – 2NF, D – 1NF}$
in Databases retagged by
408 views

1 comment

$ \large{\colorbox{yellow}{Detailed video solution of this question with direct time stamp}}$
All India Mock Test 3 - Solutions Part 2

0
0

2 Answers

0 votes
0 votes

Ans C

for option A:-“Domain of each attribute is an elementary type; that is, not a set or a record structure” it means that there atomic condition is satisfied which is clearly 1NF.

for option B :- A relation is in 3NF if at least one of the following conditions holds in every non-trivial function dependency X –> Y. 

  • X is a super key.
  • Y is a prime attribute (each element of Y is part of some candidate key)
  • There should be no transitive dependency (Non Prime → Non Prime)

for option C :- It is in 2NF and condition is stating that there should be no non trivial dependency which is partial dependency.

for option D :- It is condition for BCNF “X should be a superkey/candidate key for every functional dependency (FD) X−>Y in a given relation”. 

  

 

0 votes
0 votes

(B)
X->A
Here,either
1)A is prime, so here X->A can be of type
  (i) ck->prime ,or    -->in 3NF
  (ii)prime->prime    -->in 3NF
or-
2) X is ck or sk, so here X→A can be of type
   (i) ck->prime ,or      -->in 3NF
   (ii)ck->non prime     -->in 3NF
so B is in 3nf(basically the cases don’t provide any counter eg )

 

(C)
X->A
Here,either
1)A is prime, so here X->A can be of type
  (i) ck->prime ,or    -->in 3NF
  (ii)prime->prime    -->in 3NF
or-
2) X is not proper subset of any key of R,
so here X is either non prime, then  X->A can be of type
    (i)np→ np, only  -->in 3NF violation!!!
   or
    X is candidate key itself
   (i) ck->prime ,or      -->in 3NF
   (ii)ck->non prime     -->in 3NF
so C  is not in 3nf, BUT is in 2NF