reopened by
632 views
3 votes
3 votes
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 3NF

C. in 3NF but not in 2 NF

D. in both 2NF and 3NF
reopened by

2 Answers

0 votes
0 votes
here all the attributes are prime attributes....so no matter how we decompose from the condition R1 intersection as R2 as phi we get the relations with prime attributes...so they will be in 3NF ....so answer is D
0 votes
0 votes
Here candidate keys are {S,T,U,V} in which  decompostion of relation will always be in 2nf because there will be no partial dependency also the relation will ne in3nf because every attribute is prime attribute so it is in 3nf.

Hence (d) option answer.

Related questions

4 votes
4 votes
4 answers
1
Tuhin Dutta asked May 27, 2019
2,381 views
In a relation, if every attribute is prime but key may not be simple then the relation is in ______.A. 1NFB. 2NFC. 3NFD. BCNF