Database Systems Design Implementation And Management 11th Edition by Carlos Coronel - Test Bank

Database Systems Design Implementation And Management 11th Edition by Carlos Coronel – Test Bank

 

Instant Download – Complete Test Bank With Answers

 

 

Sample Questions Are Posted Below

 

CHAPTER 6:  NORMALIZATION OF DATABASE TABLES

 

1. Normalization works through a series of stages called normal forms.
   1. True
   2. False

 

ANSWER:  True

 

2. Normalization produces a lower normal form.
   1. True
   2. False

 

ANSWER:  False

 

3. Normalization is a process that is used for changing attributes to entities.
   1. True
   2. False

 

ANSWER:  False

 

4. In order to meet performance requirements, portions of the database design may need to be occasionally
   1. True
   2. False

 

ANSWER:  True

 

5. Denormalization produces a lower normal form.
   1. True
   2. False

 

ANSWER:  True

 

6. Normalization is a very important database design ingredient, and the highest level is always the most desirable.
   1. True
   2. False

 

ANSWER:  False

 

7. Reporting anomalies in a table can cause a multitude of problems for managers and can be fixed through application
   1. True
   2. False

 

ANSWER:  False

 

 

 

8. Data redundancy produces data anomalies.
   1. True
   2. False

 

ANSWER:  True

 

9. A table is in BCNF if every determinant in the table is a candidate key.
   1. True
   2. False

 

ANSWER:  True

 

10. A table is in BCNF if every determinant in the table is a foreign key.
    1. True
    2. False

 

ANSWER:  False

 

11. A dependency based on only a part of a composite primary key is known as a partial dependency.
    1. True
    2. False

 

ANSWER:  True

 

12. A table is in fourth normal form if it is in third normal form and has no independent multivalued dependencies.
    1. True
    2. False

 

ANSWER:  True

 

13. Relational models view data as part of a table or collection of tables in which all key values must be identified.
    1. True
    2. False

 

ANSWER:  True

 

14. The objective of normalization is to ensure that each table conforms to the concept of well-formed relations.
    1. True
    2. False

 

ANSWER:  True

 

15. Repeating groups must be eliminated by ensuring that each row defines a single entity.
    1. True
    2. False

 

ANSWER:  True

 

 

 

16. Dependency diagrams are very helpful in getting a bird’s­eye view of all the relationships among a table’s attributes.
    1. True
    2. False

 

ANSWER:  True

 

17. Dependencies that are based on only a part of a composite primary key are called transitive dependencies.
    1. True
    2. False

 

ANSWER:  False

 

18. All relational tables satisfy the 1NF requirements.
    1. True
    2. False

 

ANSWER:  True

 

19. In the context of partial dependencies, data redundancies occur because every row entry requires duplication of
    1. True
    2. False

 

ANSWER:  True

 

20. Converting a database format from 1NF to 2NF is a complex process.
    1. True
    2. False

 

ANSWER:  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.
    1. True
    2. False

 

ANSWER:  True

 

22. A table is in 2NF if it is in 1NF, and it includes no partial dependencies.
    1. True
    2. False

 

ANSWER:  True

 

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.
    1. True
    2. False

 

ANSWER:  True

24. A determinant is any attribute whose value determines other values within a column.
    1. True
    2. False

 

ANSWER:  False

 

25. A dependency of one nonprime attribute on another nonprime attribute is a partial dependency.
    1. True
    2. False

 

ANSWER:  False

 

26. Data stored at their highest level of granularity are said to be atomic data.
    1. True
    2. False

 

ANSWER:  False

 

27. Atomic attributes are attributes that can be further subdivided.
    1. True
    2. False

 

ANSWER:  False

 

28. Normalization should be part of the design process.
    1. True
    2. False

 

ANSWER:  True

 

29. Normalization represents a micro view of the entities within the ERD.
    1. True
    2. False

 

ANSWER:  True

 

30. The combination of normalization and ER modeling yields a useful ERD, whose entities can be translated into appropriate relationship structures.
    1. True
    2. False

 

ANSWER:  False

 

31. A good relational DBMS excels at managing denormalized relations.
    1. True
    2. False

 

ANSWER:  False

 

 

 

32. The advantage of higher processing speed must be carefully weighed against the disadvantage of data anomalies.
    1. True
    2. False

 

ANSWER:  True

 

33. Normalization purity is often easy to sustain in the modern database environment.
    1. True
    2. False

 

ANSWER:  False

 

34. Unnormalized database tables often lead to various data redundancy disasters in production databases.
    1. True
    2. False

 

ANSWER:  True

 

35. Attributes should clearly define participation, connectivity, and document cardinality.
    1. True
    2. False

 

ANSWER:  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.
    1. two three
    2. four d. five

 

ANSWER:  b

 

37. From a structural point of view, 3NF is better than .
    1. 4NF 2NF
    2. 5NF d. 6NF

 

ANSWER:  b

 

38. 1NF, 2NF, and 3NF are .
    1. normalization stages anomalies
    2. repeating groups d. atomic attributes

 

ANSWER:  a

 

39. From a structural point of view, 2NF is better than .
    1. 1NF 3NF
    2. 4NF d. BCNF

 

ANSWER:  a

 

 

 

40.          yields better performance.
    1. Denormalization Normalization
    2. Atomization d. Compression

 

ANSWER:  a

 

41. An attribute that is part of a key is known as a(n)
    1. important nonprime
    2. prime d. entity

 

ANSWER:  c

 

42. A table that displays data redundancies yields .
    1. consistencies anomalies
    2. fewer attributes d. more entities

 

ANSWER:  b

 

43. Data redundancy produces .
    1. slower lookups robust design
    2. efficient storage use d. data integrity problems

 

ANSWER:  d

 

44. Some very specialized applications may require normalization beyond the .
    1. 1NF 2NF
    2. 3NF d. 4NF

 

ANSWER:  d

 

45. Of the following normal forms, is mostly of theoretical interest.
    1. 1NF 3NF
    2. BCNF d. DKNF

 

ANSWER:  d

 

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.
    1. partial dependency repeating group
    2. atomic attribute d. transitive dependency

 

ANSWER:  d

 

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.
    1. determines derives from
    2. controls d. owns

 

ANSWER:  a

 

 

 

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.
    1. partial dependency transitive dependency
    2. repeating group d. primary key

 

ANSWER:  c

 

49. A relational table must not contain a(n) .
    1. entity attribute
    2. relationship d. repeating group

 

ANSWER:  d

 

50. Dependencies based on only a part of a composite primary key are known as
    1. primary partial
    2. incomplete d. composite

 

ANSWER:  b

 

51. In a(n) diagram, the arrows above the attributes indicate all desirable dependencies.
    1. Chen dependency
    2. functionality d. ER

 

ANSWER:  b

 

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 .
    1. 1NF 2NF
    2. 3NF d. 4NF

 

ANSWER:  a

 

53. A table that is in 1NF and includes no partial dependencies is said to be in .
    1. BCNF 2NF
    2. 3NF d. 4NF

 

ANSWER:  b

 

54. If you have three different transitive dependencies, different determinant(s) exist.
    1. one two
    2. three d. four

 

ANSWER:  c

 

55. Before converting a table into 3NF, it is imperative that the table already be in .
    1. 1NF 2NF
    2. 4NF d. BCNF

 

ANSWER:  b

 

 

 

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.
    1. atomic attribute repeating group
    2. partial dependency d. transitive dependency

 

ANSWER:  c

 

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.

1. Boyce-Codd normal forms redundancies
2. time-variances d. partial dependencies

 

ANSWER:  d

 

58. A table that is in 2NF and contains no transitive dependencies is said to be in .
    1. 1NF 2NF
    2. 3NF d. 4NF

 

ANSWER:  c

 

59. Improving leads to more flexible queries.
    1. atomicity normalization
    2. denormalization d. derived attribute

 

ANSWER:  a

 

60. An atomic attribute .
    1. cannot exist in a relational table cannot be further subdivided
    2. displays multiplicity d. is always chosen to be a foreign key

 

ANSWER:  b

 

61. The most likely data type for a surrogate key is .
    1. character date
    2. logical d. numeric

 

ANSWER:  d

 

62. Granularity refers to .
    1. the size of a table the level of detail represented by the values in a table’s row
63. the number of attributes represented in a table the number of rows in a table

 

ANSWER:  b

 

63. From a system functionality point of view, attribute values can be calculated when they are needed to write reports or invoices.
    1. derived atomic
    2. granular d. historical

 

ANSWER:  a

64. In a real-world environment, we must strike a balance between design integrity and .
    1. robustness flexibility
    2. uniqueness d. ease of use

 

ANSWER:  b

 

65. For most business transactional databases, we should normalize relations into .
    1. 1NF 2NF
    2. 3NF d. 6NF

 

ANSWER:  c

 

66. To generate a surrogate key, Microsoft Access uses a(n) data type.
    1. character sequence
    2. AutoNumber d. identity

 

ANSWER:  c

 

67. A table where every determinant is a candidate key is said to be in .
    1. BCNF 2NF
    2. 1NF d. 4NF

 

ANSWER:  a

 

68. In a situation, one key determines multiple values of two other attributes and those attributes are independent of each other.
    1. multivalued dependency transitive dependency
    2. partial dependency d. functional dependency

 

ANSWER:  a

 

69. BCNF can be violated only if the table contains more than one
    1. primary candidate
    2. foreign d. secondary

 

ANSWER:  b

 

70. When a table contains only one candidate key, are considered to be equivalent.
    1. the 1NF and the 2NF the 3NF and the BCNF
    2. the 4NF and the 3NF d. the BCNF and the DKNF

 

ANSWER:  b

 

71. Most designers consider the BCNF as a special case of the .
    1. 1NF 2NF
    2. 3NF d. 4NF

 

ANSWER:  c

 

 

 

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 .
    1. 1NF 2NF
    2. 3NF d. 4NF

 

ANSWER:  d

 

73. A table is in 4NF if it is in 3NF, and .
    1. all attributes must be dependent on the primary key and must be dependent on each other
    2. all attributes are unrelated
    3. it has no multivalued dependencies
    4. no column contains the same values

 

ANSWER:  c

 

74. When designing a database, you should .
    1. make sure that entities are in normal form before table structures are created
    2. create table structures then normalize the database
    3. only normalize the database when performance problems occur
    4. consider more important issues such as performance before normalizing

 

ANSWER:  a

 

75. Normalization represents a micro view of the within the ERD.
    1. entities attributes
    2. relationships d. forms

 

ANSWER:  a

 

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.
    1. transitive 3NF
    2. component d. temporary

 

ANSWER:  d

 

77. The conflicts between design efficiency, information requirements, and performance are often resolved through_____.
    1. compromises that include normalization conversion from 2NF to 3NF
    2. compromises that include denormalization d. conversion from 3NF to 4NF

 

ANSWER:  c

 

78. Data warehouse routinely uses structures in its complex, multilevel, multisource data environment.
    1. 1NF 2NF
    2. 3NF d. 4NF

 

ANSWER:  b

 

 

 

79.          databases reflect the ever-growing demand for greater scope and depth in the data on which decision support systems increasingly rely.
    1. Normalized Data warehouse
    2. Temporary d. Report

 

ANSWER:  b

 

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.

ANSWER:  RDBMS

relational database management system

relational database management system (RDBMS) RDBMS (relational database management system)

81. The price paid for increased performance through denormalization is a larger amount of .

ANSWER:  redundancy

data redundancy

 

82. In order to meet requirements, you may have to denormalize some portions of a database design.

ANSWER:  performance

 

83.          is a process to help reduce the likelihood of data anomalies.

ANSWER:  Normalization

 

84. Any attribute that is at least part of a key is known as a .

ANSWER:  prime attribute

key attribute

 

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 .

ANSWER:  Crow’s Foot notation ERDs

 

86. A dependency based on only a part of a composite primary key is called a .

ANSWER:  partial dependency

 

87. Dependencies can be identified with the help of a dependency .

ANSWER:  diagram

 

88. The problem with transitive dependencies is that they still yield data .

ANSWER:  anomalies

 

89. The is central to a discussion of normalization.

ANSWER:  concept of keys

 

 

 

90. All relational tables satisfy the

ANSWER:  1NF

first normal form

first normal form (1NF)

1NF (first normal form)

91. Data redundancies occur from of data on every row entry.

ANSWER:  duplication

Repetition

 

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.

ANSWER:  primary

 

93. Any attribute whose value determines other values within a row is known as a .

ANSWER:  determinant

 

94. An attribute that cannot be further subdivided is said to display .

ANSWER:  atomicity

 

95.          refers to the level of detail represented by the values stored in a table’s row.

ANSWER:  Granularity

 

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

ANSWER:  surrogate

 

97. It becomes difficult to create a suitable key when the related table uses a composite primary key.

ANSWER:  foreign

 

98. When a nonkey attribute is the determinant of a key attribute, the table is in 3NF but not in .

ANSWER:  BCNF

Boyce-Codd normal form

Boyce-Codd normal form

(BCNF) BCNF (Boyce-Codd normal form)

99. In the , no row may contain two or more multivalued facts about an entity.

ANSWER:  4NF

fourth normal form

fourth normal form (4NF)

4NF (fourth normal form)

 

 

100. The provides the big picture, or macro view, of an organization’s data requirements and operations.

ANSWER:  ERD

entity relationship diagram

entity relationship diagram (ERD)

ERD (entity relationship diagram)

101. The combination of and ER modeling yields a useful ERD, whose entities may now be translated into appropriate table structures.

ANSWER:  normalization

 

102. An ERD is created through an

ANSWER:  iterative

 

103. Unnormalized tables yield no simple strategies for creating virtual tables known as .

ANSWER:  views

 

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.

ANSWER:  entity names

 

105. Explain normalization and its different forms.

ANSWER:  Normalization is a process for evaluating and correcting table structures to minimize data redundancies, thereby reducing the likelihood of data anomalies. The normalization process involves assigning attributes to tables based on the concept of determination. Normalization works through a series of stages called normal forms. The first three stages are described as first normal form (1NF), second normal form (2NF), and third normal form (3NF). From a structural point of view, 2NF is better than 1NF, and 3NF is better than 2NF. For most purposes in business database design, 3NF is as high as you need to go in the normalization process. However, you will discover that properly designed 3NF structures also meet the requirements of fourth normal form (4NF).

106. What characteristics do tables that conform to the concept of well-informed relations have?

ANSWER:  Tables that conform to the concept of well-informed relations have the following characteristics:

 

1. Each table represents a single subject.
2. No data item will be unnecessarily stored in more than one table. This results in tables that have lower redundancies. The reason for this requirement is to ensure that the data is updates in only one place.
3. All nonprime attributes in a table are dependent on the primary key alone. The reason for this requirement is to ensure that the data is uniquely identifiable by a primary key value.
4. Each table is void of insertion, update, or deletion anomalies, which ensure the integrity and consistency of the data.

 

 

107. Describe a dependency diagram and explain its purpose.

ANSWER: Dependency diagrams are very helpful in getting a bird’s eye view of all the relationships among a table’s attributes, and their use makes it less likely that you will overlook an important dependency. The following are features of a dependency diagram:

 

1. The primary key attributes are bold, underlined, and shaded in a different color.
2. The arrows above the attributes indicate all desirable dependencies—that is, dependencies based on the primary key.
3. The arrows below the dependency diagram indicate less desirable dependencies. Two types of such dependencies exist:
   1. Partial dependencies. A dependency based on only a part of a composite primary key is a partial dependency.
   2. Transitive dependencies. A transitive dependency is a dependency of one nonprime attribute on another nonprime attribute. The problem with transitive dependencies is that they still yield data anomalies.

 

108. What steps are involved in the conversion to third normal form?

ANSWER:  Step 1: Make New Tables to Eliminate Transitive Dependencies

For every transitive dependency, write a copy of its determinant as a primary key for a new table. A determinant is any attribute whose value determines other values within a row. If you have three different transitive dependencies, you will have three different determinants. As with the conversion to 2NF, it is important for the determinant remain in the original table to serve as a foreign key.

Step 2: Reassign Corresponding Dependent Attributes

Identify the attributes that are dependent on each determinant identified in Step 1. Place the dependent attributes in the new tables with their determinants and remove them from their original tables.

109. Explain the Boyce-Codd normal form (BCNF). How is it related to other normal forms?

ANSWER:  A table is in Boyce-Codd normal form (BCNF) when every determinant in the table is a candidate key. A candidate key has the same characteristics as a primary key, but for some reason, it was not chosen to be the primary key. Clearly, when a table contains only one candidate key, the 3NF and the BCNF are equivalent. In other words, BCNF can be violated only when the table contains more than one candidate key. Most designers consider the BCNF to be a special case of the 3NF. In fact, if the techniques shown in this chapter are used, most tables conform to the BCNF requirements once the 3NF is reached.

110. Explain how database designers design and normalize databases.

ANSWER:  First, an ERD is created through an iterative process. Database designers begin by identifying relevant entities, their attributes, and their relationships. Then they use the results to identify additional entities and attributes. The ERD provides the big picture, or macro view, of an organization’s data requirements and operations. Second, normalization focuses on the characteristics of specific entities; that is, normalization represents a micro view of the entities within the ERD. Also, the normalization process might yield additional entities and attributes to be incorporated into the ERD. Therefore, it is difficult to separate normalization from ER modeling; the two techniques are used in an iterative and incremental process.