Multiple Choice
Identify the
letter of the choice that best completes the statement or answers the question.
|
|
|
1.
|
Normalization works through a series of stages called normal forms. There are
__________ stages.
|
|
|
2.
|
Normalization stages are
a. | 1NF. | b. | 2NF. | c. | 3NF. | d. | all of the above. | e. | none of the
above. | | |
|
|
|
3.
|
Some
very specialized applications may require normalization beyond the
a. | 1NF. | b. | 2NF. | c. | 3NF. | d. | 4NF. | e. | 5NF. | | |
|
|
|
4.
|
A
table that displays data redundancies yields the following anomalies:
a. | update
anomalies | b. | insertion anomalies | c. | deletion
anomalies | d. | all of the above | e. | none of the
above | | |
|
|
|
5.
|
The
term first normal form (1NF) describes the tabular format in which:
a. | all the key
attributes are defined. | b. | there are no repeating groups in the table. Row/column
intersection can contain one and only one value, not a set of values. | c. | all attributes
are dependent on the primary key. | d. | all of the above | e. | none of the
above | | |
|
|
|
6.
|
A
table is in the Fourth Normal Form (4NF) if
a. | All attributes
must be dependent on the primary key, and must be dependent on each other. | b. | All attributes
must be dependent on the primary key, but must be independent of each
other. | c. | No row can contain two or more multivalued facts about an
entity | d. | A and C | e. | B and
C | | |
|
|
|
7.
|
The
conflicts between design efficiency, information requirements, and processing speed are often
resolved through
a. | conversion from 1NF to 2NF. | b. | conversion from
2NF to 3NF. | c. | compromises that include
normalization. | d. | conversion from 3NF to 4NF. | | |
|
|
|
8.
|
A
table that has all key attributes defined, has no repeating groups. and all its attributes are
dependent on the primary key, is said to be in
a. | 1NF. | b. | 2NF. | c. | 3NF. | d. | 4NF. | e. | BCNF. | | |
|
|
|
9.
|
A
table that is in 1NF and includes no partial dependencies only is said to be in
a. | 1NF. | b. | 2NF. | c. | 3NF. | d. | 4NF. | e. | BCNF. | | |
|
|
|
10.
|
A
table that is in 2NF and contains no transitive dependencies is said to be in
a. | 1NF. | b. | 2NF. | c. | 3NF. | d. | 4NF. | e. | BCNF. | | |
|
|
|
11.
|
A
table where all attributes are dependent on the primary key and are independent of each other, and no
row contains two or more multivalued facts about an entity, is said to be in
a. | 1NF. | b. | 2NF. | c. | 3NF. | d. | 4NF. | e. | BCNF. | | |
|
|
|
12.
|
A
table where every determinant is a candidate key is said to be in
a. | 1NF. | b. | 2NF. | c. | 3NF. | d. | 4NF. | e. | BCNF. | | |
|