The algorithm that takes a set of dependencies and adds one schema at – McqOptions

MCQOPTIONS

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 algorithm
Answer» D. 1nf algorithm

Discussion

No Comment Found

Related MCQs

In an Entity-Relationship Diagram “Diamonds” represents
In an Entity-Relationship Diagram “Ellipses” represents
Relation dept year(dept name, total inst 2007, total inst 2008, total inst 2009). Here theonly functional dependencies are from dept name to the other attributes. This relation is in
is a special type of integrity constraint that relates two relations & maintains consistency across the relations.
A functional dependency is a relationship between
If the complete execution of the transaction(s) takes the database from one consistentstate to the other then that property of transaction is called:
Problems occurs if we don’t implement a proper locking strategy
DFD stands for
We use name PL/SQL program objects and units.
Insertion of a large number of entries at a time into an index is referred to as__________ of the index.