Neco 2024 Computer Studies Question 15

Consider a relation R(A,B,C,D) containing 1,000 tuples. The functional dependencies are \(A \rightarrow B\), \(B \rightarrow C\), and \(C \rightarrow D\).\n\n(a) Identify the candidate key(s) of R and state the highest normal form that R satisfies.\n(b) Decompose R into a set of relations that are in Boyce‑Codd Normal Form (BCNF) while preserving all functional dependencies. List the resulting relations.\n(c) Assuming that in the original relation each distinct value of A appears the same number of times, that A uniquely determines B, B uniquely determines C and C uniquely determines D, and that there are exactly 100 distinct A values, compute the total number of tuples stored across all the BCNF relations obtained in part (b).