Gce Model Questions Vol1 2021 Computer Studies Question 1

Practice objective / multiple choice question 1 from the 2021 Gce Model Questions Vol1 Computer Studies examination.

Gce Model Questions Vol1 2021 Computer Studies Objective / Multiple Choice Hard Difficulty
Question 1 GCE_MODEL_QUESTIONS_VOL1 • 2021 • COMPUTER_STUDIES • objective

Consider a relation R(A,B,C,D) with the functional dependencies (A \rightarrow B), (BC \rightarrow D) and (D \rightarrow A\).\n\n(a) List all candidate keys of R.\n(b) State the highest normal form (1NF, 2NF, 3NF or BCNF) that R satisfies.\n(c) Give a lossless‑join, dependency‑preserving decomposition of R into relations that are in BCNF.

Answer Options

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

About This Question

This is Gce Model Questions Vol1 2021 Computer Studies Question 1. It is one of the objective questions from the 2021 Gce Model Questions Vol1 Computer Studies examination.

Difficulty level: Hard .

View More Gce Model Questions Vol1 2021 Computer Studies Questions More Gce 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