Question 1

Match each of the following terms with its corresponding definition.
-Two different names that are used to refer to the same data item.
A)foreign key
B)functional dependency
C)homonym
D)normalization
E)recursive foreign key
F)referential integrity
G)relation
H)relational database model
I)second normal form (2NF)
J)synonym
K)third normal form (3NF)
L)well-structured relation

Accepted Answer

Synonym refers to two different names that are used to refer to the same data item.

Question 2

A __________ is one or a combination of fields for which more than one row may have the same combination of values.

Accepted Answer

The answer of A __________ is one or a combination...

Question 3

Match each of the following terms with its corresponding definition.
-A value a field will assume unless an explicit value is entered for that field.
A)calculated field
B)data type
C)default value
D)denormalization
E)field
F)hashed file organization
G)index
H)indexed file organization
I)pointer
J)sequential file organization

Accepted Answer

A default value is a value that a field will assume unless an explicit value is entered for that field.

Question 4

Match each of the following terms with its corresponding definition.
-A data model that represents data as a set of related tables or relations.
A)foreign key
B)functional dependency
C)homonym
D)normalization
E)recursive foreign key
F)referential integrity
G)relation
H)relational database model
I)second normal form (2NF)
J)synonym
K)third normal form (3NF)
L)well-structured relation

Accepted Answer

The relational database model is a data model that represents data as a set of related tables or relations.

Question 5

Match each of the following terms with its corresponding definition.
-A single name that is used for two or more different attributes.
A)foreign key
B)functional dependency
C)homonym
D)normalization
E)recursive foreign key
F)referential integrity
G)relation
H)relational database model
I)second normal form (2NF)
J)synonym
K)third normal form (3NF)
L)well-structured relation

Accepted Answer

A homonym is a single name that is used for two or more different attributes.

Question 6

Match each of the following terms with its corresponding definition.
-A relation that contains a minimum amount of redundancy and allows users to insert,modify,and delete the rows in a table without errors or inconsistencies.
A)foreign key
B)functional dependency
C)homonym
D)normalization
E)recursive foreign key
F)referential integrity
G)relation
H)relational database model
I)second normal form (2NF)
J)synonym
K)third normal form (3NF)
L)well-structured relation

Accepted Answer

A well-structured relation is designed to minimize redundancy and avoid errors or inconsistencies when inserting, modifying, or deleting rows in a table.

Question 7

__________ is a technique for physically arranging the records of a file.

Accepted Answer

The answer of __________ is a technique for physically arranging...

Question 8

An __________ is a table used to determine the location of rows in a file that satisfy some condition.

Accepted Answer

The answer of An __________ is a table used to...

Question 9

Match each of the following terms with its corresponding definition.
-An integrity constraint that specifies that the value (or existence)of an attribute in one relation depends on the value (or existence)of the same attribute in another relation.
A)foreign key
B)functional dependency
C)homonym
D)normalization
E)recursive foreign key
F)referential integrity
G)relation
H)relational database model
I)second normal form (2NF)
J)synonym
K)third normal form (3NF)
L)well-structured relation

Accepted Answer

Referential integrity is an integrity constraint that ensures the value or existence of an attribute in one relation depends on the value or existence of the same attribute in another relation.

Question 10

Match each of the following terms with its corresponding definition.
-A field that can be derived from other database fields.
A)calculated field
B)data type
C)default value
D)denormalization
E)field
F)hashed file organization
G)index
H)indexed file organization
I)pointer
J)sequential file organization

Accepted Answer

A calculated field is a field in a database that is derived from other fields, typically using a formula or expression.

Question 11

Match each of the following terms with its corresponding definition.
-The smallest unit of named application data recognized by system software.
A)calculated field
B)data type
C)default value
D)denormalization
E)field
F)hashed file organization
G)index
H)indexed file organization
I)pointer
J)sequential file organization

Accepted Answer

A field is the smallest unit of named application data recognized by system software.

Question 12

Match each of the following terms with its corresponding definition.
-The process of converting complex data structures into simple,stable data structures.
A)foreign key
B)functional dependency
C)homonym
D)normalization
E)recursive foreign key
F)referential integrity
G)relation
H)relational database model
I)second normal form (2NF)
J)synonym
K)third normal form (3NF)
L)well-structured relation

Accepted Answer

Normalization is the process of converting complex data structures into simple, stable data structures.

Question 13

Match each of the following terms with its corresponding definition.
-A foreign key in a relation that references the primary key values of that same relation.
A)foreign key
B)functional dependency
C)homonym
D)normalization
E)recursive foreign key
F)referential integrity
G)relation
H)relational database model
I)second normal form (2NF)
J)synonym
K)third normal form (3NF)
L)well-structured relation

Accepted Answer

A recursive foreign key is a foreign key in a relation that references the primary key values of that same relation.

Question 14

A __________ is a field of data that can be used to locate a related field or row of data.

Accepted Answer

The answer of A __________ is a field of data...

Question 15

Match each of the following terms with its corresponding definition.
-An attribute that appears as a nonkey attribute in one relation and as a primary key attribute (or part of a primary key)in another relation.
A)foreign key
B)functional dependency
C)homonym
D)normalization
E)recursive foreign key
F)referential integrity
G)relation
H)relational database model
I)second normal form (2NF)
J)synonym
K)third normal form (3NF)
L)well-structured relation

Accepted Answer

B) functional dependency - A constraint between two attributes in which one attribute determines the value of another attribute.
C) homonym - A situation in which two or more attributes have the same name but different meanings.
D) normalization - The process of organizing a database to minimize redundancy and dependency.
E) recursive foreign key - A foreign key that points back to the same table.
F) referential integrity - A constraint that ensures that a foreign key value always refers to an existing primary key value.
G) relation - A table that contains data about a specific entity or relationship.
H) relational database model - A model that uses relations or tables to organize and store data in a database.
I) second normal form (2NF) - A relation in which all nonkey attributes are functionally dependent on the entire primary key.
J) synonym - A situation in which two or more attributes have the same meaning but different names.
K) third normal form (3NF) - A relation in which all nonkey attributes are functionally dependent on the primary key but not on any other nonkey attributes.
L) well-structured relation - A relation that conforms to the rules of normalization and has no functional dependencies between nonkey attributes.

Answer: 
A) foreign key 
B) functional dependency 
C) homonym 
D) normalization 
E) recursive foreign key 
F) referential integrity 
G) relation 
H) relational database model 
I) second normal form (2NF) 
J) synonym 
K) third normal form (3NF)
L) well-structured relation

All the choices are correctly matched with their definitions.

Question 16

Match each of the following terms with its corresponding definition.
-A relation is in this form if it is in second normal form and no transitive dependencies exist.
A)foreign key
B)functional dependency
C)homonym
D)normalization
E)recursive foreign key
F)referential integrity
G)relation
H)relational database model
I)second normal form (2NF)
J)synonym
K)third normal form (3NF)
L)well-structured relation

Accepted Answer

A relation is in third normal form (3NF) if it is in second normal form (2NF) and no transitive dependencies exist.

Question 17

Match each of the following terms with its corresponding definition.
-A named two-dimensional table of data.
A)foreign key
B)functional dependency
C)homonym
D)normalization
E)recursive foreign key
F)referential integrity
G)relation
H)relational database model
I)second normal form (2NF)
J)synonym
K)third normal form (3NF)
L)well-structured relation

Accepted Answer

A "relation" is a named two-dimensional table of data in the context of databases.

Question 18

Match each of the following terms with its corresponding definition.
-A relation is in this form if every nonprimary key attribute is functionally dependent on the whole primary key.
A)foreign key
B)functional dependency
C)homonym
D)normalization
E)recursive foreign key
F)referential integrity
G)relation
H)relational database model
I)second normal form (2NF)
J)synonym
K)third normal form (3NF)
L)well-structured relation

Accepted Answer

In the second normal form (2NF), every nonprimary key attribute must be fully functionally dependent on the whole primary key, meaning there are no partial dependencies on a subset of the primary key.

Question 19

Match each of the following terms with its corresponding definition.
-A particular relationship between two attributes.For every valid instance of A,that value of A uniquely determines the value of B.
A)foreign key
B)functional dependency
C)homonym
D)normalization
E)recursive foreign key
F)referential integrity
G)relation
H)relational database model
I)second normal form (2NF)
J)synonym
K)third normal form (3NF)
L)well-structured relation

Accepted Answer

A functional dependency is a relationship between two attributes, typically in a database, where one attribute uniquely determines another.

Question 20

The __________ uses an algorithm to determine the address for each row.

Accepted Answer

The answer of The __________ uses an algorithm to determine...

Quiz 9: Designing Databases

Match each of the following terms with its corresponding definition. -Two different names that are used to refer to the same data item.

A __________ is one or a combination of fields for which more than one row may have the same combination of values.

Match each of the following terms with its corresponding definition. -A value a field will assume unless an explicit value is entered for that field.

Match each of the following terms with its corresponding definition. -A data model that represents data as a set of related tables or relations.

Match each of the following terms with its corresponding definition. -A single name that is used for two or more different attributes.

Match each of the following terms with its corresponding definition. -A relation that contains a minimum amount of redundancy and allows users to insert,modify,and delete the rows in a table without errors or inconsistencies.

__________ is a technique for physically arranging the records of a file.

An __________ is a table used to determine the location of rows in a file that satisfy some condition.

Match each of the following terms with its corresponding definition. -An integrity constraint that specifies that the value (or existence) of an attribute in one relation depends on the value (or existence) of the same attribute in another relation.

Match each of the following terms with its corresponding definition. -A field that can be derived from other database fields.

Match each of the following terms with its corresponding definition. -The smallest unit of named application data recognized by system software.

Match each of the following terms with its corresponding definition. -The process of converting complex data structures into simple,stable data structures.

Match each of the following terms with its corresponding definition. -A foreign key in a relation that references the primary key values of that same relation.

A __________ is a field of data that can be used to locate a related field or row of data.

Match each of the following terms with its corresponding definition. -An attribute that appears as a nonkey attribute in one relation and as a primary key attribute (or part of a primary key) in another relation.

Match each of the following terms with its corresponding definition. -A relation is in this form if it is in second normal form and no transitive dependencies exist.

Match each of the following terms with its corresponding definition. -A named two-dimensional table of data.

Match each of the following terms with its corresponding definition. -A relation is in this form if every nonprimary key attribute is functionally dependent on the whole primary key.

Match each of the following terms with its corresponding definition. -A particular relationship between two attributes.For every valid instance of A,that value of A uniquely determines the value of B.

The __________ uses an algorithm to determine the address for each row.