Question: Part 1 : Normalization 1 . Consider a table Alphabet ( A , B , C , D , E ) with the following functional
Part : Normalization
Consider a table Alphabet A B C D E with the following functional dependencies:
FD: ABC
FD: ACB
FD: BCA
FD: DE
a Determine all the candidate keys for the table. Write none if you think there are no CK or PK Explain your answer or show your work points
b Determine the current normal form of the table. Justify your answer. points
c Normalize the table to at least NF Identify the primary key and foreign keys for the new normalized tables. If a table does not have a foreign key, write none. Explain your answer points
Consider the relation schema:
R A B C D E F
and the set of functional dependencies FDs:
A B
B A
BC E
BC D
E F
BC F
a List the candidate key CK and primary key PK for R Write none if you think there are no CK or PK Explain your answer or show your work points
b Determine the normal form for R Explain your answer. points
c Decompose R into tables that are at least in NF Explain your answer. List all the PKs and foreign keys for the newly created tables points
Given the Students table below, answer the following questions:
Note: FNAME faculty name; FOFFICE Faculty Office
a Write the functional dependencies and identify all dependencies in the table. You should clearly state the primary key, type of dependencies and any other assumptions that you may have. points
b Write the relational schema to meet the NF requirements or to the greatest extent possible. Identify the normal forms for each new table structure you created. You should clearly state the primary key, foreign key if exist type of dependencies if exist and any other assumptions that you may have for the newly normalized tables. points
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
