Sail E0 Webinar

MCQs

Total Questions : 65 | Page 2 of 7 pages
Question 11. Table is synonymous with the term:
  1.    record.
  2.    relation.
  3.    column.
  4.    field.
 Discuss Question
Answer: Option B. -> relation.
Question 12. Which of the following is not a restriction for a table to be a relation?
  1.    The cells of the table must contain a single value.
  2.    All of the entries in any column must be of the same kind.
  3.    The columns must be ordered.
  4.    No two rows in a table may be identical.
 Discuss Question
Answer: Option C. -> The columns must be ordered.
Question 13. For some relations, changing the data can have undesirable consequences called:
  1.    referential integrity constraints.
  2.    modification anomalies.
  3.    normal forms.
  4.    transitive dependencies.
 Discuss Question
Answer: Option B. -> modification anomalies.
Question 14. A key:
  1.    must always be composed of two or more columns.
  2.    can only be one column.
  3.    identifies a row.
  4.    identifies a column.
 Discuss Question
Answer: Option C. -> identifies a row.
Question 15. An attribute is a(n):
  1.    column of a table.
  2.    two dimensional table.
  3.    row of a table.
  4.    key of a table.
 Discuss Question
Answer: Option A. -> column of a table.
Question 16. A relation in this form is free of all modification anomalies.
  1.    First normal form
  2.    Second normal form
  3.    Third normal form
  4.    Domain/key normal form
 Discuss Question
Answer: Option D. -> Domain/key normal form
Question 17. If attributes A and B determine attribute C, then it is also true that:
  1.    A → C.
  2.    B → C.
  3.    (A,B) is a composite determinant.
  4.    C is a determinant.
 Discuss Question
Answer: Option C. -> (A,B) is a composite determinant.
Question 18. A tuple is a(n):
  1.    column of a table.
  2.    two dimensional table.
  3.    row of a table.
  4.    key of a table.
 Discuss Question
Answer: Option C. -> row of a table.
Question 19. If attribute A determines both attributes B and C, then it is also true that:
  1.    A → B.
  2.    B → A.
  3.    C → A.
  4.    (B,C) → A.
 Discuss Question
Answer: Option A. -> A → B.
Question 20. One solution to the multivalued dependency constraint problem is to:
  1.    split the relation into two relations, each with a single theme.
  2.    change the theme.
  3.    create a new theme.
  4.    add a composite key.
 Discuss Question
Answer: Option A. -> split the relation into two relations, each with a single theme.

Latest Videos

Latest Test Papers