City Guilds Model Questions Vol1 2023 Information Technology Question 38

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

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

Consider a relation \(R(A,B,C,D,E)\) with the functional dependencies:\n\(A \rightarrow B C\),\n\(B \rightarrow D\),\n\(C D \rightarrow E\),\n\(E \rightarrow A\).\n(a) List all candidate keys of \(R\).\n(b) Decompose \(R\) into Boyce‑Codd Normal Form (BCNF), giving the resulting relation schemas.\n(c) How many relations are in the final BCNF decomposition?

Answer Options

A. Candidate keys: A, E, CD, BC. BCNF decomposition: R1(B,D), R2(A,B), R3(A,E,C). Number of relations: 3.
B. Candidate keys: A, E, BD, AC. BCNF decomposition: R1(B,D), R2(A,B,C), R3(A,E). Number of relations: 3.
C. Candidate keys: A, E, CD, BC. BCNF decomposition: R1(B,D), R2(A,B,C), R3(A,E). Number of relations: 4.
Correct Answer D. Candidate keys: A, E, CD, BC. BCNF decomposition: R1(B,D), R2(A,B,C), R3(A,E). Number of relations: 3.
Correct Answer
D
Correct Option:
Candidate keys: A, E, CD, BC. BCNF decomposition: R1(B,D), R2(A,B,C), R3(A,E). Number of relations: 3.

About This Question

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

Difficulty level: Hard .

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