Neco 2024 Computer Studies Question 26

Practice objective / multiple choice question 26 from the 2024 Neco Computer Studies examination.

Neco 2024 Computer Studies Objective / Multiple Choice Hard Difficulty
Question 26 NECO • 2024 • COMPUTER_STUDIES • objective

Given a relation R(A,B,C,D,E) with functional dependencies: \( A\rightarrow B \), \( BC\rightarrow D \), \( D\rightarrow E \), and \( AB\rightarrow C \), (a) determine all candidate keys of R, (b) decompose R into BCNF, and (c) state whether the decomposition is lossless‑join and whether it preserves all dependencies.

Answer Options

A. Candidate key: {B}. BCNF decomposition: R1(A,B), R2(C,D,E). Lossless‑join: No. Dependency preserving: No.
Correct Answer B. Candidate key: {A}. BCNF decomposition: R1(B,C,D), R3(A,B), R4(A,C,E). Lossless‑join: Yes. Dependency preserving: No.
C. Candidate key: {A,C}. BCNF decomposition: R1(A,B), R2(B,C), R3(C,D,E). Lossless‑join: Yes. Dependency preserving: Yes.
D. Candidate key: {A,B}. BCNF decomposition: R1(A,B), R2(B,C,D), R3(A,E). Lossless‑join: Yes. Dependency preserving: Yes.
Correct Answer
B
Correct Option:
Candidate key: {A}. BCNF decomposition: R1(B,C,D), R3(A,B), R4(A,C,E). Lossless‑join: Yes. Dependency preserving: No.

About This Question

This is Neco 2024 Computer Studies Question 26. It is one of the objective questions from the 2024 Neco Computer Studies examination.

Difficulty level: Hard .

View More Neco 2024 Computer Studies Questions More Neco 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