City Guilds Model Questions Vol1 2025 Information Technology Question 8

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

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

Consider a relation R(A, B, C, D) with the functional dependencies: \(A \rightarrow B\), \(B \rightarrow C\), \(A \rightarrow D\).\n(a) List all candidate keys of R.\n(b) State the highest normal form (1NF, 2NF, 3NF, BCNF) that R satisfies.\n(c) Provide a lossless, dependency‑preserving decomposition of R into BCNF relations.

Answer Options

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

About This Question

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

Difficulty level: Medium .

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