City Guilds Model Questions Vol1 2025 Information Technology Question 49
Practice objective / multiple choice question 49 from the 2025 City Guilds Model Questions Vol1 Information Technology examination.
Consider relation \(R(A,B,C,D,E)\) with functional dependencies: \(A \rightarrow B\), \(B \rightarrow C\), \(A \rightarrow D\), \(D \rightarrow E\).\n\n(i) State the highest normal form (up to BCNF) that \(R\) satisfies.\n(ii) Provide a lossless‑join, dependency‑preserving decomposition of \(R\) into relations that are in BCNF.
Answer Options
About This Question
This is City Guilds Model Questions Vol1 2025 Information Technology Question 49. It is one of the objective questions from the 2025 City Guilds Model Questions Vol1 Information Technology examination.
Difficulty level: Medium .
Master the Exam!
You've seen a preview, but there are thousands more questions plus AI tutor to break down complex solutions.