MIS 3140 FINAL EXAM WITH COMPLETE SOLUTIONS 100%
VERIFIED LATEST @ 2025
Logical view of data - ANSWER - You can think of a table as a persistent representation
of a logical relation. TRUE
- Relational model: view data logically rather than physically
composite key: If the attribute (B) is functionally dependent on a composite key (A) but
not on any subset of that composite key, the attribute (B) is fully functionally dependent
on - ANSWER TRUE
Each table in a relational database must have a primary key. - ANSWER TRUE
A foreign key must exist in both tables that have a relationship - ANSWER FALSE
Because a primary key must be unique, no null values are allowed if entity integrity is to
be maintained. - ANSWER TRUE
Keys are central to the use of relational tables - ANSWER TRUE
Candidate key - ANSWER A super key without unnecessary attributes
Super Key - ANSWER Any key that uniquely identifies each row
Tables must have the same attribute characteristics (the columns and domains must be
compatible) to be used in a UNION - ANSWER TRUE
,The SELECT operator yields a vertical subset of a table. - ANSWER FALSE it yields
horizontal
UNION ALL - ANSWER ADD BOTH TABLES
PRODUCT - ANSWER Yields all possible pairs of rows from two tables
project - ANSWER yields all values for selected attributes, its a unary operator, and
yields a vertical subset of a table
intersect - ANSWER rows that appear in both tables and must be union-compatible
The _____ relational type is the "relational model ideal." - ANSWER 1:M
Are rare as 1:1 relationships should be, certain conditions absolutely require their use -
ANSWER TRUE
this relationship cannot be implemented as such in the relational model and can be
changed into 1:M relationships - ANSWER M:N
data redundancy - ANSWER - leads to data anomalies; can destroy the effectiveness of
the data
- Control data redundancies by using common attributes shared by tables
- Foreign keys are crucial to exercising data redundancy control
- Sometimes data redundancy is necessary
, Indexes - ANSWER - An index is an orderly arrangement used to logically access rows
in a table.
- Index key: index's reference point, points to data location identified by the key
- Unique index: index in which the index key can have only one pointer value (row)
associated with it
- Each index is associated with only one table
Data dictionary - ANSWER - Each time you create a new table within the database, the
RDBMS updates the data dictionary, thereby providing the database documentation.
- The data dictionary provides a detailed description of all tables in the database
created by the user and designer.
- Contains (at least) all the attribute names and characteristics for each table in the
system
- A data dictionary contains metadata-data about data.
ideally a primary key is composed of several attributes - ANSWER FALSE
The set of possible values for an attribute is a ____ - ANSWER DOMAIN
Attributes have a domain that specifies the data type of the attribute - ANSWER FALSE
A composite identifier is a primary key composed of more than one attribute -
ANSWER TRUE
VERIFIED LATEST @ 2025
Logical view of data - ANSWER - You can think of a table as a persistent representation
of a logical relation. TRUE
- Relational model: view data logically rather than physically
composite key: If the attribute (B) is functionally dependent on a composite key (A) but
not on any subset of that composite key, the attribute (B) is fully functionally dependent
on - ANSWER TRUE
Each table in a relational database must have a primary key. - ANSWER TRUE
A foreign key must exist in both tables that have a relationship - ANSWER FALSE
Because a primary key must be unique, no null values are allowed if entity integrity is to
be maintained. - ANSWER TRUE
Keys are central to the use of relational tables - ANSWER TRUE
Candidate key - ANSWER A super key without unnecessary attributes
Super Key - ANSWER Any key that uniquely identifies each row
Tables must have the same attribute characteristics (the columns and domains must be
compatible) to be used in a UNION - ANSWER TRUE
,The SELECT operator yields a vertical subset of a table. - ANSWER FALSE it yields
horizontal
UNION ALL - ANSWER ADD BOTH TABLES
PRODUCT - ANSWER Yields all possible pairs of rows from two tables
project - ANSWER yields all values for selected attributes, its a unary operator, and
yields a vertical subset of a table
intersect - ANSWER rows that appear in both tables and must be union-compatible
The _____ relational type is the "relational model ideal." - ANSWER 1:M
Are rare as 1:1 relationships should be, certain conditions absolutely require their use -
ANSWER TRUE
this relationship cannot be implemented as such in the relational model and can be
changed into 1:M relationships - ANSWER M:N
data redundancy - ANSWER - leads to data anomalies; can destroy the effectiveness of
the data
- Control data redundancies by using common attributes shared by tables
- Foreign keys are crucial to exercising data redundancy control
- Sometimes data redundancy is necessary
, Indexes - ANSWER - An index is an orderly arrangement used to logically access rows
in a table.
- Index key: index's reference point, points to data location identified by the key
- Unique index: index in which the index key can have only one pointer value (row)
associated with it
- Each index is associated with only one table
Data dictionary - ANSWER - Each time you create a new table within the database, the
RDBMS updates the data dictionary, thereby providing the database documentation.
- The data dictionary provides a detailed description of all tables in the database
created by the user and designer.
- Contains (at least) all the attribute names and characteristics for each table in the
system
- A data dictionary contains metadata-data about data.
ideally a primary key is composed of several attributes - ANSWER FALSE
The set of possible values for an attribute is a ____ - ANSWER DOMAIN
Attributes have a domain that specifies the data type of the attribute - ANSWER FALSE
A composite identifier is a primary key composed of more than one attribute -
ANSWER TRUE
