Consider a relation R(A, B, C, D) with the functional dependencies:

$A \rightarrow B,\; B \rightarrow C,\; A \rightarrow D$.

(a) What is the highest normal form (up to BCNF) that R satisfies?

(b) Decompose R into a collection of relations that are in Boyce‑Codd Normal Form (BCNF). List the resulting relation schemas.

Question

Consider a relation R(A, B, C, D) with the functional dependencies:

$A \rightarrow B,\; B \rightarrow C,\; A \rightarrow D$.

(a) What is the highest normal form (up to BCNF) that R satisfies?

(b) Decompose R into a collection of relations that are in Boyce‑Codd Normal Form (BCNF). List the resulting relation schemas.

Accepted Answer

(a) 2NF; (b) {R1(B, C), R2(A, B, D)}

Gce Model Questions Vol1 2024 Computer Studies Question 14