Neco 2020 Computer Studies Question 47
Practice objective / multiple choice question 47 from the 2020 Neco Computer Studies examination.
Consider a relation \(R(A, B, C, D, E, F)\) with the functional dependencies: \(A \rightarrow B C\), \(B D \rightarrow E\), \(C \rightarrow D\), \(E \rightarrow F\), and \(F \rightarrow A\). Determine a lossless‑join, dependency‑preserving decomposition of \(R\) into relations that are in Third Normal Form (3NF). How many relations are in the decomposition, and what is the total number of attribute occurrences (counting repetitions across relations) in the resulting set of relations? Provide your answer as two integers separated by a comma.
Answer Options
About This Question
This is Neco 2020 Computer Studies Question 47. It is one of the objective questions from the 2020 Neco 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.