# Consider a schema R = {A,B,C,D,E}and the following set of functional dependencies:{AD->B, B->CE, CD->A}Is R in Boyce-Codd normal form? Justify your answer.

Question
4 views

Consider a schema R = {A,B,C,D,E}and the following set of functional dependencies:

check_circle

Step 1

If there is any relation R and we have to check whether the relation is in Boyce–Codd Normal Form (BCNF) or not,then it must fulfill all the conditions given below-

1)Relation must be in 3NF.

2)If there is relation, A→B, then A must be super key.

Prime attribute-

It is a part of a candidate key.

Non-prime attribute-

It is not a part of a candidate key.

If any relation has no transitive dependencies and no partial dependencies, then relation must be in 3NF.

Suppose there is functional dependency A→B, and A is non-prime attribute and B is also non-prime attribute

Then the above relation is not in 3NF.

Transitive dependencies-

If A→B and B&ra...

### Want to see the full answer?

See Solution

#### Want to see this answer and more?

Solutions are written by subject experts who are available 24/7. Questions are typically answered within 1 hour.*

See Solution
*Response times may vary by subject and question.
Tagged in