...
Question 6837 – UGC NET CS 2016 Aug- paper-3
April 14, 2024
Question 6841 – UGC NET CS 2016 Aug- paper-3
April 14, 2024
Question 6837 – UGC NET CS 2016 Aug- paper-3
April 14, 2024
Question 6841 – UGC NET CS 2016 Aug- paper-3
April 14, 2024

Question 6838 – UGC NET CS 2016 Aug- paper-3

Consider the table R with attributes A, B and C. The functional dependencies that hold on R are : A → B, C → AB. Which of the following statements is/are True ?
I. The decomposition of R into R1(C, A) and R2(A, B) is lossless.
II. The decomposition of R into R1(A, B) and R2(B, C) is lossy.

Correct Answer: C

Question 10 Explanation: 

Here ‘B’ is common attribute but ‘B’ is not the primary key in any of the decomposed relations (R1 or R2). Hence this decomposition is not a lossless decomposition i.e., it is a lossy decomposition.
Hence, option (C) is correct.
A
Only I
B
Only II
C
Both I and II
D
Neither I nor II
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!