GATE | GATE CS 1999 | Question 32

Last Updated :
Discuss
Comments
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:
Not in 2NF
In 2NF but not in 3NF
In 3NF but not in 2NF
In both 2NF and 3NF

This question is part of this quiz :

Database Design(Normal Forms),GATE CS 1999
Tags:
DBMS Quiz
GATE
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy