Gce Model Questions Vol1 2017 Computer Studies Question 5

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

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

Consider a relation R(A,B,C,D,E) with the functional dependencies: A → B, BC → D, and D → E. (a) List all candidate keys of R. (b) Decompose R into BCNF relations. (c) If the original relation contains 1200 tuples, what is the maximum possible total number of tuples stored across all the BCNF tables after decomposition, assuming the decomposition is lossless‑join and introduces no unnecessary duplicate tuples beyond those required for the join?

Answer Options

A. Candidate key: AD; BCNF tables: R1(A,B), R2(B,C), R3(D,E); Maximum total tuples: 2400
Correct Answer B. Candidate key: AC; BCNF tables: R1(A,B), R3(D,E), R4(A,C,D); Maximum total tuples: 3600
C. Candidate key: AB; BCNF tables: R1(A,B), R3(D,E), R4(A,B,D); Maximum total tuples: 4800
D. Candidate key: AC; BCNF tables: R1(A,B), R2(B,C), R4(A,C,D); Maximum total tuples: 3000
Correct Answer
B
Correct Option:
Candidate key: AC; BCNF tables: R1(A,B), R3(D,E), R4(A,C,D); Maximum total tuples: 3600

About This Question

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

Difficulty level: Hard .

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