The Relational Model And Normalization MCQ

Test your knowledge with important The Relational Model And Normalization MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more The Relational Model And Normalization MCQs at Bissoy

• A primary key is a composite key that was selected to be the main identifier for the relation.
  ক

  True

  খ

  False
• In a relation, the rows are sometimes called "fields".
  ক

  True

  খ

  False
• A relation has cells that hold multi-value entries.
  ক

  True

  খ

  False
• A functional dependency is always an equation.
  ক

  True

  খ

  False
• A relation is in Boyce-Codd Normal Form (BCNF) if every determinant is a composite key.
  ক

  True

  খ

  False
• Relations are categorized into normal forms according to the referential integrity constraints that they have.
  ক

  True

  খ

  False
• Given the functional dependency R → S , R is called the determinant.
  ক

  True

  খ

  False
• Keys made up of two or more attributes are called composite keys.
  ক

  True

  খ

  False
• A key is a group of one or more attributes that uniquely identifies a row.
  ক

  True

  খ

  False
• A functional dependency is a relationship between or among attributes.
  ক

  True

  খ

  False
• In a relation, the order of the columns does not matter.
  ক

  True

  খ

  False
• In a relation, the columns are sometimes called "attributes".
  ক

  True

  খ

  False
• The functional dependency R → S means that the value of S can be determined when we are given a value of R.
  ক

  True

  খ

  False
• A relation is in 5NF when multivalued dependencies are isolated in their own relation.
  ক

  True

  খ

  False
• The only reason for the existence of relations is to store instances of functional dependencies.
  ক

  True

  খ

  False
• A candidate key is a determinant that determines all the other columns is a relation.
  ক

  True

  খ

  False
• Given the functional dependency R → (S,T) , then it is also true that R → S.
  ক

  True

  খ

  False
• Any table that meets the definition of a relation is said to be in first normal form.
  ক

  True

  খ

  False
• A relation is a two-dimensional table.
  ক

  True

  খ

  False
• In a relation, the rows are sometimes called "records".
  ক

  True

  খ

  False
• In a relation, the order of the rows matters.
  ক

  True

  খ

  False
• One solution to the multivalued dependency constraint problem is to:
  ক

  split the relation into two relations, each with a single theme.

  খ

  change the theme.

  গ

  create a new theme.

  ঘ

  add a composite key.
• If attribute A determines both attributes B and C, then it is also true that:
  ক

  A → B.

  খ

  B → A.

  গ

  C → A.

  ঘ

  (B,C) → A.
• A tuple is a(n):
  ক

  column of a table.

  খ

  two dimensional table.

  গ

  row of a table.

  ঘ

  key of a table.
• If attributes A and B determine attribute C, then it is also true that:
  ক

  A → C.

  খ

  B → C.

  গ

  (A,B) is a composite determinant.

  ঘ

  C is a determinant.
• A relation in this form is free of all modification anomalies.
  ক

  First normal form

  খ

  Second normal form

  গ

  Third normal form

  ঘ

  Domain/key normal form
• An attribute is a(n):
  ক

  column of a table.

  খ

  two dimensional table.

  গ

  row of a table.

  ঘ

  key of a table.
• A key:
  ক

  must always be composed of two or more columns.

  খ

  can only be one column.

  গ

  identifies a row.

  ঘ

  identifies a column.
• For some relations, changing the data can have undesirable consequences called:
  ক

  referential integrity constraints.

  খ

  modification anomalies.

  গ

  normal forms.

  ঘ

  transitive dependencies.
• Table is synonymous with the term:
  ক

  record.

  খ

  relation.

  গ

  column.

  ঘ

  field.