Gce Model Questions Vol1 2025 Computer Studies Question 12

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

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

Consider a relation \(R(A,B,C,D)\) with functional dependencies \(A \rightarrow B\), \(BC \rightarrow D\) and \(D \rightarrow A\).\n(a) State the highest normal form that \(R\) satisfies.\n(b) Decompose \(R\) into a set of relations that are in Boyce‑Codd Normal Form (BCNF).\n(c) How many relations result from this BCNF decomposition and does the decomposition preserve a lossless join?

Answer Options

Correct Answer A. Highest NF: 1NF; BCNF decomposition yields 3 relations; lossless join is preserved.
B. Highest NF: 1NF; BCNF decomposition yields 2 relations; lossless join is not preserved.
C. Highest NF: 3NF; BCNF decomposition yields 4 relations; lossless join is preserved.
D. Highest NF: 2NF; BCNF decomposition yields 2 relations; lossless join is not preserved.
Correct Answer
A
Correct Option:
Highest NF: 1NF; BCNF decomposition yields 3 relations; lossless join is preserved.

About This Question

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

Difficulty level: Hard .

View More Gce Model Questions Vol1 2025 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