Consider the schema. R = (ABCD) and the dependencies A -> B. B -> C. C -> D. and D -> A. Let R = (R1 and R2) be a decomposition, such that R1 (1 R2 = (D. The decomposition is in .
Correct Answer:
both 2 NF and 3 NF
Explanation:
Note: This Question is unanswered, help us to find answer for this one
More Computer Science MCQ Questions