City Guilds Model Questions Vol1 2019 Information Technology Question 47

Practice objective / multiple choice question 47 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 47 CITY_GUILDS_MODEL_QUESTIONS_VOL1 • 2019 • INFORMATION_TECHNOLOGY • objective

Consider a relation R(A, B, C, D) with functional dependencies: A → B, C → D, and AC → B D. (i) Find a minimal cover of the dependencies. (ii) State the highest normal form that R satisfies. (iii) Decompose R into a set of relations that are in Boyce‑Codd Normal Form (BCNF).

Answer Options

A. Minimal cover: {A→B, C→D, AC→B}. Highest normal form: 2NF. BCNF decomposition: R1(A,B), R2(A,C), R3(C,D).
B. Minimal cover: {A→B, C→D}. Highest normal form: 2NF. BCNF decomposition: R1(A,B), R2(C,D).
C. Minimal cover: {A→B, C→D, AC→D}. Highest normal form: 3NF. BCNF decomposition: R1(A,B), R3(C,D), R4(A,C,D).
Correct Answer D. Minimal cover: {A→B, C→D}. Highest normal form: 1NF. BCNF decomposition: R1(A,B), R3(C,D), R4(A,C).
Correct Answer
D
Correct Option:
Minimal cover: {A→B, C→D}. Highest normal form: 1NF. BCNF decomposition: R1(A,B), R3(C,D), R4(A,C).

About This Question

This is City Guilds Model Questions Vol1 2019 Information Technology Question 47. 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