City Guilds Model Questions Vol1 2019 Information Technology Question 27

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

City Guilds Model Questions Vol1 2019 Information Technology Objective / Multiple Choice Medium Difficulty
Question 27 CITY_GUILDS_MODEL_QUESTIONS_VOL1 • 2019 • INFORMATION_TECHNOLOGY • objective

Consider a relation \(R(A,B,C,D,E)\) with the set of functional dependencies: \(A \rightarrow B\), \(B \rightarrow C\), \(C \rightarrow D\), and \(A \rightarrow E\). (i) Identify all candidate keys of \(R\). (ii) State the highest normal form that \(R\) satisfies. (iii) Decompose \(R\) into a collection of relations that are in Boyce‑Codd Normal Form (BCNF).

Answer Options

A. Candidate key: {A,B}; Highest normal form: 1NF; BCNF decomposition: R1(A,B) and R2(C,D,E)
Correct Answer B. Candidate key: {A}; Highest normal form: 2NF; BCNF decomposition: R1(B,C) and R2(A,B,D,E)
C. Candidate key: {A,E}; Highest normal form: 2NF; BCNF decomposition: R1(A,B) and R2(C,D,E)
D. Candidate key: {B}; Highest normal form: 3NF; BCNF decomposition: R1(A,B,C) and R2(A,D,E)
Correct Answer
B
Correct Option:
Candidate key: {A}; Highest normal form: 2NF; BCNF decomposition: R1(B,C) and R2(A,B,D,E)

About This Question

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

Difficulty level: Medium .

View More City Guilds Model Questions Vol1 2019 Information Technology Questions More City Guilds 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