Neco 2025 Data Processing Question 31

Practice objective / multiple choice question 31 from the 2025 Neco Data Processing examination.

Neco 2025 Data Processing Objective / Multiple Choice Medium Difficulty
Question 31 NECO • 2025 • DATA_PROCESSING • objective

Consider a relation R(A,B,C,D) with functional dependencies: A \rightarrow B, BC \rightarrow D, and D \rightarrow A. Determine (i) all candidate keys of R, (ii) the highest normal form (1NF, 2NF, 3NF, BCNF) that R satisfies, and (iii) if R is not in BCNF, give a lossless‑decomposition of R into BCNF relations that preserves the dependencies.

Answer Options

A. Candidate keys: AB, AD, BD. Highest normal form: 2NF. BCNF decomposition: R1(A,B), R2(B,C), R3(C,D).
Correct Answer B. Candidate keys: AC, BC, CD. Highest normal form: 3NF. BCNF decomposition: R1(A,B), R2(D,A), R3(B,C,D).
C. Candidate keys: AC, BD, CD. Highest normal form: BCNF. BCNF decomposition: R1(A,B), R2(C,D), R3(A,D).
D. Candidate keys: A, B, C. Highest normal form: 3NF. BCNF decomposition: R1(A,B,C), R2(C,D).
Correct Answer
B
Correct Option:
Candidate keys: AC, BC, CD. Highest normal form: 3NF. BCNF decomposition: R1(A,B), R2(D,A), R3(B,C,D).

About This Question

This is Neco 2025 Data Processing Question 31. It is one of the objective questions from the 2025 Neco Data Processing examination.

Difficulty level: Medium .

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