A relationship attribute of a 1:N relationship can be assigned to the entity on the 1 side of that relationship, and the ER diagram would still have the same meaning.
FALSE
2
New cards
Every ER notation uses the same rule for placement of cardinality constraints in the relationships of the ER diagram.
False
3
New cards
A weak entity that has a 1:M identifying relationship with its owner must have a partial key.
True
4
New cards
The following attribute represents a collection of attributes:
Composite attribute
5
New cards
A unary relationship cannot have mandatory participation on both sides.
False
6
New cards
Maximum cardinality can be optional.
False
7
New cards
A relationship attribute of a 1:N relationship can be assigned to the entity on the N side of that relationship, and the ER diagram would still have the same meaning.
TRUE
8
New cards
An M:N relationship that can have multiple occurrences between the same instances of involved entities can be depicted as a:
Weak entity
9
New cards
Exact maximum cardinality is calculated by adding the exact minimum cardinalities.
False
10
New cards
An associative entity is used as an alternative way of depicting:
M:N relationships
11
New cards
ER modeling is a widely used logical database modeling method.
False
12
New cards
Which of the following is a legitimate exact minimum and maximum cardinality?
(5, 10)
13
New cards
Components of a unique composite attribute are not unique.
True
14
New cards
A unary relationship can have one or many maximum cardinalities on either side.
True
15
New cards
What type of ternary relationship CANNOT be depicted as two binary relationships?
Many-to-many-to-many
16
New cards
A regular entity must have at least one of the following attributes:
Unique attribute
17
New cards
Which of the following is NOT a possible cardinality constraint?
Optional zero
18
New cards
Two entities can be related via multiple different binary relationships.
True
19
New cards
How many entities are involved in a binary relationship?
2
20
New cards
A relationship attribute of a M:N relationship can be assigned to either of the entities involved in that relationship, and the ER diagram would still have the same meaning.
FALSE
21
New cards
What is depicted by ER Diagrams?
Metadata only
22
New cards
How many entities are depicted by the following requirements? \n School XYZ keeps track of its 100 students, 10 teachers, and 5 classrooms.
3
23
New cards
How many entities are involved in a unary relationship?
1
24
New cards
A weak entity that has a 1:1 identifying relationship with its owner, must have a partial key.
False
25
New cards
Adding a unique attribute to a weak entity converts the weak entity to a regular entity.
True
26
New cards
An optional attribute occurs only in an entity that is involved in a relationship with optional participation.
False
27
New cards
Relationship instances occur when an instance of one entity is related to an instance of another entity via a relationship.
True
28
New cards
A ternary relationship can always be depicted as three binary relationships.
False
29
New cards
Entity instances are depicted in ER diagrams.
False
30
New cards
Each instance of a weak entity must participate in exactly one instance of the identifying relationship.
True
31
New cards
In an ER diagram, each entity is always connected to all of the other entities, either via a direct relationship or indirectly via other entities and relationships.
True
32
New cards
The values of the following attribute are NOT permanently stored in a database.
Derived attribute
33
New cards
Minimum cardinality can be many.
False
34
New cards
Which of the following is a possible type of relationship (maximum cardinality-wise)?
One-to-one
35
New cards
The following attribute can contain more than one value for each entity instance.
Multivalued attribute
36
New cards
A relationship of degree 3 (also known as a ternary relationship) depicts 3 entities involved in one relationship.
TRUE
37
New cards
Relationship attributes may be necessary in a relationship of what type?
Many-to-many
38
New cards
Maximum cardinality can be:
One or many
39
New cards
Within one entity, each attribute name must be different.
True
40
New cards
Within an ER diagram that contains multiple entities, each entity must be related to at least one other entity via a relationship.
True
41
New cards
Minimum cardinality can be:
Optional or mandatory
42
New cards
A unique attribute is an attribute whose value is different for each entity instance.
TRUE
43
New cards
A multivalued composite attribute can be used to depict which of the following weak entity concepts?
Identifying relationship
44
New cards
An attribute can be a part of several composite attributes.
True
45
New cards
If an M:N relationship is mandatory on one side and optional on the other side, and if both relations resulting from the entities involved in the relationship each have 3 records, then the resulting bridge relation CANNOT have less than \n
3
46
New cards
Two columns of a relational table can have the same values. \n
TRUE
47
New cards
Which of the following is NOT true? In a relational database: \n
Two tables, in the same database, can have the same name
48
New cards
Every attribute appears only once in an ER diagram \n
True
49
New cards
An ER diagram that contains two entities involved in two separate M:N relationships will be mapped as how many relations?
4
50
New cards
\n A relation resulting from a weak entity has a non-composite primary key when the identifying relationship is:
1:1
51
New cards
If an M:N relationship is mandatory on both sides, and if both relations resulting from the entities involved in the relationship each have 3 records, then the resulting bridge relation CANNOT have less than
3
52
New cards
Within one relation, two rows can be identical.
False
53
New cards
Two columns of two different tables in the same relational database can have the same names.
True
54
New cards
Two columns of a relational table can have the same names.
False
55
New cards
When an entity has multiple unique attributes, each one of them is mapped as a primary key of the resulting relation.
False
56
New cards
A foreign key column must have the same name as the primary key column it refers to.
False
57
New cards
\n Autonumber data type option:
Enables automatic generation of consecutive numeric data values in a column
58
New cards
An entity and its 1:1 unary relationship are mapped as one relation.
True
59
New cards
A relational schema is a visual depiction of the relational database model.
True
60
New cards
\n If a 1:M relationship is optional on both sides, which of the following is true?
The resulting foreign key can have null (empty) values
61
New cards
If an entity has three unique attributes, how many primary keys will its mapped relation have?
1
62
New cards
If in one of two identical relational tables the first row is moved to the last place, those two relational tables are no longer identical.
False
63
New cards
Tuple is a synonym for
Row
64
New cards
The relation resulting from mapping a weak entity (with a 1:M identifying relationship) has a composite primary key that is composed of the partial identifier and a foreign key corresponding to the primary key of the owner entity.
True
65
New cards
If a 1:M relationship is mandatory on the 1 side and optional on the M side, which of the following is true?
The resulting foreign key cannot have null (empty) values
66
New cards
If an M:N relationship is optional on both sides, and if both relations resulting from the entities involved in the relationship each have 3 records, then the resulting bridge relation CANNOT have less than \________ records. \n
0 (no records required)
67
New cards
A restriction specifying that no salary entered in the salary column can be higher than $300,000 is an example of a business rule.
True
68
New cards
If a 1:M relationship is mandatory on both sides, which of the following is true? \n
The resulting foreign key cannot have null (empty) values
69
New cards
An entity and its M:N unary relationship are mapped as one relation.
False
70
New cards
Relation is a synonym for the following construct in a relational database
\n Table
71
New cards
If in one of two identical relational tables the last column moved to the first place, those two relational tables are no longer identical. \n
False
72
New cards
If a 1:M relationship is mandatory on the M side and optional on the 1 side, and if the table resulting from the 1 side has 3 records, then the table resulting from the M side CANNOT have less than \________ records. \n
3 \n
73
New cards
Within one column, one row of a relation can contain two values from that column's domain.
False
74
New cards
For each employee, middle initial is optional is an example of an implicit database constraint.
False
75
New cards
What is depicted by relational schemas?
Metadata only \n
76
New cards
If a 1:M relationship is optional on the 1 side and mandatory on the M side, which of the following is true? \n
The resulting foreign key can have null (empty) values
77
New cards
If a 1:M relationship is optional on the M side and mandatory on the 1 side, and if the table resulting from the 1 side has 3 records, then the table resulting from the M side CANNOT have less than \________ records.
0 (no records required)
78
New cards
An entity in an ERD that contains two multivalued attributes will result in how many relations when mapped into a relational schema?
3
79
New cards
Which of the following is true? In a relational table: \n
Two columns can have identical values (i.e. same values in each row of those two columns)
80
New cards
An optional attribute of an entity is not mapped as a column of a relation.
False
81
New cards
A bridge relation is a result of mapping an M:N relationship.
True
82
New cards
If a 1:M relationship is optional on both sides, and if the table resulting from the 1 side has 3 records, then the table resulting from the M side CANNOT have less than \________ records. \n
\n 0 (no records required)
83
New cards
If a 1:M relationship is mandatory on both sides, and if the table resulting from the 1 side has 3 records, then the table resulting from the M side CANNOT have less than \________ records. \n
3
84
New cards
Which of the following is NOT true? Mapping a binary M:N relationship will result in:
A foreign key in both of the relations mapped from the involved entities
85
New cards
An entity and its 1:M unary relationship are mapped as one relation. \n
true
86
New cards
Which of the following statements regarding the table below is true? \n ColumnAColumnBColumnC
Every combination of values in Column A and Column B within the same row is unique
87
New cards
Each weak entity has exactly one owner entity.
False
88
New cards
If P --\> Q and Q --\> P are existing functional dependencies, which of the following are equivalent functional dependencies?
none of the above
89
New cards
If A, B, C, and D are columns of the table whose composite primary key is A, B while C and D are nonkey columns then B --\> D would be a transitive functional dependency.
False
90
New cards
Normalizing table FLIGHT to 3NF will result in:
Two separate tables
91
New cards
Which of the following is in danger of being affected by the deletion anomaly in the table ENROLLMENT (with its current 3 records)?
Major H, History (WRONG)
92
New cards
An insertion anomaly occurs when a user who wants to insert data about one real world entity is forced to enter a unique value about it.
False
93
New cards
Which of the following actions in the table ENROLLMENT will be prevented by an insertion anomaly?
Entering a new major M, Math
94
New cards
Every 3NF database can be further streamlined by including designer-added tables and keys.
False
95
New cards
Every relation contains:
Full key functional dependency
96
New cards
Which of the following (regarding the relation ENROLLMENT) represents the modification anomaly?
If a major name changes, it may have to be changed in more than one record
97
New cards
What type of functional dependency does NOT exist in the table ENROLLMENT?
Partial
98
New cards
Table FLIGHT is:
In 1NF but not in 2NF
99
New cards
A nonkey column is a column in a relation that is not a primary or a candidate key column.
True
100
New cards
Update operations are also referred to as read \n operations.