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. A → B.
B. A → C.
C. A → (B,C).
D. (B,C) → A.
Select an option to see the answer and solution.
The different classes of relations created by the technique for preventing modification anomalies are called:
A. normal forms.
B. referential integrity constraints.
C. functional dependencies.
D. None of the above is correct.
Select an option to see the answer and solution.
A relation is in this form if it is in BCNF and has no multivalued dependencies:
A. second normal form.
B. third normal form.
C. fourth normal form.
D. domain/key normal form.
Select an option to see the answer and solution.
Row is synonymous with the term:
A. record.
B. relation.
C. column.
D. field.
Select an option to see the answer and solution.
The primary key is selected from the:
A. composite keys.
B. determinants.
C. candidate keys.
D. foreign keys.
Select an option to see the answer and solution.
Which of the following is a group of one or more attributes that uniquely identifies a row?
A. Key
B. Determinant
C. Tuple
D. Relation
Select an option to see the answer and solution.
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):
A. transitive dependency.
B. insertion anomaly.
C. referential integrity constraint.
D. normal form.
Select an option to see the answer and solution.
A relation is considered a:
A. Column.
B. one-dimensional table.
C. two-dimensional table.
D. three-dimensional table.
Select an option to see the answer and solution.
In the relational model, relationships between relations or tables are created by using:
A. composite keys.
B. determinants.
C. candidate keys.
D. foreign keys.
Select an option to see the answer and solution.
A functional dependency is a relationship between or among:
A. tables.
B. rows.
C. relations.
D. attributes.
Select an option to see the answer and solution.
Table is synonymous with the term:
A. record.
B. relation.
C. column.
D. field.
Select an option to see the answer and solution.
Which of the following is not a restriction for a table to be a relation?
A. The cells of the table must contain a single value.
B. All of the entries in any column must be of the same kind.
C. The columns must be ordered.
D. No two rows in a table may be identical.
Select an option to see the answer and solution.
For some relations, changing the data can have undesirable consequences called:
A. referential integrity constraints.
B. modification anomalies.
C. normal forms.
D. transitive dependencies.
Select an option to see the answer and solution.
A key:
A. must always be composed of two or more columns.
B. can only be one column.
C. identifies a row.
D. identifies a column.
Select an option to see the answer and solution.
An attribute is a(n):
A. column of a table.
B. two dimensional table.
C. row of a table.
D. key of a table.
Select an option to see the answer and solution.
A relation in this form is free of all modification anomalies.
A. First normal form
B. Second normal form
C. Third normal form
D. Domain/key normal form
Select an option to see the answer and solution.
If attributes A and B determine attribute C, then it is also true that:
A. A → C.
B. B → C.
C. (A,B) is a composite determinant.
D. C is a determinant.
Select an option to see the answer and solution.
A tuple is a(n):
A. column of a table.
B. two dimensional table.
C. row of a table.
D. key of a table.
Select an option to see the answer and solution.
If attribute A determines both attributes B and C, then it is also true that:
A. A → B.
B. B → A.
C. C → A.
D. (B,C) → A.
Select an option to see the answer and solution.
One solution to the multivalued dependency constraint problem is to:
A. split the relation into two relations, each with a single theme.
B. change the theme.
C. create a new theme.
D. add a composite key.
Select an option to see the answer and solution.