City Guilds Model Questions Vol1 2024 Information Technology Question 26

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

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

Consider a relation \(R(A,B,C,D,E)\) with functional dependencies: \(A \rightarrow B\), \(A \rightarrow C\), \(BC \rightarrow D\), \(D \rightarrow E\). (a) List all candidate keys of \(R\). (b) State the highest normal form that \(R\) satisfies. (c) Provide a lossless‑join, dependency‑preserving decomposition of \(R\) into relations that are in Third Normal Form.

Answer Options

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

About This Question

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

Difficulty level: Medium .

View More City Guilds Model Questions Vol1 2024 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