Decomposition Using Functional Dependencies MCQ

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

• State true or false: The fourth normal form does not exist and it is instead called as the BCNF.
  ক

  True

  খ

  False
• State true or false: A functional dependency must first satisfy the second normal form to satisfy the third normal form.
  ক

  True

  খ

  False
• F+ is called as the ________ of F
  ক

  Closure

  খ

  Sum

  গ

  Cartesian product

  ঘ

  None of the mentioned
• Which of the following is not a condition for the third normal form in the case of XY?
  ক

  X→ Y is trivial

  খ

  X is the superkey for R

  গ

  Each attribute in Y-X is a candidate key for R

  ঘ

  Each attribute in X-Y is a candidate key for R
• Which of the following is used to express database consistency?
  ক

  Primary keys

  খ

  Functional dependencies

  গ

  Check clause

  ঘ

  All of the mentioned
• Which of the following is not a condition for X→ Y in Boyce codd normal form?
  ক

  X → Y is trivial

  খ

  X is the superkey for the relational schema R

  গ

  Y is the superkey for the relational schema R

  ঘ

  All of the mentioned
• X→ Y is trivial if?
  ক

  X ⊂ Y

  খ

  Y ⊂ X

  গ

  X ⊇ Y

  ঘ

  None of the mentioned
• X → Y holds on a schema k(K) if?
  ক

  At least one legal instance satisfies the functional dependency

  খ

  No legal instance satisfies the functional dependency

  গ

  Each and every legal instance satisfies the functional dependency

  ঘ

  None of the mentioned
• If K → R then K is said to be the _______ of R
  ক

  Candidate key

  খ

  Foreign key

  গ

  Super key

  ঘ

  Domain
• An instance of a relation that satisfies all real world constraints is known as?
  ক

  Proper relation

  খ

  Ideal relation

  গ

  Perfect relation

  ঘ

  Legal relation