Quiz 9: Designing Databases
Computing
Q 1Q 1
One of the purposes of database design is to choose data storage technologies that will efficiently,accurately,and securely process database activities.
Free
True False
True
Q 2Q 2
The selection of data storage technologies is made during the systems implementation and operation phase.
Free
True False
False
Free
True False
False
Free
True False
Q 5Q 5
Generally speaking,logical and physical database design is performed in parallel with other systems design steps.
Free
True False
Q 6Q 6
Normalization helps build a data model that is simple,not redundant,and requires minimum maintenance.
Free
True False
Q 7Q 7
During logic modeling,the normalized data requirements from all user interfaces are combined into one consolidated logical database model.
Free
True False
Q 8Q 8
The selection of the appropriate storage format for each attribute from the logical database model is made during physical database design.
Free
True False
Q 9Q 9
In general,data structure refers to grouping attributes from the logical database model into physical records.
Free
True False
Q 10Q 10
A file organization is an arrangement of related records in secondary memory so that individual and groups of records can be stored,retrieved,and updated rapidly.
Free
True False
Q 11Q 11
When using the relational notation,the primary key attribute is indicated by a dashed underline.
Free
True False
Free
True False
Free
True False
Free
True False
Free
True False
Q 16Q 16
Object-oriented database models are the most frequently used database technologies for new information systems development.
Free
True False
Free
True False
Free
True False
Q 19Q 19
One property of a relation is that entries in a given column are from the same set of values.
Free
True False
Q 20Q 20
Referencing a relation,the sequence of columns cannot be interchanged without changing the meaning or use of the relation.
Free
True False
Free
True False
Q 22Q 22
A relation is said to be in second normal form when its nonprimary key attributes do not depend on each other.
Free
True False
Q 23Q 23
The result of normalization is that every nonprimary key attribute depends upon the whole primary key and nothing but the primary key.
Free
True False
Free
True False
Q 25Q 25
If for every valid value of A the value of B is determined by the value of A,then B is functionally dependent on A.
Free
True False
Free
True False
Q 27Q 27
A relation is in second normal form if every nonprimary key attribute is functionally dependent on the whole primary key.
Free
True False
Q 28Q 28
A relation is said to be in second normal form if the primary key consists of only one attribute.
Free
True False
Free
True False
Free
True False
Q 31Q 31
A transitive dependency is an integrity constraint specifying that the value of an attribute in one relation depends on the value of the same attribute in another relation.
Free
True False
Free
True False
Q 33Q 33
A default value is a value a field will assume unless an explicit value is entered for that field.
Free
True False
Free
True False
Q 35Q 35
Efficient use of secondary storage and data processing speed are two goals of physical table design.
Free
True False
Free
True False
Q 37Q 37
Denormalization is the process of splitting or combining normalized relations into physical tables based on affinity of use of rows and fields.
Free
True False
Free
True False
Free
True False
Q 40Q 40
A physical file is a named set of table rows stored in a contiguous section of secondary memory.
Free
True False
Free
True False
Q 42Q 42
When using the sequential file organization,the addition of rows requires rewriting the file.
Free
True False
Q 43Q 43
Indexes should be used generously for databases intended primarily to support data retrievals.
Free
True False
Q 44Q 44
Indexes should be used judiciously for databases that support transaction processing and other applications with heavy updating requirements.
Free
True False
Free
True False
Q 46Q 46
Random key retrieval on the primary key is comparatively slow with the hashed file organization.
Free
True False
Q 47Q 47
File restoration can be achieved through backup copies of a file,audit trails,and row image files.
Free
True False
Free
True False
Q 49Q 49
Data security can be built into a file through encryption,passwords,or prohibiting users from directly manipulating a file.
Free
True False
Q 50Q 50
Designing the database for an Internet-based electronic commerce application differs significantly from the process followed when designing the database for other types of applications.
Free
True False
Q 51Q 51
Which of the following is not associated with database design?
A)Structure the data in stable structures that are not likely to change over time and that have minimal redundancy.
B)The preparation of a final conceptual model and the implementation of the database.
C)Develop a logical database design from which we can do physical database design.
D)Develop a logical database design that reflects the actual data requirements that exist in the forms and reports of an information system.
Free
Multiple Choice
Q 52Q 52
The most common style for a logical database model is the:
A)relational database model
B)hierarchical database model
C)network database model
D)object-oriented database model
Free
Multiple Choice
Q 53Q 53
During logical database design,the work of all systems development team members is coordinated and shared through:
A)the project dictionary
B)scheduled weekly meetings
C)the project leader
D)JAD sessions
Free
Multiple Choice
Q 54Q 54
Which of the following is not a key step in logical database modeling and design?
A)Combine normalized data requirements from all user interfaces into one consolidated logical database model.
B)Compare the consolidated logical database design with the translated E-R model and produce,through view integration,one final logical database design for the application.
C)Model how data flow through an information system,the relationships among the data flows,and how data come to be stored at specific locations.
D)Translate the conceptual E-R data model for the application into normalized data requirements.
Free
Multiple Choice
Q 55Q 55
Combining all normalized user views into one consolidated logical database model refers to:
A)requirements structuring
B)view integration
C)normalization
D)file integration
Free
Multiple Choice
Q 56Q 56
During physical design,you consider:
A)the definitions of each attribute
B)the descriptions of where and when data are entered,retrieved,deleted,and updated
C)the expectations for response time and data integrity
D)all of the above
Free
Multiple Choice
Q 57Q 57
The following are steps to transforming an E-R diagram into normalized relations and then merging all the relations into one final,consolidated set of relations except for:
A)represent entities
B)represent relationships
C)normalize the relations
D)denormalize the relations
Free
Multiple Choice
Q 58Q 58
Using relational notation,an attribute of a relation that is the primary key of another relation is indicated by:
A)an underline
B)a circle
C)a dashed underline
D)italics
Free
Multiple Choice
Q 59Q 59
The primary deliverable from logical database design is:
A)normalized relations
B)design specifications
C)an updated baseline project plan
D)a list of alternative design strategies
Free
Multiple Choice
Q 60Q 60
A data model that represents data in the form of tables or relations is called a:
A)hierarchical database model
B)network database model
C)relational database model
D)hybrid database model
Free
Multiple Choice
Free
Multiple Choice
Q 62Q 62
Which of the following is not a true statement regarding a relation?
A)Each relation consists of a set of named columns and an arbitrary number of unnamed rows.
B)Each column in a relation corresponds to an attribute of that relation.
C)An entry at the intersection of each row and column has a single value.
D)Each row in a relation corresponds to an attribute of that relation.
Free
Multiple Choice
Q 63Q 63
Assume the structure of a relation is EMPLOYEE (Emp_ID,Name,Dept,Salary).The number of attributes for this relation would be:
A)three
B)four
C)five
D)six
Free
Multiple Choice
Q 64Q 64
Which of the following properties of a relation states that an entry at the intersection of each row and column is single-valued?
A)Entries in cells are simple.
B)Entries in columns are from the same set of values.
C)Each row is unique.
D)The sequence of rows is insignificant.
Free
Multiple Choice
Q 65Q 65
A relation that contains a minimum amount of redundancy and allows users to insert,modify,and delete rows without errors or inconsistencies is a(n):
A)independent relation
B)simple relation
C)unnormalized relation
D)well-structured relation
Free
Multiple Choice
Q 66Q 66
The process of converting complex data structures into simple,stable data structures is referred to as:
A)normalization
B)simplification
C)structuring
D)process modeling
Free
Multiple Choice
Q 67Q 67
When each nonprimary key attribute is identified by the whole key,the relation is said to be in at least:
A)second normal form
B)third normal form
C)fourth normal form
D)fifth normal form
Free
Multiple Choice
Q 68Q 68
A particular relationship between two attributes best defines:
A)context
B)functional dependency
C)normal form
D)structure
Free
Multiple Choice
Q 69Q 69
For any relation R,if,for every valid instance of A,that value of A uniquely determines the value of B:
A)then a primary dependency exists in the relation
B)then A is said to be functionally dependent on B
C)then B is said to be functionally dependent on A
D)then A and B are candidate keys for the relation
Free
Multiple Choice
Q 70Q 70
The relation state specifying that nonprimary key attributes do not depend on other nonprimary key attributes is:
A)first normal form
B)second normal form
C)Boyce-Codd normal form
D)third normal form
Free
Multiple Choice
Q 71Q 71
A functional dependency between two (or more)nonprimary key attributes in a relation defines a:
A)weak dependency
B)partial dependency
C)simple dependency
D)transitive dependency
Free
Multiple Choice
Q 72Q 72
To convert a relation to second normal form,you decompose the relation into new relations using the attributes,called:
A)determinants
B)foreign key
C)pointer
D)relationship key
Free
Multiple Choice
Q 73Q 73
If order number serves as the primary key in the ORDER relation and also appears as a nonprimary key attribute in the INVOICE relation,then order number is said to be a:
A)foreign key
B)candidate key
C)pointer
D)relationship key
Free
Multiple Choice
Q 74Q 74
Which of the following statements is true regarding normalization?
A)Normalization is a top-down process.
B)Normalization produces a set of well-structured relations that contain all of the data mentioned in system inputs and outputs.
C)Through the use of anomalies,stable structures are produced.
D)Normalization is an integrity constraint specifying that the value of an attribute in one relation depends on the value of the same attribute in another relation.
Free
Multiple Choice
Q 75Q 75
Each regular entity type in an E-R diagram is transformed into a:
A)row in a relation
B)column in a relation
C)relation
D)tuple in a relation
Free
Multiple Choice
Q 76Q 76
When transforming an E-R diagram into normalized relations,the identifier of the entity type becomes:
A)the primary key of the corresponding relation
B)the foreign key in the corresponding relation
C)a nonkey attribute in the corresponding relation
D)a secondary key in the corresponding relation
Free
Multiple Choice
Q 77Q 77
Which of the following properties should be satisfied when the identifier of the entity type becomes the primary key of the corresponding relation?
A)The value of the key must uniquely identify every row in the relation.
B)The key should serve as a foreign key in at least two other relations.
C)The key must be a composite of a primary key and a secondary key.
D)The key should be an intelligent key.
Free
Multiple Choice
Q 78Q 78
An entity whose primary key depends on the primary key of another entity is called a:
A)referential entity
B)candidate entity
C)transitive entity
D)weak entity
Free
Multiple Choice
Q 79Q 79
A binary one-to-many relationship in an E-R diagram is best represented by:
A)the creation of a separate relation; the primary key of this new relation is a composite key consisting of the primary key for each of the two entities in the relationship
B)adding the primary key attribute (or attributes)of the entity on the one side of the relationship as a foreign key in the relation that is on the many side of the relationship
C)adding the primary key attribute (or attributes)of the entity on the many side of the relationship as a foreign key in the relation that is on the one side of the relationship
D)creating a relation with a composite primary key and nonkey attributes
Free
Multiple Choice
Q 80Q 80
For a binary one-to-one relationship between two entities A and B,the relationship is represented by:
A)adding the primary key of A as a foreign key of B
B)adding the primary key of B as a foreign key of A
C)combining the two entities into one relation
D)either A or B
Free
Multiple Choice
Q 81Q 81
For a unary one-to-one relationship between two entities A and B,the relationship is represented by:
A)adding the primary key of A as a foreign key of B
B)adding the primary key of B as a foreign key of A
C)combining the two entities into one relation
D)either A or B
Free
Multiple Choice
Q 82Q 82
For a binary many-to-many relationship existing between entity types A and B:
A)a separate relation C is created; the primary key of relation C is a composite key consisting of the primary key for each of the two entities in the relationship
B)the primary keys of relation A and relation B are designated as functionally dependent attributes
C)secondary keys are used to establish the relationship
D)place the primary key of either entity in the relation for the other entity or do this for both entities
Free
Multiple Choice
Q 83Q 83
If an associative entity exists,then:
A)a separate relation C is created; the primary key of relation C is a composite key consisting of the primary key for each of the two entities in the relationship
B)the primary keys of relation A and relation B are designated as functionally dependent attributes
C)secondary keys are used to establish the relationship
D)place the primary key of either entity in the relation for the other entity or do this for both entities
Free
Multiple Choice
Q 84Q 84
If a relationship exists among three or more entities,then:
A)recursive relationships must be established through the use of recursive foreign keys
B)a separate relation with a primary key that is the composite of the primary keys of each of the participating entities is created
C)separate relations are established for each class and for each of the subclasses
D)use the primary key of relation A as a foreign key in relations B and C
Free
Multiple Choice
Q 85Q 85
Relationships between instances of a single entity type are referred to as:
A)binary relationships
B)transitive relationships
C)recursive relationships
D)dependent relationships
Free
Multiple Choice
Q 86Q 86
A many-to-many relationship that associates certain items with their component items is called a:
A)binary structure
B)bill-of-materials structure
C)binary relationship
D)ternary relationship
Free
Multiple Choice
Q 87Q 87
A foreign key in a relation that references the primary key values of that same relation is referred to as a:
A)secondary key
B)recursive foreign key
C)composite key
D)complex key
Free
Multiple Choice
Q 88Q 88
For a unary M:N relationship:
A)the entity type is modeled as one relation; using as its primary key a composite key,a separate relation is created to represent the M:N relationship
B)the entity type and the M:N relationship are modeled as one relation; a composite key is used
C)separate relations for the class and for each subclass are created; primary and foreign keys are established for each class
D)the primary key of the entity on the one side of the relationship serves as a foreign key in the relation on the many side of the relationship
Free
Multiple Choice
Q 89Q 89
"Create a relation with primary key and nonkey attributes" is the relational representation for which E-R structure?
A)weak entity
B)regular entity
C)gerund
D)IS-A relationship
Free
Multiple Choice
Q 90Q 90
Merging relations is also referred to as:
A)view integration
B)view consolidation
C)encompassing
D)normalizing
Free
Multiple Choice
Q 91Q 91
Two different names that refer to the same data item best defines:
A)homonym
B)synonym
C)transitive dependency
D)alias
Free
Multiple Choice
Q 92Q 92
A single name that is used for two or more different attributes best defines:
A)homonym
B)synonym
C)transitive dependency
D)alias
Free
Multiple Choice
Q 93Q 93
When two 3NF relations are merged to form a single relation:
A)weak entities are created
B)recursive relationships may result
C)transitive dependencies may result
D)IS-A relationships are formed
Free
Multiple Choice
Q 94Q 94
A named set of rows and columns that specifies the fields in each row of the table best describes:
A)relation
B)data structure
C)entity type
D)physical table
Free
Multiple Choice
Q 95Q 95
A special field value,distinct from 0,blank,or any other value,that indicates that the value for the field is missing or otherwise unknown best defines:
A)transitive value
B)primary key
C)null value
D)pointer
Free
Multiple Choice
Q 96Q 96
The process of splitting or combining normalized relations into physical tables based on affinity of use of rows and fields best describes:
A)normalization
B)simplification
C)denormalization
D)data structure
Free
Multiple Choice
Q 97Q 97
Which of the following combines range and hash partitioning by first segregating data by ranges on the designated attribute and then within each of these partitions it further partitions by hashing on the designated attribute?
A)composite partitioning
B)combined partitioning
C)transitive partitioning
D)functional partitioning
Free
Multiple Choice
Q 98Q 98
A field of data that can be used to locate a related field or row of data best describes:
A)pointer
B)marker
C)field locator
D)reference locator
Free
Multiple Choice
Q 99Q 99
A table used to determine the location of rows in a file that satisfy some condition best describes:
A)relation
B)structure chart
C)index
D)domain table
Free
Multiple Choice
Q 100Q 100
The index file organization:
A)provides very fast random retrieval on the primary key
B)provides slow random retrieval on the primary key
C)provides moderately fast random retrieval on the primary key
D)does not provide random retrieval on the primary key
Free
Multiple Choice
Free
Short Answer
Free
Short Answer
Free
Short Answer
Q 104Q 104
A __________ is a relation that contains a minimum amount of redundancy and allows users to insert,modify,and delete the rows without errors or inconsistencies.
Free
Short Answer
Q 105Q 105
__________ is the process of converting complex data structures into simple,stable data structures.
Free
Short Answer
Free
Short Answer
Q 107Q 107
A relation is in __________ if every nonprimary key attribute is functionally dependent on the whole primary key.
Free
Short Answer
Q 108Q 108
A relation is in __________ if it is in second normal form and there are no functional dependencies between two (or more)nonprimary key attributes.
Free
Short Answer
Q 109Q 109
A __________ is an attribute that appears as a nonprimary key attribute in one relation and as a primary key attribute (or part of a primary key)in another relation.
Free
Short Answer
Q 110Q 110
__________ is an integrity constraint specifying that the value (or existence)of an attribute in one relation depends on the value (or existence)of the same attribute in another relation.
Free
Short Answer
Q 111Q 111
A __________ is a foreign key in a relation that references the primary key values of that same relation.
Free
Short Answer
Free
Short Answer
Free
Short Answer
Q 114Q 114
A __________ is the smallest unit of named application data recognized by system software.
Free
Short Answer
Q 115Q 115
A __________ is a coding scheme recognized by system software for representing organizational data.
Free
Short Answer
Free
Short Answer
Q 117Q 117
A __________ is a value a field will assume unless an explicit value is entered for that field.
Free
Short Answer
Q 118Q 118
__________ is a special field value,distinct from 0,blank,or any other value,that indicates that the value for the field is missing or otherwise unknown.
Free
Short Answer
Q 119Q 119
A __________ is a named set of rows and columns that specifies the fields in each row of the table.
Free
Short Answer
Q 120Q 120
__________ is the process of splitting or combining normalized relations into physical tables based on affinity of use of rows and fields.
Free
Short Answer
Free
Short Answer
Q 122Q 122
A __________ is a field of data that can be used to locate a related field or row of data.
Free
Short Answer
Q 123Q 123
An __________ is a table used to determine the location of rows in a file that satisfy some condition.
Free
Short Answer
Q 124Q 124
A __________ is one or a combination of fields for which more than one row may have the same combination of values.
Free
Short Answer
Free
Short Answer
Q 126Q 126
Match each of the following terms with its corresponding definition.
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
-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.
Free
Short Answer
Q 127Q 127
Match each of the following terms with its corresponding definition.
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
-A relation is in this form if every nonprimary key attribute is functionally dependent on the whole primary key.
Free
Short Answer
Q 128Q 128
Match each of the following terms with its corresponding definition.
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
-A particular relationship between two attributes.For every valid instance of A,that value of A uniquely determines the value of B.
Free
Short Answer
Q 129Q 129
Match each of the following terms with its corresponding definition.
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
-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.
Free
Short Answer
Q 130Q 130
Match each of the following terms with its corresponding definition.
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
-A data model that represents data as a set of related tables or relations.
Free
Short Answer
Q 131Q 131
Match each of the following terms with its corresponding definition.
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
-A foreign key in a relation that references the primary key values of that same relation.
Free
Short Answer
Q 132Q 132
Match each of the following terms with its corresponding definition.
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
-Two different names that are used to refer to the same data item.
Free
Short Answer
Q 133Q 133
Match each of the following terms with its corresponding definition.
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
-A named two-dimensional table of data.
Free
Short Answer
Q 134Q 134
Match each of the following terms with its corresponding definition.
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
-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.
Free
Short Answer
Q 135Q 135
Match each of the following terms with its corresponding definition.
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
-A single name that is used for two or more different attributes.
Free
Short Answer
Q 136Q 136
Match each of the following terms with its corresponding definition.
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
-A relation is in this form if it is in second normal form and no transitive dependencies exist.
Free
Short Answer
Q 137Q 137
Match each of the following terms with its corresponding definition.
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
-The process of converting complex data structures into simple,stable data structures.
Free
Short Answer
Q 138Q 138
Match each of the following terms with its corresponding definition.
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
-The smallest unit of named application data recognized by system software.
Free
Short Answer
Q 139Q 139
Match each of the following terms with its corresponding definition.
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
-A value a field will assume unless an explicit value is entered for that field.
Free
Short Answer
Q 140Q 140
Match each of the following terms with its corresponding definition.
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
-A field that can be derived from other database fields.
Free
Short Answer
Q 141Q 141
Match each of the following terms with its corresponding definition.
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
-The process of splitting or combining normalized relations into physical tables based on affinity of use of rows and fields.
Free
Short Answer
Q 142Q 142
Match each of the following terms with its corresponding definition.
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
-A coding scheme recognized by system software for representing organizational data.
Free
Short Answer
Q 143Q 143
Match each of the following terms with its corresponding definition.
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
-A table used to determine the location of rows in a file that satisfy some condition.
Free
Short Answer
Q 144Q 144
Match each of the following terms with its corresponding definition.
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
-The address for each row is determined using an algorithm.
Free
Short Answer
Q 145Q 145
Match each of the following terms with its corresponding definition.
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
-The rows are stored either sequentially or nonsequentially,and a table is created that allows software to locate individual rows.
Free
Short Answer
Q 146Q 146
Match each of the following terms with its corresponding definition.
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
-The rows in the file are stored in sequence according to a primary key value.
Free
Short Answer
Q 147Q 147
Match each of the following terms with its corresponding definition.
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
-A field of data that can be used to locate a related field or row of data.
Free
Short Answer
Q 148Q 148
Match each of the following terms with its corresponding definition.
a.foreign key
b.functional dependency
c.homonym
d.recursive foreign key
e.referential integrity
f.relation
g.relational database model
h.synonym
i.well-structured relation
-A foreign key in a relation that references the primary key values of that same relation.
Free
Short Answer
Q 149Q 149
Match each of the following terms with its corresponding definition.
a.foreign key
b.functional dependency
c.homonym
d.recursive foreign key
e.referential integrity
f.relation
g.relational database model
h.synonym
i.well-structured relation
-A particular relationship between two attributes.For every valid instance of A,the value of A uniquely determines the value of B.
Free
Short Answer
Q 150Q 150
Match each of the following terms with its corresponding definition.
a.foreign key
b.functional dependency
c.homonym
d.recursive foreign key
e.referential integrity
f.relation
g.relational database model
h.synonym
i.well-structured relation
-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.
Free
Short Answer
Q 151Q 151
Match each of the following terms with its corresponding definition.
a.foreign key
b.functional dependency
c.homonym
d.recursive foreign key
e.referential integrity
f.relation
g.relational database model
h.synonym
i.well-structured relation
-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.
Free
Short Answer
Q 152Q 152
Match each of the following terms with its corresponding definition.
a.foreign key
b.functional dependency
c.homonym
d.recursive foreign key
e.referential integrity
f.relation
g.relational database model
h.synonym
i.well-structured relation
-A named two-dimensional table of data.
Free
Short Answer
Q 153Q 153
Match each of the following terms with its corresponding definition.
a.foreign key
b.functional dependency
c.homonym
d.recursive foreign key
e.referential integrity
f.relation
g.relational database model
h.synonym
i.well-structured relation
-A single name that is used for two or more different attributes.
Free
Short Answer
Q 154Q 154
Match each of the following terms with its corresponding definition.
a.foreign key
b.functional dependency
c.homonym
d.recursive foreign key
e.referential integrity
f.relation
g.relational database model
h.synonym
i.well-structured relation
-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.
Free
Short Answer
Q 155Q 155
Match each of the following terms with its corresponding definition.
a.foreign key
b.functional dependency
c.homonym
d.recursive foreign key
e.referential integrity
f.relation
g.relational database model
h.synonym
i.well-structured relation
-Two different names that are used to refer to the same data item.
Free
Short Answer
Q 156Q 156
Match each of the following terms with its corresponding definition.
a.foreign key
b.functional dependency
c.homonym
d.recursive foreign key
e.referential integrity
f.relation
g.relational database model
h.synonym
i.well-structured relation
-A data model that represents data in the form of tables or relations.
Free
Short Answer
Q 157Q 157
Match each of the following E-R structures with its relational representation.
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
-Create a relation with a composite primary key that includes the primary key of the entity on which this entity depends and nonkey attributes.
Free
Short Answer
Q 158Q 158
Match each of the following E-R structures with its relational representation.
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
-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.
Free
Short Answer
Q 159Q 159
Match each of the following E-R structures with its relational representation.
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
-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.
Free
Short Answer
Q 160Q 160
Match each of the following E-R structures with its relational representation.
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
-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.
Free
Short Answer
Q 161Q 161
Match each of the following E-R structures with its relational representation.
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
-Create a relation with primary key and nonkey attributes.
Free
Short Answer
Q 162Q 162
Match each of the following E-R structures with its relational representation.
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
-Place the primary key of either entity in the relation for the other entity or do this for both entities.
Free
Short Answer
Q 163Q 163
Match each of the following file organizations with a corresponding description.(Answers may occur more than once.)
a.indexed file organization
b.hashed file organization
c.sequential file organization
-Referencing storage space,this method has no wasted space.
Free
Short Answer
Q 164Q 164
Match each of the following file organizations with a corresponding description.(Answers may occur more than once.)
a.indexed file organization
b.hashed file organization
c.sequential file organization
-Referencing sequential retrieval on the primary key,this method is impractical.
Free
Short Answer
Q 165Q 165
Match each of the following file organizations with a corresponding description.(Answers may occur more than once.)
a.indexed file organization
b.hashed file organization
c.sequential file organization
-Referencing multiple key retrieval,this method is not possible.
Free
Short Answer
Q 166Q 166
Match each of the following file organizations with a corresponding description.(Answers may occur more than once.)
a.indexed file organization
b.hashed file organization
c.sequential file organization
-Referencing updating rows,this method is easy but requires maintenance of indexes.
Free
Short Answer
Q 167Q 167
Match each of the following file organizations with a corresponding description.(Answers may occur more than once.)
a.indexed file organization
b.hashed file organization
c.sequential file organization
-Referencing random retrieval on primary key,this method is moderately fast.
Free
Short Answer
Q 168Q 168
Define each of the following terms: relation,functional dependency,foreign key,and normalization.
Free
Essay
Free
Essay
Free
Essay
Free
Essay
Free
Essay
Free
Essay
Free
Essay
Q 175Q 175
What is second normal form? What conditions determine if a relation is in second normal form?
Free
Essay
Free
Essay
Q 177Q 177
You have recently been hired by an appliance repair company.Your first task is to normalize the following relation.
Free
Essay