Problem 1

Consider the relation with the following dependencies:

• FD1:
• FD2:
• FD3:
• FD4:
• FD5:
• FD6:

(a). Determine if Any of the 10 Pairs Are Candidate Keys of R. just Say Yes or no for Each Row and You Do not Need to Show Your Work

(b). Decompose , if Necessary, so that All the Resultant Relations Are in Bcnf. for the Decomposition, Pick in Ascending order of the Functional Dependences, i.e., Consider FD1, FD2, FD3, Etc in that Order. for Each Bcnf Relation, Underline Its Primary Key

• - Left side is not a candidate key so we decompose into and
• - Left side is not a candidate key so we decompose into and
• - Left side is not a candidate key so we decompose into and
• - Left side is not a candidate key so we decompose into and

We've now exhausted all functional dependencies so we get the final solution , , , , and .

Problem 2

For the following ER diagram, create an optimal relational schema. Underline the primary keys; and specify the foreign keys with bolded fonts.