Gce Model Questions Vol1 2020 Computer Studies Question 5

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

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

Consider a relation R(A, B, C, D) with the following functional dependencies: 1. A → B 2. BC → D 3. D → A (a) List all candidate keys of R. (b) State the highest normal form (1NF, 2NF, 3NF, BCNF) that R currently satisfies. (c) Decompose R into a collection of relations that are in BCNF. Show the resulting relations and their attributes.

Answer Options

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

About This Question

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

Difficulty level: Hard .

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