GALGOTIAS COLLEGE OF ENGINEERING AND TECHNOLOGY

1, Knowledge Park-II, Greater Noida, UP.

ASSIGNMENT 3

Issue Date: /11/2022 Submission Date: /11/22

CO3: Identify and solve the redundancy problem in database tables using normalization.
Q.1 Consider the universal relation R= {A,B,C,D,E,F,G,H,I,J} and a set of functional
dependencies F= { {AB→ C}, { A → DE}, { B→ F}, {F→ GH}, {D→ IJ}}.
a) What is the key for R? 
b) Decompose R into 2NF, then 3NF relations.

Q.2 Consider the relation R: (A, B, C, D, E, F, G, H) with following FDs: F :{ AC → G, D →

EG, BC →D, CG →BD, ACD →B, CE →AG}, Find the canonical cover of F.

Q.3 Explain dependency preserving decomposition. Given two sets F1 and F2 of FDs for a
relation R (A, B, C, D, E). F1:A→ B, AB →C, D →AC, D →E, F2: A →BC, D →AE. Are
Fl and F2 equivalent? Explain.

Q.4 The following functional dependencies hold true for the relational scheme R ( W , X , Y , Z )
– 
       X → W, WZ → XY, Y → WXZ. Write the irreducible equivalent for this set of
functional dependencies.

Q.5 Explain Multivalve dependency. What are the desirable properties of decomposition?