Functional-Dependency Theory MCQ

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

• A _________ Fc for F is a set of dependencies such that F logically implies all dependencies in Fc, and Fc logically implies all dependencies in F.
  ক

  Canonical cover

  খ

  Complete cover

  গ

  Canonical dependency

  ঘ

  Canonical clause
• We say that a decomposition having the property F’+ = F+ is a __________ decomposition.
  ক

  Dependency losing

  খ

  Dependency preserving

  গ

  Lossless

  ঘ

  None of the mentioned
• If B is an attribute and A→B, Then B is said to be ________ by a.
  ক

  Logically implied

  খ

  Functionally implied

  গ

  Logically determined

  ঘ

  Functionally determined
• If A→B, A→ C then which of the following is true?
  ক

  A→BC

  খ

  A→B

  গ

  A→C

  ঘ

  All of the mentioned
• State true or false: Functional dependencies are transitive
  ক

  True

  খ

  False
• Armstrong axioms are called sound because?
  ক

  They are expensive

  খ

  They cannot generate correct functional dependencies

  গ

  They allow us to generate the complete closure

  ঘ

  They cannot generate incorrect functional dependencies
• State true or false: Armstrong’s axioms allow us to generate all F+ for any given F
  ক

  True

  খ

  False
• If a functional dependency is reflexive, B is a subset of A and A is the set of attributes, then
  ক

  B→A holds

  খ

  A→B holds

  গ

  AB→C holds

  ঘ

  None of the mentioned
• If F is a set of functional dependencies, then the closure of F is denoted by?
  ক

  F*

  খ

  Fo

  গ

  F+

  ঘ

  F
• A functional dependency f on R is _______ by a set of functional dependencies F on r if every instance of r(R) that satisfies f also satisfies F.
  ক

  Logically Defined

  খ

  Logically Derived

  গ

  Logically implied

  ঘ

  None of the mentioned
• There are two functional dependencies with the same set of attributes on the left side of the arrow: A->BC A->B This can be combined as
  ক

  A->BC

  খ

  A->B

  গ

  B->C

  ঘ

  None of the mentioned
• Which of the following is not Armstrong’s Axiom?
  ক

  Reflexivity rule

  খ

  Transitivity rule

  গ

  Pseudotransitivity rule

  ঘ

  Augmentation rule
• We can use the following three rules to find logically implied functional dependencies. This collection of rules is called
  ক

  Axioms

  খ

  Armstrong’s axioms

  গ

  Armstrong

  ঘ

  Closure