In: Computer Science
Ques: (i) Given an instance of a relation R where A and B are two of the attributes in R, describe an algorithm that checks whether a functional dependency A → B holds on R.
(ii) Given a relation with schema R(A, B, C, D, E) and a set of FD's F = {AD → E, AB → C, C → D, E → B} Find a lossless join decomposition to decompose R into collections of relations that are in BCNF