Unlock document.
This document is partially blurred.
Unlock all pages and 1 million more documents.
Get Access
CHAPTER 6: NORMALIZATION OF DATABASE TABLES
1. Normalization works through a series of stages called normal forms.
a. True
b. False
2. Normalization produces a lower normal form.
a. True
b. False
3. Normalization is a process that is used for changing attributes to entities.
a. True
b. False
4. In order to meet performance requirements, portions of the database design may need to be occasionally
denormalized.
a. True
b. False
5. Denormalization produces a lower normal form.
a. True
b. False
6. Normalization is a very important database design ingredient, and the highest level is always the most
desirable.
a. True
b. False
application programming.
a. True
b. False
Chapter 6: Normalization of Database Tables
8. Data redundancy produces data anomalies.
a. True
b. False
9. A table is in BCNF if every determinant in the table is a candidate key.
a. True
b. False
10. A table is in BCNF if every determinant in the table is a foreign key.
a. True
b. False
11. A dependency based on only a part of a composite primary key is known as a partial dependency.
a. True
b. False
12. A table is in fourth normal form if it is in third normal form and has no independent multivalued
dependencies.
a. True
b. False
13. Relational models view data as part of a table or collection of tables in which all key values must be
identified.
a. True
b. False
14. The objective of normalization is to ensure that each table conforms to the concept of well-formed relations.
a. True
b. False
15. Repeating groups must be eliminated by ensuring that each row defines a single entity.
a. True
b. False
Chapter 6: Normalization of Database Tables
16. Dependency diagrams are very helpful in getting a bird’s-eye view of all the relationships among a table’s
attributes.
a. True
b. False
17. Dependencies that are based on only a part of a composite primary key are called transitive dependencies.
a. True
b. False
18. All relational tables satisfy the 1NF requirements.
a. True
b. False
19. In the context of partial dependencies, data redundancies occur because every row entry requires duplication
of data.
a. True
b. False
20. Converting a database format from 1NF to 2NF is a complex process.
a. True
b. False
21. 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.
a. True
b. False
22. A table is in 2NF if it is in 1NF, and it includes no partial dependencies.
a. True
b. False
23. 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.
a. True
b. False
Chapter 6: Normalization of Database Tables
24. A determinant is any attribute whose value determines other values within a column.
a. True
b. False
25. A dependency of one nonprime attribute on another nonprime attribute is a partial dependency.
a. True
b. False
26. Data stored at their highest level of granularity are said to be atomic data.
a. True
b. False
27. Atomic attributes are attributes that can be further subdivided.
a. True
b. False
28. Normalization should be part of the design process.
a. True
b. False
29. Normalization represents a micro view of the entities within the ERD.
a. True
b. False
30. The combination of normalization and ER modeling yields a useful ERD, whose entities can be translated into
appropriate relationship structures.
a. True
b. False
31. A good relational DBMS excels at managing denormalized relations.
a. True
b. False
Chapter 6: Normalization of Database Tables
32. The advantage of higher processing speed must be carefully weighed against the disadvantage of data
anomalies.
a. True
b. False
33. Normalization purity is often easy to sustain in the modern database environment.
a. True
b. False
34. Unnormalized database tables often lead to various data redundancy disasters in production databases.
a. True
b. False
a. True
b. False
36. 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
37. From a structural point of view, 3NF is better than .
a. 4NF b. 2NF
c. 5NF d. 6NF
38. 1NF, 2NF, and 3NF are .
a. normalization stages b. anomalies
c. repeating groups d. atomic attributes
39. From a structural point of view, 2NF is better than .
a. 1NF b. 3NF
c. 4NF d. BCNF
Chapter 6: Normalization of Database Tables
40. yields better performance.
a. Denormalization b. Normalization
c. Atomization d. Compression
41. An attribute that is part of a key is known as a(n) attribute.
a. important b. nonprime
c. prime d. entity
42. A table that displays data redundancies yields .
a. consistencies b. anomalies
c. fewer attributes d. more entities
43. Data redundancy produces .
a. slower lookups b. robust design
c. efficient storage use d. data integrity problems
44. Some very specialized applications may require normalization beyond the .
a. 1NF b. 2NF
c. 3NF d. 4NF
45. Of the following normal forms, is mostly of theoretical interest.
a. 1NF b. 3NF
c. BCNF d. DKNF
46. 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
47. 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
Chapter 6: Normalization of Database Tables
48. 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
49. A relational table must not contain a(n) .
a. entity b. attribute
c. relationship d. repeating group
50. Dependencies based on only a part of a composite primary key are known as dependencies.
a. primary b. partial
c. incomplete d. composite
51. In a(n) diagram, the arrows above the attributes indicate all desirable dependencies.
a. Chen b. dependency
c. functionality d. ER
52. 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
53. A table that is in 1NF and includes no partial dependencies is said to be in .
a. BCNF b. 2NF
c. 3NF d. 4NF
54. If you have three different transitive dependencies, different determinant(s) exist.
a. one b. two
c. three d. four
55. Before converting a table into 3NF, it is imperative that the table already be in .
a. 1NF b. 2NF
c. 4NF d. BCNF
Chapter 6: Normalization of Database Tables
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
57. 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
58. A table that is in 2NF and contains no transitive dependencies is said to be in .
a. 1NF b. 2NF
c. 3NF d. 4NF
59. Improving leads to more flexible queries.
a. atomicity b. normalization
c. denormalization d. derived attribute
60. 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
61. The most likely data type for a surrogate key is .
a. character b. date
c. logical d. numeric
62. Granularity refers to .
a. the size of a table b. the level of detail represented by the values in a
table’s row
c. the number of attributes represented in a table d. the number of rows in a table
63. 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
Chapter 6: Normalization of Database Tables
64. In a real-world environment, we must strike a balance between design integrity and .
a. robustness b. flexibility
c. uniqueness d. ease of use
65. For most business transactional databases, we should normalize relations into .
a. 1NF b. 2NF
c. 3NF d. 6NF
a. character b. sequence
c. AutoNumber d. identity
67. A table where every determinant is a candidate key is said to be in .
a. BCNF b. 2NF
c. 1NF d. 4NF
68. 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
69. BCNF can be violated only if the table contains more than one key.
a. primary b. candidate
c. foreign d. secondary
70. 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
71. Most designers consider the BCNF as a special case of the .
a. 1NF b. 2NF
c. 3NF d. 4NF
Chapter 6: Normalization of Database Tables
72. 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
73. 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
74. 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
75. Normalization represents a micro view of the within the ERD.
a. entities b. attributes
c. relationships d. forms
76. 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
77. 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
78. Data warehouse routinely uses structures in its complex, multilevel, multisource data environment.
a. 1NF b. 2NF
c. 3NF d. 4NF
Chapter 6: Normalization of Database Tables
79. 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
80. 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.
81. The price paid for increased performance through denormalization is a larger amount of .
82. In order to meet requirements, you may have to denormalize some portions of a database design.
83. is a process to help reduce the likelihood of data anomalies.
84. Any attribute that is at least part of a key is known as a .
85. When designing a new database structure based on the business requirements of the end users, the database
designer will construct a data model using a technique such as .
86. A dependency based on only a part of a composite primary key is called a .
87. Dependencies can be identified with the help of a dependency .
88. The problem with transitive dependencies is that they still yield data .
89. The is central to a discussion of normalization.
Chapter 6: Normalization of Database Tables
90. All relational tables satisfy the requirements.
91. Data redundancies occur from of data on every row entry.
92. Because a partial dependency can exist only when a table’s primary key is composed of several attributes, a
table whose key consists of only a single attribute is automatically in 2NF once it is in 1NF.
93. Any attribute whose value determines other values within a row is known as a .
94. An attribute that cannot be further subdivided is said to display .
95. refers to the level of detail represented by the values stored in a table’s row.
96. In a real-world environment, changing granularity requirements might dictate changes in primary key
selection, and those changes might ultimately require the use of keys.
97. It becomes difficult to create a suitable key when the related table uses a composite primary key.
98. When a nonkey attribute is the determinant of a key attribute, the table is in 3NF but not in .
99. In the , no row may contain two or more multivalued facts about an entity.
Chapter 6: Normalization of Database Tables
100. The provides the big picture, or macro view, of an organization’s data requirements and operations.
101. The combination of and ER modeling yields a useful ERD, whose entities may now be translated into
appropriate table structures.
102. An ERD is created through an process.
103. Unnormalized tables yield no simple strategies for creating virtual tables known as .
104. According to the data-modeling checklist, should be nouns that are familiar to business, should be short
and meaningful, and should document abbreviations, synonyms, and aliases for each entity.
105. Explain normalization and its different forms.
106. What characteristics do tables that conform to the concept of well-informed relations have?
Chapter 6: Normalization of Database Tables
107. Describe a dependency diagram and explain its purpose.
108. What steps are involved in the conversion to third normal form?
109. Explain the Boyce-Codd normal form (BCNF). How is it related to other normal forms?
110. Explain how database designers design and normalize databases.
