Consider a relation R(A, B, C, D, E) that satisfies the following set of functional dependencies F = {ABC → D, D → E, E → B, AD → C}. What is the highest normal form this table is currently in?
A. Boyce-Codd Normal Form
B. Second Normal Form
C. Third Normal Form
D. None of the above
Answer:D
Consider a relation R(A, B, C, D, E) that satisfies the following set of functional dependencies F = {ABC → D, D → E, E → B, AD → C}. What is the highest normal form this table is currently in?
A. Boyce-Codd Normal Form B. Second Normal Form C. Third Normal Form D. None of the above