City Guilds Model Questions Vol1 2025 Information Technology Question 5
Practice objective / multiple choice question 5 from the 2025 City Guilds Model Questions Vol1 Information Technology examination.
A relation R(A, B, C, D, E) has the following functional dependencies:\n\n1. \(A \rightarrow B C\)\n2. \(B D \rightarrow E\)\n3. \(C \rightarrow D\)\n4. \(E \rightarrow A\)\n\n(a) List all candidate keys of R.\n(b) Decompose R into a collection of relations that are in Boyce‑Codd Normal Form (BCNF) using the synthesis algorithm, and state the resulting relation schemas.\n(c) For the original relation R, state the highest normal form it satisfies (1NF, 2NF, 3NF, BCNF) and justify your answer.
Answer Options
About This Question
This is City Guilds Model Questions Vol1 2025 Information Technology Question 5. It is one of the objective questions from the 2025 City Guilds Model Questions Vol1 Information Technology 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.