Homework

Dear collegues,

Here you have a copy of some exercises in my Database subject at the University, if somedoby could helme to do it I will be most thankfull:

HOMEWORK 1 A-1) There is the follwing relation R{a,b,h,e,f} with the following functional dependecies:

{a,b}---> {h,e}
{h}-----> {e}
{b}-----> {f}

to solve:
1) Do the graph for functionals dependencies y show in what Normal form it is
2) If there is update anomalies (which are them) 3) Do the process of normalization to get a group of relations BCNF (Boyce-Codd Normal Form)

A-2) Since there is the relation R {A,B,C,D,F,G} that has the following functional dependencies :

{A} --> {B,C}
{D} --> {C,F,G}
{B} --> {C}

and key candidate {A,D}

1. Do the graph for the Functionals dependencies
2. Show en what Normal form is the relation
3. Show if it is possible to analize by Bouyce-Codd. Make the justification by yes or no
4. Show if it has update anomalies. Make the justification by yes or no
5. Only if it necessary try to use el procedure to get them into a group of relations in BCNF

A-3) There is a relation R, composed by the atributes: name(lonely), Street, City, State and State Code. Considering that for each State Code (zipcode) there is one and only one city and State; and for each Street, City, and State exist only one State Code (zipcode). Solve:

1. The functionals dependencies that exist considering the information given in the text and make the graph of them
2. Find and show the key canditates of the relation R
3. In which Normal Form s the relation R? Why?
4. Analize the relation R and find and show if there is the possibility to get them a Normal Form more convenient
5. if it was possible, do it explaining all the steps followed: