0% found this document useful (0 votes)
149 views1 page

Q.1 Let Relation R (A, B, C, D, E, F) With Foll. FDS: A - B de - Ac D - F State R Is in Which Normal Form. Decompose It To BCNF

The relation R with attributes A,B,C,D,E,F has functional dependencies A->B, DE->AC, and D->F. The relation R is in first normal form since it contains partial and transitive dependencies that violate higher normal forms. R can be decomposed into BCNF by separating the relation into two relations based on candidate keys.

Uploaded by

Vipula Rawte
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
149 views1 page

Q.1 Let Relation R (A, B, C, D, E, F) With Foll. FDS: A - B de - Ac D - F State R Is in Which Normal Form. Decompose It To BCNF

The relation R with attributes A,B,C,D,E,F has functional dependencies A->B, DE->AC, and D->F. The relation R is in first normal form since it contains partial and transitive dependencies that violate higher normal forms. R can be decomposed into BCNF by separating the relation into two relations based on candidate keys.

Uploaded by

Vipula Rawte
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Q.1 Let relation R=(A,B,C,D,E,F) with foll. FDs: A->B DE->AC D->F State R is in which normal form.

Decompose it to BCNF. Soln: Key:- DE Since, there are PD(D->F) and TD(A->B), R is in 1NF

You might also like