Deck 6: Normalization of Database Tables
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Question
Unlock Deck
Sign up to unlock the cards in this deck!
Unlock Deck
Unlock Deck
1/110
Play
Full screen (f)
Deck 6: Normalization of Database Tables
1
Normalization works through a series of stages called normal forms.
True
2
Converting a database format from 1NF to 2NF is a complex process.
False
3
Normalization is a process that is used for changing attributes to entities.
False
4
Data redundancy produces data anomalies.
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
5
Dependencies that are based on only a part of a composite primary key are called transitive dependencies.
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
6
In the context of partial dependencies, data redundancies occur because every row entry requires duplication of data.
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
7
In order to meet performance requirements, portions of the database design may need to be occasionally denormalized.
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
8
A table is in fourth normal form if it is in third normal form and has no independent multivalued dependencies.
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
9
Repeating groups must be eliminated by ensuring that each row defines a single entity.
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
10
A table is in BCNF if every determinant in the table is a candidate key.
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
11
Dependency diagrams are very helpful in getting a bird's-eye view of all the relationships among a table's attributes.
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
12
The objective of normalization is to ensure that each table conforms to the concept of well-formed relations.
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
13
Denormalization produces a lower normal form.
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
14
A table is in BCNF if every determinant in the table is a foreign key.
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
15
A dependency based on only a part of a composite primary key is known as a partial dependency.
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
16
Normalization is a very important database design ingredient, and the highest level is always the most desirable.
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
17
Reporting anomalies in a table can cause a multitude of problems for managers and can be fixed through application programming.
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
18
Relational models view data as part of a table or collection of tables in which all key values must be identified.
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
19
Normalization produces a lower normal form.
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
20
All relational tables satisfy the 1NF requirements.
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
21
The advantage of higher processing speed must be carefully weighed against the disadvantage of data anomalies.
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
22
Normalization represents a micro view of the entities within the ERD.
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
23
A determinant is any attribute whose value determines other values within a column.
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
24
It is possible for a table in 2NF to exhibit transitive dependency, where the primary key may rely on one or more nonprime attributes to functionally determine other nonprime attributes.
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
25
Atomic attributes are attributes that can be further subdivided.
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
26
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
A) two
B) three
C) four
D) five
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
27
From a structural point of view, 3NF is better than .
A) 4NF
B) 2NF
C) 5NF
D) 6NF
A) 4NF
B) 2NF
C) 5NF
D) 6NF
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
28
Since a partial dependency can exist only if a table's primary key is composed of several attributes, if a table in 1NF has a single-attribute primary key, then the table is automatically in 2NF.
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
29
Data stored at their highest level of granularity are said to be atomic data.
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
30
A dependency of one nonprime attribute on another nonprime attribute is a partial dependency.
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
31
A table is in 2NF if it is in 1NF, and it includes no partial dependencies.
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
32
Attributes should clearly define participation, connectivity, and document cardinality.
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
33
1NF, 2NF, and 3NF are .
A) normalization stages
B) anomalies
C) repeating groups
D) atomic attributes
A) normalization stages
B) anomalies
C) repeating groups
D) atomic attributes
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
34
yields better performance.
A) Denormalization
B) Normalization
C) Atomization
D) Compression
A) Denormalization
B) Normalization
C) Atomization
D) Compression
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
35
A good relational DBMS excels at managing denormalized relations.
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
36
Normalization purity is often easy to sustain in the modern database environment.
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
37
From a structural point of view, 2NF is better than .
A) 1NF
B) 3NF
C) 4NF
D) BCNF
A) 1NF
B) 3NF
C) 4NF
D) BCNF
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
38
The combination of normalization and ER modeling yields a useful ERD, whose entities can be translated into appropriate relationship structures.
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
39
Normalization should be part of the design process.
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
40
Unnormalized database tables often lead to various data redundancy disasters in production databases.
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
41
Some very specialized applications may require normalization beyond the .
A) 1NF
B) 2NF
C) 3NF
D) 4NF
A) 1NF
B) 2NF
C) 3NF
D) 4NF
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
42
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
A) partial dependency
B) repeating group
C) atomic attribute
D) transitive dependency
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
43
Before converting a table into 3NF, it is imperative that the table already be in .
A) 1NF
B) 2NF
C) 4NF
D) BCNF
A) 1NF
B) 2NF
C) 4NF
D) BCNF
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
44
An attribute that is part of a key is known as a(n) attribute.
A) important
B) nonprime
C) prime
D) entity
A) important
B) nonprime
C) prime
D) entity
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
45
Improving leads to more flexible queries.
A) atomicity
B) normalization
C) denormalization
D) derived attribute
A) atomicity
B) normalization
C) denormalization
D) derived attribute
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
46
A table that is in 1NF and includes no partial dependencies is said to be in .
A) BCNF
B) 2NF
C) 3NF
D) 4NF
A) BCNF
B) 2NF
C) 3NF
D) 4NF
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
47
Dependencies based on only a part of a composite primary key are known as dependencies.
A) primary
B) partial
C) incomplete
D) composite
A) primary
B) partial
C) incomplete
D) composite
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
48
Data redundancy produces .
A) slower lookups
B) robust design
C) efficient storage use
D) data integrity problems
A) slower lookups
B) robust design
C) efficient storage use
D) data integrity problems
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
49
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
A) 1NF
B) 2NF
C) 3NF
D) 4NF
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
50
A table that displays data redundancies yields .
A) consistencies
B) anomalies
C) fewer attributes
D) more entities
A) consistencies
B) anomalies
C) fewer attributes
D) more entities
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
51
A relational table must not contain a(n) .
A) entity
B) attribute
C) relationship
D) repeating group
A) entity
B) attribute
C) relationship
D) repeating group
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
52
In a(n) diagram, the arrows above the attributes indicate all desirable dependencies.
A) Chen
B) dependency
C) functionality
D) ER
A) Chen
B) dependency
C) functionality
D) ER
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
53
Of the following normal forms, is mostly of theoretical interest.
A) 1NF
B) 3NF
C) BCNF
D) DKNF
A) 1NF
B) 3NF
C) BCNF
D) DKNF
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
54
A table that is in 2NF and contains no transitive dependencies is said to be in .
A) 1NF
B) 2NF
C) 3NF
D) 4NF
A) 1NF
B) 2NF
C) 3NF
D) 4NF
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
55
If you have three different transitive dependencies, different determinant(s) exist.
A) one
B) two
C) three
D) four
A) one
B) two
C) three
D) four
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
56
A(n) exists when there are functional dependencies such that XY is functionally dependent on WZ, X is functionally dependent on W, and XY is the primary key.
A) atomic attribute
B) repeating group
C) partial dependency
D) transitive dependency
A) atomic attribute
B) repeating group
C) partial dependency
D) transitive dependency
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
57
An atomic attribute .
A) cannot exist in a relational table
B) cannot be further subdivided
C) displays multiplicity
D) is always chosen to be a foreign key
A) cannot exist in a relational table
B) cannot be further subdivided
C) displays multiplicity
D) is always chosen to be a foreign key
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
58
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
A) Boyce-Codd normal forms
B) redundancies
C) time-variances
D) partial dependencies
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
59
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
A) partial dependency
B) transitive dependency
C) repeating group
D) primary key
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
60
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
A) determines
B) derives from
C) controls
D) owns
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
61
databases reflect the ever-growing demand for greater scope and depth in the data on which decision support systems increasingly rely.
A) Normalized
B) Data warehouse
C) Temporary
D) Report
A) Normalized
B) Data warehouse
C) Temporary
D) Report
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
62
Most designers consider the BCNF as a special case of the .
A) 1NF
B) 2NF
C) 3NF
D) 4NF
A) 1NF
B) 2NF
C) 3NF
D) 4NF
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
63
A table where every determinant is a candidate key is said to be in .
A) BCNF
B) 2NF
C) 1NF
D) 4NF
A) BCNF
B) 2NF
C) 1NF
D) 4NF
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
64
When designing a database, you should .
A) make sure that entities are in normal form before table structures are created
B) create table structures then normalize the database
C) only normalize the database when performance problems occur
D) consider more important issues such as performance before normalizing
A) make sure that entities are in normal form before table structures are created
B) create table structures then normalize the database
C) only normalize the database when performance problems occur
D) consider more important issues such as performance before normalizing
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
65
A table is in 4NF if it is in 3NF, and .
A) all attributes must be dependent on the primary key and must be dependent on each other
B) all attributes are unrelated
C) it has no multivalued dependencies
D) no column contains the same values
A) all attributes must be dependent on the primary key and must be dependent on each other
B) all attributes are unrelated
C) it has no multivalued dependencies
D) no column contains the same values
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
66
From a system functionality point of view, attribute values can be calculated when they are needed to write reports or invoices.
A) derived
B) atomic
C) granular
D) historical
A) derived
B) atomic
C) granular
D) historical
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
67
Normalization represents a micro view of the within the ERD.
A) entities
B) attributes
C) relationships
D) forms
A) entities
B) attributes
C) relationships
D) forms
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
68
BCNF can be violated only if the table contains more than one key.
A) primary
B) candidate
C) foreign
D) secondary
A) primary
B) candidate
C) foreign
D) secondary
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
69
In a real-world environment, we must strike a balance between design integrity and .
A) robustness
B) flexibility
C) uniqueness
D) ease of use
A) robustness
B) flexibility
C) uniqueness
D) ease of use
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
70
An example of denormalization is using a denormalized table to hold report data. This is required when creating a tabular report in which the columns represent data that are stored in the table as rows.
A) transitive
B) 3NF
C) component
D) temporary
A) transitive
B) 3NF
C) component
D) temporary
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
71
Data warehouse routinely uses structures in its complex, multilevel, multisource data environment.
A) 1NF
B) 2NF
C) 3NF
D) 4NF
A) 1NF
B) 2NF
C) 3NF
D) 4NF
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
72
The conflicts between design efficiency, information requirements, and performance are often resolved through_____.
A) compromises that include normalization
B) conversion from 2NF to 3NF
C) compromises that include denormalization
D) conversion from 3NF to 4NF
A) compromises that include normalization
B) conversion from 2NF to 3NF
C) compromises that include denormalization
D) conversion from 3NF to 4NF
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
73
A table where all attributes are dependent on the primary key but 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
A) 1NF
B) 2NF
C) 3NF
D) 4NF
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
74
To generate a surrogate key, Microsoft Access uses a(n) data type.
A) character
B) sequence
C) AutoNumber
D) identity
A) character
B) sequence
C) AutoNumber
D) identity
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
75
For most business transactional databases, we should normalize relations into .
A) 1NF
B) 2NF
C) 3NF
D) 6NF
A) 1NF
B) 2NF
C) 3NF
D) 6NF
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
76
If database tables are treated as though they were files in a file system, the never has a chance to demonstrate its superior data-handling capabilities.
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
77
In a situation, one key determines multiple values of two other attributes and those attributes are independent of each other.
A) multivalued dependency
B) transitive dependency
C) partial dependency
D) functional dependency
A) multivalued dependency
B) transitive dependency
C) partial dependency
D) functional dependency
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
78
When a table contains only one candidate key, are considered to be equivalent.
A) the 1NF and the 2NF
B) the 3NF and the BCNF
C) the 4NF and the 3NF
D) the BCNF and the DKNF
A) the 1NF and the 2NF
B) the 3NF and the BCNF
C) the 4NF and the 3NF
D) the BCNF and the DKNF
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
79
The most likely data type for a surrogate key is .
A) character
B) date
C) logical
D) numeric
A) character
B) date
C) logical
D) numeric
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck
80
Granularity refers to .
A) the size of a table
B) the level of detail represented by the values in a table's row
A) the number of attributes represented in a table
D) the number of rows in a table
A) the size of a table
B) the level of detail represented by the values in a table's row
A) the number of attributes represented in a table
D) the number of rows in a table
Unlock Deck
Unlock for access to all 110 flashcards in this deck.
Unlock Deck
k this deck