Computer Science · Database Management Systems
Consider a relation R with attributes {A, B, C} and the functional dependency set S = {A → B, A → C}. Into which two relations can R be decomposed to guarantee a lossless join?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1R1{B} and R2{C}
- 2R1{A, B, C} and R2{A, C}
- 3R1{A, B} and R2{B, C}
- 4R1{A, B} and R2{A, C}✓
Correct answer
R1{A, B} and R2{A, C}
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