City Guilds Model Questions Vol1 2017 Information Technology Question 16

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

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

A relation R(A,B,C,D,E) has the functional dependencies: A → B, A → C, BC → D, and D → E. Determine a lossless‑join decomposition of R into BCNF, list the resulting schemas, and state whether the decomposition preserves all functional dependencies.

Answer Options

A. BCNF decomposition: {A,B,C}, {A,D}, {B,E}. The decomposition is lossless‑join and preserves all functional dependencies.
Correct Answer B. BCNF decomposition: {B,C,D}, {A,B}, {A,C}, {A,E}. The decomposition is lossless‑join but does not preserve the dependency D → E.
C. BCNF decomposition: {A,B}, {C,D}, {A,E}. The decomposition is lossless‑join but does not preserve the dependency A → C.
D. BCNF decomposition: {B,C}, {A,D,E}. The decomposition is not lossless‑join and does not preserve the dependency D → E.
Correct Answer
B
Correct Option:
BCNF decomposition: {B,C,D}, {A,B}, {A,C}, {A,E}. The decomposition is lossless‑join but does not preserve the dependency D → E.

About This Question

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

Difficulty level: Hard .

View More City Guilds Model Questions Vol1 2017 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