Algorithms for Decomposition MCQ

Test your knowledge with important Algorithms for Decomposition MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Algorithms for Decomposition MCQs at Bissoy

• 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
  ক

  Zero

  খ

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

  গ

  Proportional to the size of F+

  ঘ

  Indeterminate
• Which normal form is considered adequate for normal relational database design?
  ক

  2NF

  খ

  5NF

  গ

  4NF

  ঘ

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

  Primary key

  খ

  Null

  গ

  Unique

  ঘ

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

  BCNF algorithm

  খ

  2NF algorithm

  গ

  3NF synthesis algorithm

  ঘ

  1NF algorithm
• R (A,B,C,D) is a relation. Which of the following does not have a lossless join dependency preserving BCNF decomposition?
  ক

  A->B, B->CD

  খ

  A->B, B->C, C->D

  গ

  AB->C, C->AD

  ঘ

  A->BCD
• What are the desirable properties of a decomposition
  ক

  Partition constraint

  খ

  Dependency preservation

  গ

  Redundancy

  ঘ

  Security
• A relation is in ____________ if an attribute of a composite key is dependent on an attribute of other composite key.
  ক

  2NF

  খ

  3NF

  গ

  BCNF

  ঘ

  1NF