City Guilds Model Questions Vol1 2018 Information Technology Question 34

Practice objective / multiple choice question 34 from the 2018 City Guilds Model Questions Vol1 Information Technology examination.

City Guilds Model Questions Vol1 2018 Information Technology Objective / Multiple Choice Hard Difficulty
Question 34 CITY_GUILDS_MODEL_QUESTIONS_VOL1 • 2018 • INFORMATION_TECHNOLOGY • objective

Consider a relation R(A, B, C, D, E) with the following functional dependencies:\n\(A \rightarrow B\), \(A \rightarrow C\), \(BC \rightarrow D\), \(D \rightarrow E\).\nDetermine (i) all candidate keys of R, (ii) the highest normal form that R satisfies, and (iii) a lossless‑join decomposition of R into BCNF relations.

Answer Options

A. Candidate key: A; Highest normal form: 2NF; BCNF decomposition: R1(A,B), R2(C,D), R3(E)
Correct Answer B. Candidate key: A; Highest normal form: 1NF; BCNF decomposition: R1(B,C,D), R21(A,B), R221(A,C), R222(A,E)
C. Candidate key: A; Highest normal form: 1NF; BCNF decomposition: R1(A,B,C), R2(D,E)
D. Candidate key: B; Highest normal form: 1NF; BCNF decomposition: R1(A,B), R2(C,D,E)
Correct Answer
B
Correct Option:
Candidate key: A; Highest normal form: 1NF; BCNF decomposition: R1(B,C,D), R21(A,B), R221(A,C), R222(A,E)

About This Question

This is City Guilds Model Questions Vol1 2018 Information Technology Question 34. It is one of the objective questions from the 2018 City Guilds Model Questions Vol1 Information Technology examination.

Difficulty level: Hard .

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