1,162 views
3 3 votes

Consider the following two statements:

  • Statement I: A relation in Second Normal Form (2NF) has no partial dependencies.
  • Statement II: A relation in Third Normal Form (3NF) has no transitive dependencies.

Which of the following is correct?

  1. Both Statement I and Statement II are true
  2. Statement I is true, but Statement II is false
  3. Statement I is false, but Statement II is true
  4. Both Statement I and Statement II are false

5 Answers

Best answer
15 15 votes

Both statements are False. Thinking them True is a Misconception.

Counterexample for Statement 1:

\[
R(A, B, C, D, E)
\]

Functional dependencies:
\[
AB \;\to\; CDE
\]
\[
CD \;\to\; E
\]
\[
D \;\to\; E
\]

- Candidate key = \( AB \). 
- Prime attributes = \( A, B \). 
- Non-prime attributes = \( C, D, E \). 
- Here, \( CD \to E \) is a partial dependency (since \( D \to E \)), but it does not violate 2NF, because 2NF only forbids when some CK partially determines 'non-prime attribute'. Here 'Non-prime attributes' are paritally determining 'non-prime attribute' so it is allowed in 2NF.
- Thus, the relation is in 2NF, so Statement 1 is false. 


Counterexample for Statement 2:

\[
R(A, B, C, D)
\]

Functional dependencies:
\[
AB \;\to\; CD
\]
\[
CD \;\to\; AB
\]
\[
A \;\to\; C
\]

- Candidate keys = \( AB, CD \). 
- Prime attributes = \( A, B, C, D \). 
- Since all attributes are prime, there are no 3NF violations. 
- Notice that \( AB \to A \) and \( A \to C \) create a transitive dependency \( AB \to C \), but it does not violate 3NF, because the dependent attribute \( C \) is prime. 3NF violates when some CK transitively determines 'non-prime attribute' but here it is determining 'prime attribute' so allowed.
- Thus, the relation is in 3NF, so Statement 2 is false. 

So, answer is D.


Misconceptions in Partial Dependency, Transitive Dependency: https://youtu.be/xqIm-Y3oVDk

selected by
0 0 votes

Statement I : True. The main purpose of 2NF is to eliminate partial dependencies, which means no non-prime attribute is dependent on a proper subset of any candidate key.

Statement II :  This is not necessarily always true. 3NF eliminates transitive dependencies only if the transitive dependency involves a non-prime attribute as the dependent attribute. Transitive dependencies can exist in 3NF if the dependent attribute is a prime attribute. To completely remove all transitive dependencies, a relation must be in BCNF. So, statement II is not always true.

Answer : Option B) Statement I is true, but Statement II is false.

2 flags:
✌ Low quality (jacknroll “wrong”)
✌ Low quality (Piyush_Arora)
Position:
Show:

Related questions

7 7 votes
3 3 answers
974
974 views
GO Classes asked Jul 24, 2025
974 views
Which one of the following is NOT a part of ACID properties of a database transaction?AtomicityConsistencyIsolationDeadlock-freedom
3 3 votes
4 4 answers
760
760 views
GO Classes asked Jul 24, 2025
760 views
Match the following:$a-iii, b-iv, c-ii, d-i$ $a-iv, b-iii, c-ii, d-i$ $a-ii, b-iii, c-iv, d-i$ $a-iii, b-iv, c-i, d-ii$
2 2 votes
3 3 answers
700
700 views
GO Classes asked Jul 24, 2025
700 views
The upper bound and lower bound for the number of leaves in a B-tree of degree $K$ with height $h$ is given by :$K^h$ and $2\left\lceil\frac{k}{2}\right\rceil^{h-1}$ $K *...
4 4 votes
3 3 answers
554
554 views
GO Classes asked Jul 24, 2025
554 views
Which of the following concurrency control protocol ensures both conflict and free from deadlock?,Time stamp ordering2 Phase lockingBoth (a) and (b)None of the above