Skip to content
Official PYQ · 1990

GATE CS 1990 Q3-ii — Normal Forms

Explain with AI

Indicate which of the following statements are true:

A relational database which is in 33NF may still have undesirable data redundancy because there may exist:

Select all correct options
View worked solution

Answer: A;B;D

A relation is in Third Normal Form (3NF) if, for every non-trivial functional dependency X→YX \rightarrow Y, at least one of the following conditions holds:

  1. XX is a superkey.
  2. YY is a prime attribute (i.e., each attribute in YY is part of some candidate key).

A relation is in Boyce-Codd Normal Form (BCNF) if, for every non-trivial functional dependency X→YX \rightarrow Y, XX is a superkey. BCNF eliminates all redundancy arising from functional dependencies. Therefore, any redundancy present in a 3NF relation is due to dependencies allowed in 3NF but forbidden in BCNF (i.e., where XX is not a superkey, but YY consists of prime attributes).

Let us analyze each option based on this:

  • Option A (True): 3NF prevents transitive dependencies of non-prime attributes on candidate keys. However, it allows transitive dependencies of prime attributes. For example, if K→XK \rightarrow X and X→AX \rightarrow A where KK is a candidate key, XX is not a superkey, and AA is a prime attribute, this transitive dependency is allowed in 3NF but causes redundancy.
  • Option B (True): Dependencies of the form X→AX \rightarrow A where AA is a prime attribute and XX is not a superkey are allowed in 3NF. Since XX is not a superkey, this causes data redundancy.
  • Option C (False): If prime attributes are only on the left-side (e.g., X→YX \rightarrow Y where YY contains non-prime attributes), then for the relation to be in 3NF, XX must be a superkey. If XX is a superkey, this dependency is also valid in BCNF and does not introduce BCNF-level redundancy.
  • Option D (True): If a dependency X→YX \rightarrow Y involves only prime attributes and XX is not a superkey, it is allowed in 3NF (since YY consists of prime attributes) but violates BCNF, leading to redundancy.

Example: Consider a relation R(A,B,C)R(A, B, C) with candidate keys ABAB and BCBC. All attributes A,B,CA, B, C are prime. The dependency C→AC \rightarrow A is non-trivial, involves only prime attributes (Option D), has a prime attribute on the right-side (Option B), and represents a transitive dependency of AA on ABAB (Option A). This relation is in 3NF but not in BCNF, and contains redundant data.

Free practice · Your answers on this page are not saved.

Published
Report a correction
Keep exploringMore Normal Forms questions