Multiple Choice Questions

A(n) _____ is the set of possible values for a given attribute.
  • simple
  • Domain
  • solid
  • composite
The Crow's Foot notation easily identifies multi-valued attributes.
  • True
  • False
The conceptual model can handle _____ relationships and multivalued attributes.
  • minimum
  • M:N
  • UML
  • (1,1)
A(n) _____ attribute need not be physically stored within the database.
  • derived
  • required
  • iterative
  • ternary
An entity in the entity relationship model corresponds to a table in the relational environment.
  • True
  • False
The Chen notation identifies a weak entity by using a double-walled entity _____.
  • rectangle
  • recursive
  • optional
  • dashed line
A relationship _____ indicates the number of entities or participants associated with a relationship.
  • existence
  • unary
  • degree
  • False
A(n) _____ attribute is an attribute that must have a value.
  • False
  • iterative
  • required
  • simple
Relationships between entities always operate in one direction.
  • True
  • False
In the entity relationship model, a table row corresponds to an entity instance.
  • True
  • False
A relationship _____ is difficult to establish if only one side of the relationship is known.
  • degree
  • participation
  • classification
  • relationships
Explain recursive relationships with the help of an example.
  • Multi-valued attributes are attributes that can have many values. For instance, a person may have several college degrees, and a household may have several different phones, each with its own number. Similarly, a car's color may be subdivided into many colors for the roof, body, and trim. In the Chen Entity Relationship model, multi-valued attributes are shown by a double line connecting the attribute to the entity.
  • required
  • iterative
  • A recursive relationship is one in which a relationship can exist between occurrences of the same entity set. Such a condition is found within a unary relationship. For example, a 1:M unary relationship can be expressed by "an EMPLOYEE may manage many EMPLOYEEs, and each EMPLOYEE is managed by one EMPLOYEE." Finally, the M:N unary relationship may be expressed by "a COURSE may be a prerequisite to many other COURSEs, and each COURSE may have many other COURSEs as prerequisites."
What is a weak relationship? Provide an example.
  • iterative
  • A weak relationship, also known as a non-identifying relationship, exists if the primary key of the related entity does not contain a primary key component of the parent entity. By default, relationships are established by having the primary key of the parent entity appear as a foreign key (FK) on the related entity (also known as the child entity). For example, suppose the 1:M relationship between COURSE and CLASS is defined as:COURSE (CRS_CODE, DEPT_CODE, CRS_DESCRIPTION, CRS_CREDIT)CLASS (CLASS_CODE, CRS_CODE, CLASS_SECTION, CLASS_TIME, ROOM_CODE, PROF_NUM)In this case, a weak relationship exists between COURSE and CLASS because CRS_CODE (the primary key of the parent entity) is only a foreign key in the CLASS entity. In this example, the CLASS primary key did not inherit a primary key component from the COURSE entity.
  • creating a detailed narrative of the organization's description of operations
  • A recursive relationship is one in which a relationship can exist between occurrences of the same entity set. Such a condition is found within a unary relationship. For example, a 1:M unary relationship can be expressed by "an EMPLOYEE may manage many EMPLOYEEs, and each EMPLOYEE is managed by one EMPLOYEE." Finally, the M:N unary relationship may be expressed by "a COURSE may be a prerequisite to many other COURSEs, and each COURSE may have many other COURSEs as prerequisites."
_____ are characteristics of entities.
  • strong
  • optional
  • attributes
  • required
The Crow's Foot notation is less implementation-oriented than the Chen notation.
  • True
  • False
In organizations that generate large numbers of transactions, _____ processing speeds are often a top priority in database design, which result in minimal access time.
  • True
  • high
  • False
  • entity
If an entity can exist apart from all of its related entities, then it is existence-independent, and it is referred to as a(n) _____ entity
  • existence
  • strong
  • optional
  • True
A _____ entity has a primary key that is partially or totally derived from the parent entity in the relationship.
  • M:N
  • UML
  • weak
  • True
A _____ attribute is one that cannot be subdivided.
  • simple
  • strong
  • Domain
  • False
In the original Chen notation, each attribute is represented by an oval with the attribute name connected to an entity rectangle with a line.
  • True
  • False
A _____ relationship exists when an association is maintained within a single entity.
  • simple
  • unary
  • UML
  • False
A _____ relationship exists when three entities are associated.
  • iterative
  • ternary
  • composite
  • unary
A _____ attribute can be further subdivided to yield additional attributes.
  • required
  • simple
  • composite
  • derived
When the specific cardinalities are not included on the diagram in Crow's Foot notation, cardinality is implied by the use of _____.
  • optional
  • symbols
  • False
  • entity
In the Chen and Crow's Foot notations, an entity is represented with a rectangle containing the entity's name.
  • True
  • False
The entity relationship model (ERM) is dependent on the database type.
  • True
  • False
The Crow's foot symbol with two vertical parallel lines indicates _____ cardinality.
  • solid
  • False
  • (1,1)
  • unary
_____ are underlined in an ER diagram.
  • Identifiers
  • Documentation
  • attributes
  • existence
Referential integrity and participation are both bidirectional, meaning that they must be addressed in both directions along a relationship.
  • True
  • False
_____ not only helps database designers to stay on track during the design process, it also enables them to pick up the design thread when the time comes to modify the design.
  • (min, max)
  • Documentation
  • Cardinality
  • information
Software vendors have adopted the Chen representation because of its compact representation.
  • True
  • False
Connectivities and cardinalities are established by concise statements known as business rules.
  • True
  • False
If an employee within an EMPLOYEE entity has a relationship with itself, that relationship is known as a _____ relationship.
  • rectangle
  • strong
  • recursive
  • primary key
The entity relationship model uses the associative entity to represent a(n) _____ relationship between two or more entities.
  • M:N
  • UML
  • True
  • strong
In organizations that generate large number of transactions, _____ are often a top priority in database design.
  • dashed line
  • relationships
  • high processing speeds
  • recursive
A composite identifier is a primary key composed of more than one attribute.
  • True
  • False
Database design is a(n) _____ process based on repetition.
  • composite
  • iterative
  • Identifiers
  • recursive
Knowing the minimum and maximum number of _____ occurrences is very helpful at the application software level.
  • optional
  • binary
  • entity
  • True
When using the Crow's Foot notation, the associative entity is indicated by _____ relationship lines between the parents and the associative entity.
  • symbols
  • False
  • solid
  • derived
An entity is said to be _____-dependent if it can exist in the database only when it is associated with another related entity occurrence.
  • existence
  • True
  • relationships
  • False
Ideally, an entity identifier is composed of _____ attribute(s).
  • UML
  • True
  • False
  • one
_____ expresses the minimum and maximum number of entity occurrences associated with one occurrence of the related entity.
  • Documentation
  • Cardinality
  • composite
  • optional to
The first step in building an entity-relationship diagram (ERD) is _____.
  • conceptual
  • False
  • creating a detailed narrative of the organization's description of operations
  • primary key
To simplify the conceptual design, most higher-order relationships are decomposed into appropriate equivalent _____ relationships whenever possible.
  • derived
  • ternary
  • binary
  • strong
The decision to store _____ attributes in database tables depends on the processing requirements and the constraints placed on a particular application.
  • minimum
  • recursive
  • derived
  • optional
To implement a small database, a database designer must know the "1" and the "M" sides of each relationship and whether the relationships are mandatory or optional.
  • True
  • False
The existence of a mandatory relationship indicates that the minimum cardinality is 0 or 1 for the mandatory entity.
  • True
  • False
A weak entity must be _____-dependent.
  • strong
  • attributes
  • existence
  • entities
A(n) _____ relationship is also known as an identifying relationship.
  • strong
  • ternary
  • False
  • simple
A derived attribute is indicated in the Chen notation by a _____ that connects the attribute and an entity.
  • single-valued
  • rectangle
  • relationships
  • dashed line
The Crow's Foot notation depicts the strong relationship with a(n) _____ line between the entities.
  • Domain
  • False
  • symbols
  • solid
A person's Social Security number would be an example of a(n) _____ attribute.
  • single-valued
  • iterative
  • rectangle
  • dashed line
0 h : 0 m : 1 s

Multiple Choice Questions
Answered Not Answered Not Visited Correct : 0 Incorrect : 0