City Guilds Model Questions Vol1 2021 Information Technology Question 11
Practice objective / multiple choice question 11 from the 2021 City Guilds Model Questions Vol1 Information Technology examination.
Consider a relation R(E, D, P, H, S) with the functional dependencies: (i) \(E \rightarrow D, S\); (ii) \(P \rightarrow H\); (iii) \(D \rightarrow E\). (a) Determine all candidate keys of R. (b) State the highest normal form that R satisfies. (c) Decompose R into a set of relations that are in Boyce‑Codd Normal Form (BCNF). Indicate whether the decomposition preserves all functional dependencies.
Answer Options
About This Question
This is City Guilds Model Questions Vol1 2021 Information Technology Question 11. It is one of the objective questions from the 2021 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.