Which normalization form eliminates transitive dependencies?

• A. 1NF
• B. 3NF
• C. 2NF
• D. BCNF

Answer: (B)

Transitive dependency shows up when a non-prime attribute depends on another non-prime attribute, which itself depends on a key. In a table, if A is a key, A determines B, and B determines C, then C is transitively dependent on A via B. The way 3NF handles this is by ensuring every non-prime attribute depends directly on a candidate key, not through another non-prime attribute. So if such a chain exists, you split the relation so that C’s value is determined by a key, not by B. This decomposition eliminates the transitive dependency and leaves only direct key-to-attribute dependencies.

That’s why this normalization form is the standard remedy for transitive dependencies. (1NF and 2NF don’t address transitive dependencies, while BCNF is stricter and may require further decomposition even beyond removing transitive cases.)