Skip to content
Related Articles

Related Articles

GATE | GATE CS 1999 | Question 32
  • Difficulty Level : Easy
  • Last Updated : 22 Apr, 2020

Consider the schema R= ( S, T, U, V ) and the dependencies S→T, T→U, U→V and V→S. Let R (R1 and R2) be a decomposition such that R1∩R2 ≠ Ø. The decomposition is:
(A) Not in 2NF
(B) In 2NF but not in 3NF
(C) In 3NF but not in 2NF
(D) In both 2NF and 3NF


Answer: (D)

Explanation: R1∩R2 ≠ Ø means there is common attribute in R1 and R2.

Now if we choose a decomposition positively then we can choose something like R1(S, T, U) and R2(U, V) then we can say that decomposition is lossless because common attribute is U and LHS of every FDs are candidate key, therefore it is in 2NF as well as 3NF.

Option (D) is correct.

Quiz of this Question

sudo-gate-course

My Personal Notes arrow_drop_up
Recommended Articles
Page :