Topic 5 Flashcards
From a structural point of view, 3NF is better than _____
a. 2NF
b. 3NF
c. 5NF
d. 6NF
2NF
Normalization works through a series of stages called normal forms. For most purposes in business database design, _____ stages are as high as you need to go in the normalization process
a. two
b. three
c. four
d. five
three
From a structural point of view, 2NF is better than _____
a. 1NF
b. 3NF
c. 4NF
d. BCNF
1NF
An attribute that is part of a key is known as a (n) _____ attribute
a. important
b. nonprime
c. prime
d. entity
prime
Attribute A _____ attribute B if all of the rows in the table that agree in value for attribute A also agree in value for attribute B
a. determines
b. derives from
c. controls
d. owns
determines
Some very specialized applications may require normalization beyond the _____
a. 1NF
b. 2NF
c. 3NF
d. 4NF
4NF
Of the following normal forms, _____ is mostly of theoretical interest
a. 1NF
b. 3NF
c. BCNF
d. DKNF
DKNF
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
1NF
A (n) _____ exists when there are functional dependencies such that Y is functionally dependent on X, Z is functionally dependent on Y, and X is the primary key
a. partial dependency
b. repeating group
c. atomic attribute
d. transitive dependency
transitive dependency
A _____ derives its name from the fact that a collection of multiple entries of the same type can exist for any single key attribute occurrence
a. partial dependency
b. transitive dependency
c. repeating group
d. primary key
repeating group
A relational table must not contain a (n) _____
a. entity
b. attribute
c. relationship
d. repeating group
repeating group
In a (n) _____ diagram, the arrows above the attributes indicate all desirable dependencies
a. Chen
b. dependency
c. functionality
d. ER
dependency
Dependencies based on only a part of a composite primary key are known as _____ dependencies
a. primary
b. partial
c. incomplete
d. composite
partial
If a table has multiple candidate keys and one of those candidate keys is a composite key, the table can have _____ based on this composite candidate key even when the primary key chosen is a single attribute
a. Boyce-Codd normal forms
b. redundancies
c. time-variances
d. partial dependencies
partial dependencies
A table that is in 2NF and contains no transitive dependencies is said to be in _____
a. 1NF
b. 2NF
c. 3NF
d. 4NF
3NF