Question 1

Match each of the following terms with its corresponding definition.
-A field of data that can be used to locate a related field or row of data
A)Calculated field
B)Data type
C)Default value
D)Denormalization
E)Field
F)Hashed file organization
G)Index
H)Index file organization
I)Pointer
J)Sequential file organization

Accepted Answer

The answer of Match each of the following terms with...

Question 2

Match each of the following E-R structures with its relational representation.
-Create a relation with a composite primary key that includes the primary key of the entity on which this entity depends and nonkey attributes.
A)Regular entity
B)Weak entity
C)Binary or unary 1:1 relationship
D)Binary 1:N relationship
E)Binary or unary M:N relationship or associative entity
F)Binary or unary M:N relationship or associative entity with its own key

Accepted Answer

A weak entity depends on another entity, so its primary key includes the primary key of the entity on which it depends. It also includes nonkey attributes.

Answer: E
 A M:N relationship or associative entity also depends on other entities, so its primary key includes the primary keys of those entities. It also includes nonkey attributes. The associative entity itself may also have its own primary key.

Question 3

Match each of the following file organizations with a corresponding description.(Answers may occur more than once.)
-Referencing storage space, this method has no wasted space.
A)Indexed file organization
B)Hashed file organization
C)Sequential file organization

Accepted Answer

The answer of Match each of the following file organizations...

Question 4

Match each of the following E-R structures with its relational representation.
-Place the primary key of the entity on the one side of the relationship as a foreign key in the relation for the entity on the many side.
A)Regular entity
B)Weak entity
C)Binary or unary 1:1 relationship
D)Binary 1:N relationship
E)Binary or unary M:N relationship or associative entity
F)Binary or unary M:N relationship or associative entity with its own key

Accepted Answer

The answer of Match each of the following E-R structures...

Question 5

Match each of the following file organizations with a corresponding description.(Answers may occur more than once.)
-Referencing multiple key retrieval, this method is not possible.
A)Indexed file organization
B)Hashed file organization
C)Sequential file organization

Accepted Answer

The description is referencing the inability to reference multiple keys, which is a limitation of indexed and sequential file organizations. The only option left is hashed file organization, which uses a single key for retrieval.

Question 6

Briefly identify the three file organizations.

Accepted Answer

The answer of Briefly identify the three file organizations....

Question 7

Match each of the following file organizations with a corresponding description.(Answers may occur more than once.)
-Referencing random retrieval on primary key, this method is moderately fast.
A)Indexed file organization
B)Hashed file organization
C)Sequential file organization

Accepted Answer

Indexed file organization allows for random retrieval on primary key, while still being moderately fast. Hashed file organization is faster than indexed file organization, but does not allow for random retrieval on primary key. Sequential file organization does not allow for random retrieval on primary key and is slower than the other two options.

Question 8

Outline the four key steps in logical database modeling and design.

Accepted Answer

The answer of Outline the four key steps in logical...

Question 9

Define each of the following terms: relation, functional dependency, foreign key, and normalization.

Accepted Answer

The answer of Define each of the following terms: relation,...

Question 10

Match each of the following file organizations with a corresponding description.(Answers may occur more than once.)
-Referencing sequential retrieval on the primary key, this method is impractical.
A)Indexed file organization
B)Hashed file organization
C)Sequential file organization

Accepted Answer

Hashed file organization is the best choice when referencing sequential retrieval on the primary key is impractical as it allows for direct access to records based on their hashed key values. Indexed file organization is also a possibility, but it may not be as efficient as a hashed organization in this scenario. Sequential file organization would not be practical for this situation as it relies on the records being stored in a specific order based on the primary key.

Question 11

Discuss the rules for normalization.

Accepted Answer

The answer of Discuss the rules for normalization....

Question 12

Match each of the following E-R structures with its relational representation.
-Create a relation with primary key and nonkey attributes.
A)Regular entity
B)Weak entity
C)Binary or unary 1:1 relationship
D)Binary 1:N relationship
E)Binary or unary M:N relationship or associative entity
F)Binary or unary M:N relationship or associative entity with its own key

Accepted Answer

The answer of Match each of the following E-R structures...

Question 13

Match each of the following E-R structures with its relational representation.
-Create a relation with the primary key associated with the relationship or associative entity, plus any nonkey attributes of the relationship or associative entity and the primary keys of the related entities.
A)Regular entity
B)Weak entity
C)Binary or unary 1:1 relationship
D)Binary 1:N relationship
E)Binary or unary M:N relationship or associative entity
F)Binary or unary M:N relationship or associative entity with its own key

Accepted Answer

The answer of Match each of the following E-R structures...

Question 14

Match each of the following E-R structures with its relational representation.
-Create a relation with a composite primary key using the primary keys of the related entities, plus any nonkey attributes of the relationship or associative entity.
A)Regular entity
B)Weak entity
C)Binary or unary 1:1 relationship
D)Binary 1:N relationship
E)Binary or unary M:N relationship or associative entity
F)Binary or unary M:N relationship or associative entity with its own key

Accepted Answer

M:N relationships or associative entities are represented using a separate table with foreign keys from both related entities. This table can also have its own attributes, which can be used as part of the composite primary key.

Question 15

Match each of the following E-R structures with its relational representation.
-Place the primary key of either entity in the relation for the other entity or do this for both entities.
A)Regular entity
B)Weak entity
C)Binary or unary 1:1 relationship
D)Binary 1:N relationship
E)Binary or unary M:N relationship or associative entity
F)Binary or unary M:N relationship or associative entity with its own key

Accepted Answer

The answer of Match each of the following E-R structures...

Question 16

Match each of the following file organizations with a corresponding description.(Answers may occur more than once.)
-Referencing updating rows, this method is easy but requires maintenance of indexes.
A)Indexed file organization
B)Hashed file organization
C)Sequential file organization

Accepted Answer

The indexed file organization allows for quick referencing of specific rows through the use of indexes. However, when updating rows, the indexes must also be maintained, which can require additional effort and resources.

Question 17

Identify the five properties of a relation.

Accepted Answer

The answer of Identify the five properties of a relation....

Quiz 9: Designing Databases

Match each of the following terms with its corresponding definition. -A field of data that can be used to locate a related field or row of data

Match each of the following E-R structures with its relational representation. -Create a relation with a composite primary key that includes the primary key of the entity on which this entity depends and nonkey attributes.

Match each of the following file organizations with a corresponding description.(Answers may occur more than once.) -Referencing storage space, this method has no wasted space.

Match each of the following E-R structures with its relational representation. -Place the primary key of the entity on the one side of the relationship as a foreign key in the relation for the entity on the many side.

Match each of the following file organizations with a corresponding description.(Answers may occur more than once.) -Referencing multiple key retrieval, this method is not possible.

Briefly identify the three file organizations.

Match each of the following file organizations with a corresponding description.(Answers may occur more than once.) -Referencing random retrieval on primary key, this method is moderately fast.

Outline the four key steps in logical database modeling and design.

Define each of the following terms: relation, functional dependency, foreign key, and normalization.

Match each of the following file organizations with a corresponding description.(Answers may occur more than once.) -Referencing sequential retrieval on the primary key, this method is impractical.

Discuss the rules for normalization.

Match each of the following E-R structures with its relational representation. -Create a relation with primary key and nonkey attributes.

Match each of the following E-R structures with its relational representation. -Create a relation with the primary key associated with the relationship or associative entity, plus any nonkey attributes of the relationship or associative entity and the primary keys of the related entities.

Match each of the following E-R structures with its relational representation. -Create a relation with a composite primary key using the primary keys of the related entities, plus any nonkey attributes of the relationship or associative entity.

Match each of the following E-R structures with its relational representation. -Place the primary key of either entity in the relation for the other entity or do this for both entities.

Match each of the following file organizations with a corresponding description.(Answers may occur more than once.) -Referencing updating rows, this method is easy but requires maintenance of indexes.

Identify the five properties of a relation.