Neco 2025 Computer Studies Question 1

Practice objective / multiple choice question 1 from the 2025 Neco Computer Studies examination.

Neco 2025 Computer Studies Objective / Multiple Choice Hard Difficulty
Question 1 NECO • 2025 • COMPUTER_STUDIES • objective

A relation R(A,B,C,D,E) has the set of functional dependencies: \( A \rightarrow B \), \( B \rightarrow C \), \( C \rightarrow D \), \( D \rightarrow E \), and \( A \rightarrow E \). Decompose R into BCNF using the standard decomposition algorithm. State the resulting relations, indicate whether the decomposition is lossless‑join, and comment on dependency preservation.

Answer Options

A. Relations: R1(A,B), R2(B,C), R3(A,E), R4(D,E). Lossless‑join: Yes. Dependency preservation: A→B, B→C, C→D are preserved; D→E is not preserved.
Correct Answer B. Relations: R1(A,B), R2(B,C), R3(A,D), R4(D,E). Lossless‑join: Yes. Dependency preservation: A→B, B→C and D→E are preserved; C→D is not preserved.
C. Relations: R1(A,B), R2(B,C), R3(C,D), R4(D,E). Lossless‑join: Yes. Dependency preservation: A→B, B→C, C→D and D→E are preserved.
D. Relations: R1(A,B), R2(B,C), R3(A,D), R4(D,E). Lossless‑join: No. Dependency preservation: Only A→B and B→C are preserved.
Correct Answer
B
Correct Option:
Relations: R1(A,B), R2(B,C), R3(A,D), R4(D,E). Lossless‑join: Yes. Dependency preservation: A→B, B→C and D→E are preserved; C→D is not preserved.

About This Question

This is Neco 2025 Computer Studies Question 1. It is one of the objective questions from the 2025 Neco Computer Studies examination.

Difficulty level: Hard .

View More Neco 2025 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