Given a relation R(A, B, C) with the set of functional dependencies F = {A ->…

Given a relation R(A, B, C) with the set of functional dependencies F = {A -> B, B -> C, C -> B}.

(i) A lossless-join decomposition of R is always possible.

(ii) A dependency-preserving decomposition of R is always possible.

Assume every decomposition considered includes all the attributes of R, and "always possible" means at least one such decomposition exists (not that every decomposition has the stated property).

  1. A.

    Both (i) and (ii) are true

  2. B.

    Only (i) is true

  3. C.

    Only (ii) is true

  4. D.

    Both (i) and (ii) are false

Attempted by 397 students.

Sign up free to check your answer

Sign up free

Explore the full course: Isro

Loading lesson…