Quiz 9: Designing Databases

One of the purposes of database design is to choose data storage technologies that will efficiently,accurately,and securely process database activities.

The selection of data storage technologies is made during the systems implementation and operation phase.

The network model is the most common style for a logical database model.

Conceptual modeling is performed during systems design.

Generally speaking,logical and physical database design is performed in parallel with other systems design steps.

Normalization helps build a data model that is simple,not redundant,and requires minimum maintenance.

During logic modeling,the normalized data requirements from all user interfaces are combined into one consolidated logical database model.

The selection of the appropriate storage format for each attribute from the logical database model is made during physical database design.

In general,data structure refers to grouping attributes from the logical database model into physical records.

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.

When using the relational notation,the primary key attribute is indicated by a dashed underline.

The primary deliverable from logical database design is a conceptual model.

A relation corresponds to a computer file.

File and database design occurs in two steps.

The network database model is a popular database technology for new information systems.

Object-oriented database models are the most frequently used database technologies for new information systems development.

Each column in a relation corresponds to an entity type.

Each row of a relation corresponds to a record that contains data values for an entity.

One property of a relation is that entries in a given column are from the same set of values.

Referencing a relation,the sequence of columns cannot be interchanged without changing the meaning or use of the relation.

A well-structured relation contains data about two or more entities.

A relation is said to be in second normal form when its nonprimary key attributes do not depend on each other.

The result of normalization is that every nonprimary key attribute depends upon the whole primary key and nothing but the primary key.

Normalization is based on an analysis of weak entities.

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.

An attribute can be functionally dependent on more than attribute.

A relation is in second normal form if every nonprimary key attribute is functionally dependent on the whole primary key.

A relation is said to be in second normal form if the primary key consists of only one attribute.

Transitive attributes are attributes that determine other attributes.

A relation is said to be in second normal form when there are no transitive dependencies.

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.

A derived field is a field that can be derived from other database fields.

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

A null value is used to represent the zero digit in a relation.

Efficient use of secondary storage and data processing speed are two goals of physical table design.

Generally speaking,a physical table corresponds to a relation.

Denormalization is the process of splitting or combining normalized relations into physical tables based on affinity of use of rows and fields.

Denormalization reduces the chance of errors introduced by normalizing relations.

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

A physical file is a named set of table rows stored in a contiguous section of secondary memory.

Sequential files are practical for random row retrievals.

When using the sequential file organization,the addition of rows requires rewriting the file.

Indexes should be used generously for databases intended primarily to support data retrievals.

Indexes should be used judiciously for databases that support transaction processing and other applications with heavy updating requirements.

Sequential retrieval on the primary key is very fast with the hashed file organization.

Random key retrieval on the primary key is comparatively slow with the hashed file organization.

File restoration can be achieved through backup copies of a file,audit trails,and row image files.

Multiple key retrieval is possible with the hashed file organization.

Data security can be built into a file through encryption,passwords,or prohibiting users from directly manipulating a file.

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.

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.

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

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

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.

Combining all normalized user views into one consolidated logical database model refers to: A)requirements structuring B)view integration C)normalization D)file integration

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

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

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

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

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

A named two-dimensional table of data is a: A)network B)tree structure C)relation D)tuple

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.

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

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.

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

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

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

A particular relationship between two attributes best defines: A)context B)functional dependency C)normal form D)structure

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

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

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

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

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

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.

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

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

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.

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

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

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

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

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

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

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

Relationships between instances of a single entity type are referred to as: A)binary relationships B)transitive relationships C)recursive relationships D)dependent relationships

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

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

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

"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

Merging relations is also referred to as: A)view integration B)view consolidation C)encompassing D)normalizing

Two different names that refer to the same data item best defines: A)homonym B)synonym C)transitive dependency D)alias

A single name that is used for two or more different attributes best defines: A)homonym B)synonym C)transitive dependency D)alias

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

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

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

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

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

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

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

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

A __________ is an attribute whose value is unique across all occurrences of a relation.

A __________ represents data as a set of related tables or relations.

A __________ is a named,two-dimensional table of data.

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.

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

__________ refers to a particular relationship between two attributes.

A relation is in __________ if every nonprimary key attribute is functionally dependent on the whole primary key.

A relation is in __________ if it is in second normal form and there are no functional dependencies between two (or more)nonprimary key attributes.

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.

__________ 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.

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

__________ refers to two different names that are used for the same attribute.

__________ is a single attribute name that is used for two or more different attributes.

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

A __________ is a coding scheme recognized by system software for representing organizational data.

A __________ is a field that can be derived from other database fields.

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

__________ 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.

A __________ is a named set of rows and columns that specifies the fields in each row of the table.

__________ is the process of splitting or combining normalized relations into physical tables based on affinity of use of rows and fields.

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

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

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

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

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

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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

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

Identify the five properties of a relation.

Discuss the rules for normalization.

Briefly identify the three file organizations.

Identify several advantages and disadvantages of using an index.

What are the four key physical database design decisions you will make?

What is second normal form? What conditions determine if a relation is in second normal form?

How is a binary one-to-one relationship represented?

You have recently been hired by an appliance repair company.Your first task is to normalize the following relation.