Computer Science · Database Management Systems
Given below are two statements: one is labelled as Assertion A and the other is labelled as Reason R. Assertion A: Decomposing a relation R(A, B, C) with the functional dependency A → B into two sub-relations R1(A, B) and R2(A, C) guarantees a lossless decomposition. Reason R: The common attribute {A} between R1 and R2 acts as the determinant for all attributes of R1, satisfying the formal condition of Heath's Theorem. In the light of the above statements, choose the most appropriate answer from the options given below:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1A is not correct but R is correct
- 2A is correct but R is not correct
- 3Both A and R are correct and R is the correct explanation of A✓
- 4Both A and R are correct but R is NOT the correct explanation of A
Correct answer
Both A and R are correct and R is the correct explanation of A
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Database Management Systems MCQs →Want more practice questions on Database Management Systems?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Database Management Systems