GATE CS 2021 (Forenoon) — Question 43

Database Management Systems (DBMS)Normalization Schemes (1NF, 2NF, 3NF, BCNF Boundaries)MCQ2 marks · −2/3 if wrongMedium

Consider the relation \(R(P, Q, S, T, X, Y, Z, W)\) with the following functional dependencies \(PQ \rightarrow X; P \rightarrow YX; Q \rightarrow Y; Y \rightarrow ZW\) Consider the decomposition of the relation \(R\) into the constituent relations according to the following two decomposition schemes. \(D_1 : R = [\{P, Q, S, T\}; \{P, T, X\}; \{Q, Y\}; \{Y, Z, W\}]\) \(D_2 : R = [\{P, Q, S\}; \{T, X\}; \{Q, Y\}; \{Y, Z, W\}]\) Which one of the following options is correct?
  1. A
    \(D_1\) is a lossless decomposition, but \(D_2\) is a lossy decomposition.
  2. B
    \(D_1\) is a lossy decomposition, but \(D_2\) is a lossless decomposition.
  3. C
    Both \(D_1\) and \(D_2\) are lossless decompositions.
  4. D
    Both \(D_1\) and \(D_2\) are lossy decompositions.
Practise the full 2021-FN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkDatabase System Concepts (Korth)Normalisation, SQL, transactions and indexing — the DBMS syllabus in one book.
Practise more on Normalization Schemes (1NF, 2NF, 3NF, BCNF Boundaries)Timed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group