Problem I:

Consider the following schema of R(A, B, C, D) with functional dependencies:

A -> B, B-> C, and B->D

1- Compute the closure sets of R.

2- Find all non-trivial dependencies.

3- What are the candidate keys of R?

4- What is the highest normal form of R?

Problem II:

Suppose you have a relation schema about teaching classes that has the following attributes: Class, Instructor, Time and Room

Based on your understanding of this scenario, what functional dependencies can you identify that hold on this relation?

Problem III:

Research the definition of a "minimal cover". Explain it in your own words and give an example.

Problem IV:

Consider the following relation R with sample data where names are unique:

1- What functional dependencies can you conclude from the data above?

2- What is the highest normal form R is in?

3- If R is not in BCNF, then decompose R to become in BCNF and show that all functional dependencies still hold.