City Guilds Model Questions Vol1 2024 Information Technology Question 25

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

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

Consider a relation R(A, B, C, D, E) with the functional dependencies: A → B, BC → D, D → E, E → A. (i) List all candidate keys of R. (ii) Decompose R into a collection of relations that are in Boyce‑Codd Normal Form (BCNF). Present each resulting relation by listing its attributes.

Answer Options

A. Candidate keys: AB, BD, AE. BCNF decomposition: R1(A,B), R2(A,D), R3(C,E), R4(D,C).
B. Candidate keys: AB, BC, DE. BCNF decomposition: R1(A,B), R2(B,D), R3(D,E), R4(E,C).
C. Candidate keys: AB, AD, AE. BCNF decomposition: R1(A,B), R2(B,C), R3(C,D), R4(D,E).
Correct Answer D. Candidate keys: AC, CE, CD. BCNF decomposition: R1(A,B), R3(E,A), R5(D,E), R6(D,C).
Correct Answer
D
Correct Option:
Candidate keys: AC, CE, CD. BCNF decomposition: R1(A,B), R3(E,A), R5(D,E), R6(D,C).

About This Question

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

Difficulty level: Hard .

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