Neco 2020 Computer Studies Question 8

Practice objective / multiple choice question 8 from the 2020 Neco Computer Studies examination.

Neco 2020 Computer Studies Objective / Multiple Choice Hard Difficulty
Question 8 NECO • 2020 • COMPUTER_STUDIES • objective

Consider a relation R(A,B,C,D,E) with functional dependencies: A\rightarrow B, BC\rightarrow D, D\rightarrow E, and A\rightarrow C. (a) Identify the highest normal form of R. (b) Decompose R into a set of relations that are in Boyce‑Codd Normal Form (BCNF). (c) State whether the decomposition is lossless‑join and whether it preserves all functional dependencies. List the resulting BCNF relations.

Answer Options

Correct Answer A. Highest normal form: 2NF. BCNF relations: R1(B,C,D), R21(A,B), R221(A,C), R222(A,E). The decomposition is lossless‑join but not dependency‑preserving.
B. Highest normal form: 2NF. BCNF relations: R1(B,C,D), R21(A,B), R221(A,E), R222(A,C). The decomposition is not lossless‑join and not dependency‑preserving.
C. Highest normal form: 3NF. BCNF relations: R1(B,C,D), R21(A,B), R221(A,C), R222(A,E). The decomposition is lossless‑join and dependency‑preserving.
D. Highest normal form: 2NF. BCNF relations: R1(B,C,D), R21(A,B), R221(A,C). The decomposition is lossless‑join but not dependency‑preserving.
Correct Answer
A
Correct Option:
Highest normal form: 2NF. BCNF relations: R1(B,C,D), R21(A,B), R221(A,C), R222(A,E). The decomposition is lossless‑join but not dependency‑preserving.

About This Question

This is Neco 2020 Computer Studies Question 8. It is one of the objective questions from the 2020 Neco Computer Studies examination.

Difficulty level: Hard .

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