Computer Science · Database Management Systems
Consider a relation schema r(A, B, C, D) with functional dependencies F = {A → B, A → D, A → C, B → D}. We decompose r into r1(A, B, C) and r2(B, D). Which of the following statements are correct? (I) Decomposition is lossless (II) Decomposition is dependency preserving (III) (FDs in r1) ∪ (FDs in r2) = F (IV) Decomposition is in BCNF
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1III and IV
- 2I, II and IV✓
- 3I and II
- 4Only I
Correct answer
I, II and IV
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