Algorithms for Decomposition - DBMS

1.

The functional dependency can be tested easily on the materialized view, using the constraints ____________.

   A.) Primary key
   B.) Null
   C.) Unique
   D.) Both b and c

Answer: Option 'D'

Both b and c

2.

What are the desirable properties of a decomposition

   A.) Partition constraint
   B.) Dependency preservation
   C.) Redundancy
   D.) Security

Answer: Option 'B'

Dependency preservation

3.

The algorithm that takes a set of dependencies and adds one schema at a time, instead of decomposing the initial schema repeatedly is

   A.) 1NF algorithm
   B.) 2NF algorithm
   C.) 3NF synthesis algorithm
   D.) BCNF algorithm

Answer: Option 'C'

3NF synthesis algorithm

4.

A table has fields F1, F2, F3, F4, and F5, with the following functional dependencies:
F1->F3
F2->F4
(F1,F2)->F5
in terms of normalization, this table is in

   A.) 1NF
   B.) 2NF
   C.) 3NF
   D.) None of the mentioned

Answer: Option 'A'

1NF

5.

Relation R with an associated set of functional dependencies, F, is decomposed into BCNF. The redundancy (arising out of functional dependencies) in the resulting set of relations is

   A.) Zero
   B.) More than zero but less than that of an equivalent 3NF decomposition
   C.) Proportional to the size of F+
   D.) Indeterminate

Answer: Option 'B'

More than zero but less than that of an equivalent 3NF decomposition

Algorithms for Decomposition Download Pdf