1.

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 algorithmI got this question by my school principal while I was bunking the class.I'd like to ask this question from Algorithms for Decomposition topic in division Normalization of Database Management

Answer»

Right answer is (C) 3NF synthesis algorithm

The BEST I can explain: 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.



Discussion

No Comment Found

Related InterviewSolutions