City Guilds Model Questions Vol1 2019 Information Technology Question 7

Practice objective / multiple choice question 7 from the 2019 City Guilds Model Questions Vol1 Information Technology examination.

City Guilds Model Questions Vol1 2019 Information Technology Objective / Multiple Choice Hard Difficulty
Question 7 CITY_GUILDS_MODEL_QUESTIONS_VOL1 • 2019 • INFORMATION_TECHNOLOGY • objective

Relation R(E,F,G,H) has the functional dependencies: E\(\rightarrow\)F, F\(\rightarrow\)G, G\(\rightarrow\)H, and GH\(\rightarrow\)E. Is it possible to decompose R into a set of relations that are all in Boyce‑Codd Normal Form (BCNF), while preserving all functional dependencies and ensuring a lossless‑join? If such a decomposition exists, give one example; if not, explain why.

Answer Options

Correct Answer A. No such decomposition exists; any BCNF decomposition will lose at least one dependency (e.g., GH→E).
B. It is possible to decompose R into BCNF relations such as R1(E,F), R2(F,G), and R3(G,H), which maintains a lossless join.
C. Yes, a BCNF decomposition is possible; for example, decompose into R1(E,F) and R2(F,G,H) which preserves all dependencies.
D. A lossless‑join BCNF decomposition can be achieved by splitting R into R1(E,F,G) and R2(G,H), preserving all functional dependencies.
Correct Answer
A
Correct Option:
No such decomposition exists; any BCNF decomposition will lose at least one dependency (e.g., GH→E).

About This Question

This is City Guilds Model Questions Vol1 2019 Information Technology Question 7. It is one of the objective questions from the 2019 City Guilds Model Questions Vol1 Information Technology examination.

Difficulty level: Hard .

View More City Guilds Model Questions Vol1 2019 Information Technology Questions More City Guilds Model Questions Vol1 Practice Questions Back to Questions

Master the Exam!

You've seen a preview, but there are thousands more questions plus AI tutor to break down complex solutions.

Unlock Full Access Available for Android & Windows
Chat with Support