1. Define 1NF, 2NF, 3NF and BCNF, respectively. 2. Explain the normalization process. 3. Consider a relation R(A, B, C, D, E) with the following dependencies: {A, B} {C} {C, D} > {E} {D. E) > {B} Is AB a candidate key of this relation? If not, is ABD? Explain your answer. 4. Consider the relation R= {A, B, C, D, E, F, G, H, I, J} and the set of functional dependencies S={{A, B} > {C}, {A} -> {D.E}, {B} -> {F}. {F} ->{G. H}, {D}>{I, J} }. • What is the key of R? • Decompose R into 2NF, then 3NF relations. Show your steps to achieve 2NF and 3NF by specifying all the functional dependencies. 5. Consider the relation R={A, B, C, D, E, F, G, H, I, J, K) and the set of functional dependencies S= {{A, B} {C}, {B. D} -> {E.F}, {A, D} > {G, H}, {B} > {I}, {G} > {J}, {F} > {K}} What is the key of R? • Decompose R (1) into 2NF, (2) then into 3NF relations, and (3) check whether the 3NF relations you obtained are in BCNF or not. Show your steps to achieve 2NF and 3NF by specifying all the functional dependencies.
