Gce Model Questions Vol1 2025 Computer Studies Question 39
Practice objective / multiple choice question 39 from the 2025 Gce Model Questions Vol1 Computer Studies examination.
Consider a relation \(R(A,B,C,D,E)\) with the functional dependencies: \(A \rightarrow B\) \(B \rightarrow C\) \(AD \rightarrow E\) \(C \rightarrow D\) 1. Identify the candidate key(s) of \(R\). 2. Determine whether \(R\) is in Boyce‑Codd Normal Form (BCNF). 3. If it is not, decompose \(R\) into BCNF relations using the standard decomposition algorithm. How many relations result from the decomposition?
Answer Options
About This Question
This is Gce Model Questions Vol1 2025 Computer Studies Question 39. 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.