Computer Science · Database Management Systems
Let R(A, B, C, D) be a relational schema with the following functional dependencies: A → B, B → C, C → D, D → B The decomposition of R into (A, B), (B, C), and (B, D):
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1gives a lossless join, and is dependency preserving
- 2gives a lossless join, but is not dependency preserving✓
- 3does not give a lossless join, but is dependency preserving
- 4does not give a lossless join and is not dependency preserv ing
Correct answer
gives a lossless join, but is not dependency preserving
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