Q.1

A relation in this form is free of all modification anomalies.

  • First normal form
  • Second normal form
  • Third normal form
  • Domain/key normal form
Q.2

Table is synonymous with the term:

  • record.
  • relation.
  • column.
  • field.
Q.3

Every time attribute A appears, it is matched with the same value of attribute B, but not the same value of attribute C. Therefore, it is true that:

  • A → B.
  • A → C.
  • A → (B,C).
  • (B,C) → A.
Q.4

When the values in one or more attributes being used as a foreign key must exist in another set of one or more attributes in another table, we have created a(n):

  • transitive dependency.
  • insertion anomaly.
  • referential integrity constraint.
  • normal form.
Q.5

A relation is considered a:

  • Column.
  • one-dimensional table.
  • two-dimensional table.
  • three-dimensional table.
Q.6

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.
Q.7

Which of the following is not a restriction for a table to be a relation?

  • The cells of the table must contain a single value.
  • All of the entries in any column must be of the same kind.
  • The columns must be ordered.
  • No two rows in a table may be identical.
Q.8

The different classes of relations created by the technique for preventing modification anomalies are called:

  • normal forms.
  • referential integrity constraints.
  • functional dependencies.
  • None of the above is correct.
Q.9

In the relational model, relationships between relations or tables are created by using:

  • composite keys.
  • determinants.
  • candidate keys.
  • foreign keys.
Q.10

A functional dependency is a relationship between or among:

  • tables.
  • rows.
  • relations.
  • attributes.
Q.11

A tuple is a(n):

  • column of a table.
  • two dimensional table.
  • row of a table.
  • key of a table.
Q.12

If attribute A determines both attributes B and C, then it is also true that:

  • A → B.
  • B → A.
  • C → A.
  • (B,C) → A.
Q.13

For some relations, changing the data can have undesirable consequences called:

  • referential integrity constraints.
  • modification anomalies.
  • normal forms.
  • transitive dependencies.
Q.14

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

  • True
  • False
Q.15

A relation is in this form if it is in BCNF and has no multivalued dependencies:

  • second normal form.
  • third normal form.
  • fourth normal form.
  • domain/key normal form.
Q.16

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

  • True
  • False
Q.17

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

  • True
  • False
Q.18

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

  • True
  • False
Q.19

In a relation, the order of the rows matters.

  • True
  • False
Q.20

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.
0 h : 0 m : 1 s