Explanation: Here course id is not a superkey. Thus, class is not in BCNF. 5. The algorithm that takes a set of dependencies and adds one schema at a time, instead of decomposing the initial schema repeatedly is
A. BCNF algorithm
B. 2NF algorithm
C. 3NF synthesis algorithm
D. 1NF algorithm
Answer:A
Explanation: Here course id is not a superkey. Thus, class is not in BCNF. 5. The algorithm that takes a set of dependencies and adds one schema at a time, instead of decomposing the initial schema repeatedly is
A. BCNF algorithm B. 2NF algorithm C. 3NF synthesis algorithm D. 1NF algorithm
Explanation: The result is not uniquely defined, since a set of functional dependencies can have more than one canonical cover, and, further, in some cases, the result of the algorithm depends on the order in which it considers the dependencies in Fc . 6. The functional dependency can be tested easily on the materialized view, using the constraints ____________.