Gce Model Questions Vol1 2025 Computer Studies Question 25
Practice objective / multiple choice question 25 from the 2025 Gce Model Questions Vol1 Computer Studies examination.
Consider a relation R(A, B, C, D) with the functional dependencies A → B, B → C and C → D. The domain sizes are |A| = 30, |B| = 30, |C| = 30 and |D| = 30, and the relation currently holds 1200 tuples, assumed to be uniformly distributed. (a) State the highest normal form that R satisfies. (b) Decompose R into a set of BCNF relations. (c) Assuming the decomposition is lossless‑join and that duplicate tuples are eliminated in each resulting relation, estimate the total number of tuples across all BCNF relations after decomposition.
Answer Options
About This Question
This is Gce Model Questions Vol1 2025 Computer Studies Question 25. It is one of the objective questions from the 2025 Gce Model Questions Vol1 Computer Studies examination.
Difficulty level: Hard .
Master the Exam!
You've seen a preview, but there are thousands more questions plus AI tutor to break down complex solutions.