Database Systems Design Implementation And Management 12Th Edition by Carlos Coronel -Test Bank
To Purchase
this Complete Test Bank with Answers Click the link Below
If face any problem or
Further information contact us At tbzuiqe@gmail.com
Sample
Test
CHAPTER 3: THE RELATIONAL DATABASE MODEL
1.
The practical significance of taking the logical
view of a database is that it serves as a reminder of the simple file concept
of data storage.
a.
True
b.
False
ANSWER: True
PTS:
1
DIF: Difficulty:
Moderate
REF: p.73
NAT: BUSPROG: Analytic
STATE: DISC: Information Technology
KEY: Bloom’s:Comprehension
TOP: A Logical View of Data
2.
You can think of a table as a persistent
representation of a logical relation.
a.
True
b.
False
ANSWER: True
PTS: 1
DIF: Difficulty: Easy
REF. p.74
NAT: BUSPROG:
Technology
STATE: DISC: Information Technology
KEY:
Bloom’s:Knowledge
TOP: A Logical View of Data
3.
The order of the rows and columns is important to
the DBMS.
a.
True
b.
False
ANSWER: False
PTS:
1
DIF: Difficulty:
Easy
REF: p.74
NAT: BUSPROG: Technology
STATE: DISC: Information Technology
KEY: Bloom’s:
Knowledge
TOP: A Logical View of Data
4.
Character data can contain any character or symbol
intended for mathematical manipulation.
a.
True
b.
False
ANSWER: False
PTS:
1
DIF: Difficulty:
Easy
REF: p.75
NAT: BUSPROG: Technology
STATE: DISC: Information Technology
KEY:
Bloom’s:Knowledge
TOP: A Logical View of Data
5.
The row’s range of permissible values is known as
its domain.
a.
True
b.
False
ANSWER: False
PTS:
1
DIF: Difficulty: Easy
REF: p.75
NAT: BUSPROG: Technology
STATE: DISC: Information Technology
KEY: Bloom’s
Knowledge
TOP: A Logical View of Data
6.
The idea of determination is unique to the database
environment.
a.
True
b.
False
ANSWER: False
PTS:
1
DIF: Difficulty: Moderate
REF: p.76
NAT: BUSPROG:
Analytic
STATE: DISC: Information Technology
KEY: Bloom’s Comprehension
TOP: Keys
7.
Only a single attribute, not multiple attributes,
can define functional dependence.
a.
True
b.
False
ANSWER: False
PTS:
1
DIF: Difficulty:
Easy
REF: p.76
NAT: BUSPROG: Technology
STATE: DISC: Information Technology
KEY:
Bloom’s:Knowledge
TOP: Keys
8.
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 (A).
a.
True
b.
False
ANSWER: True
PTS:
1
DIF: Difficulty:
Moderate
REF: p.77
NAT: BUSPROG:
Analytic
STATE: DISC: Information Technology
KEY: Bloom’s Comprehension
TOP: Keys
9.
A null is created when you press the Enter key or
the Tab key to move to the next entry without making a prior entry of any kind.
a.
True
b.
False
ANSWER: True
PTS:
1
DIF: Difficulty: Easy
REF: p.78
NAT: BUSPROG: Technology
STATE: DISC: Information Technology
KEY:
Bloom’s:Knowledge
TOP: Keys
10. Depending on the sophistication of the application development software,
nulls can create problems when functions such as COUNT, AVERAGE, and SUM are
used.
a.
True
b.
False
ANSWER: True
PTS:
1
DIF: Difficulty: Easy
REF: p.78
NAT: BUSPROG: Technology
STATE: DISC: Information Technology
KEY:
Bloom’s:Knowledge
TOP: Keys
11. RDBMSs enforce integrity rules automatically.
a.
True
b.
False
ANSWER: True
PTS:
1
DIF: Difficulty: Easy
REF: p.80
NAT: BUSPROG: Technology
STATE: DISC: Information Technology
KEY: Bloom’s:
Knowledge
TOP: Integrity Rules
12. Relational algebra defines the theoretical way of manipulating table
contents using relational operators.
a.
True
b.
False
ANSWER: True
PTS:
1
DIF: Difficulty: Easy
REF: p.82
NAT: BUSPROG: Technology
STATE: DISC: Information Technology
KEY:
Bloom’s:Knowledge
TOP: Relational Algebra
13. The SELECT operator yields a vertical subset of a table.
a.
True
b.
False
ANSWER: False
PTS:
1
DIF: Difficulty: Easy
REF: p.83
NAT: BUSPROG: Technology
STATE: DISC: Information Technology
KEY: Bloom’s: Knowledge
TOP:
Relational Algebra
14. The DIFFERENCE operator subtracts one table from the other.
a.
True
b.
False
ANSWER: True
PTS:
1
DIF: Difficulty:
Easy
REF: p.85
NAT: BUSPROG: Technology
STATE: DISC: Information Technology
KEY: Bloom’s: Knowledge
TOP:
Relational Algebra
15. In a natural join, the column on which the join was made occurs twice in
the new table.
a.
True
b.
False
ANSWER: False
PTS:
1
DIF: Difficulty:
Easy
REF: p.88
NAT: BUSPROG: Technology
STATE: DISC: Information Technology
KEY: Bloom’s:Knowledge
TOP: Relational Algebra
16. The DIVIDE operation uses one singlecolumn table (e.g., column “a”) as
the divisor and one twocolumn table (e.g., columns “a” and “b”) as the
dividend.
a.
True
b.
False
ANSWER: True
PTS: 1
DIF: Difficulty: Easy
REF: p.90
NAT: BUSPROG: Technology
STATE: DISC: Information Technology
KEY:
Bloom’s:Knowledge
TOP: Relational Algebra
17. A data dictionary is sometimes described as “the database designer’s
database” because it records the design
decisions about tables and their structures.
1.
True
2.
False
ANSWER: True
PTS: 1
DIF: Difficulty:
Easy
REF: p.91
NAT: BUSPROG:
Technology
STATE: DISC: Information Technology
KEY: Bloom’s: Knowledge
TOP: The Data Dictionary and the
System Catalog
18. The onetomany (1:M) relationship is easily implemented in the
relational model by putting the foreign key of the “1” side in the table of the
“many” side as a primary key.
a.
True
b.
False
ANSWER: False
PTS: 1
DIF: Difficulty:
Moderate
REF:
p.94
NAT: BUSPROG:
Analytic
STATE: DISC: Information Technology
KEY: Bloom’s Comprehension
TOP: Relationships within the
Relational Database
19. As rare as 1:1 relationships should be, certain conditions absolutely
require their use.
a.
True
b.
False
ANSWER: True
PTS:
1
DIF: Difficulty:
Easy
REF: p.96
NAT: BUSPROG:
Technology STATE:
DISC: Information Technology
KEY: Bloom’s: Knowledge
TOP: Relationships within the
Relational Database
20. Each table in a relational database must have a primary key.
a.
True
b.
False
ANSWER: True
PTS:
1
DIF: Difficulty: Easy
REF: p.20
NAT: BUSPROG: Technology
STATE: DISC: Information Technology
KEY: Bloom’s: Knowledge
TOP: A
Logical View of Data
21. __ logic, used extensively in mathematics, provides a
framework in which an assertion (statement of fact) canbe verified as either
true or false.
a.
Predicate Database
b.
Relational d. Index
ANSWER: a
PTS:
1
DIF: Difficulty:
Easy
REF: p.73
NAT: BUSPROG: Technology
STATE: DISC: Information Technology
KEY: Bloom’s:
Knowledge
TOP: A Logical View of Data
22. Each table represents an attribute.
a.
column row
b.
dimension d. value
ANSWER: a
PTS:
1
DIF: Difficulty:
Easy
REF: p.74
NAT: BUSPROG: Technology
STATE: DISC: Information Technology
KEY:
Bloom’s:Knowledge
TOP: A Logical View of Data
23. Date attributes contain calendar dates stored in a special format known
as the date format.
a.
Epoch calendar
b.
Julian d. logical
ANSWER: c
PTS:
1
DIF: Difficulty: Easy
REF: p.75
NAT: BUSPROG: Technology
STATE: DISC: Information Technology
KEY: Bloom’s:
Knowledge
TOP: A Logical View of Data
24. In the relational model, are important because they are used
to ensure that each row in a table is uniquelyidentifiable.
a.
relations keys
b.
indexes d. logical structures
ANSWER: b
PTS: 1
DIF: Difficulty:
Easy
REF: p.76
NAT: BUSPROG: Technology
STATE: DISC: Information Technology
KEY:
Bloom’s:Knowledge
TOP: Keys
25. A is any key that uniquely identifies each row.
a.
superkey special key
b.
foreign key d. candidate key
ANSWER: a
PTS:
1
DIF: Difficulty:
Easy
REF: p.77
NAT: BUSPROG: Technology
STATE: DISC: Information Technology
KEY:
Bloom’s:Knowledge
TOP: Keys
26. A key can be described as a minimal superkey, a superkey
without any unnecessary attributes.
a.
secondary candidate
b.
primary d. foreign
ANSWER: b
PTS:
1
DIF: Difficulty: Easy
REF: p.78
NAT: BUSPROG: Technology
STATE: DISC: Information Technology
KEY: Bloom’s:Knowledge
TOP:
Keys
27. A is the primary key of one table that has been placed into
another table to create a common attribute.
a.
superkey composite primary key
b.
candidate key d. foreign key
ANSWER: d
PTS: 1
DIF: Difficulty:
Easy
REF: p.79
NAT: BUSPROG: Technology
STATE: DISC: Information Technology
KEY: Bloom’s:Knowledge
TOP: Keys
28. A key is defined as a key that is used strictly for data
retrieval purposes.
a.
lookup foreign
b.
candidate d. secondary
ANSWER: d
PTS:
1
DIF: Difficulty: Easy
REF: p.79
NAT: BUSPROG: Technology
STATE: DISC: Information Technology
KEY:
Bloom’s:Knowledge
TOP: Keys
29. Referential dictates that the foreign key must contain
values that match the primary key in the related table,or must contain null.
a.
integrity uniqueness
b.
model d. attribute
ANSWER: a
PTS:
1
DIF: Difficulty:
Easy
REF: p.79
NAT: BUSPROG: Technology
STATE: DISC: Information Technology
KEY: Bloom’s:
Knowledge
TOP: Keys
30. The CUSTOMER table’s primary key is CUS_CODE. The CUSTOMER primary key
column has no null entries, and all entries are unique. This is an example of
a.
entity referential
b.
relational d. null
ANSWER: a
PTS:
1
DIF: Difficulty:
Moderate
REF: p.81
NAT: BUSPROG:
Analytic
STATE: DISC: Information Technology
KEY: Bloom’s: Comprehension
TOP: Keys
31. The constraint can be placed on a column to ensure that
every row in the table has a value for that column.
a.
UNIQUE NOT NULL
b.
VALUE d. EMPTY
ANSWER: b
PTS:
1
DIF: Difficulty:
Easy
REF: p.81
NAT: BUSPROG: Technology
STATE: DISC: Information Technology
KEY: Bloom’s:
Knowledge
TOP: Keys
32. To be considered minimally relational, the DBMS must support the key
relational operators , PROJECT, andJOIN.
a.
INTERSECT UNION
b.
DIFFERENCE d. SELECT
ANSWER: d
PTS:
1
DIF: Difficulty:
Easy
REF: p.82
NAT: BUSPROG: Technology
STATE: DISC: Information Technology
KEY: Bloom’s:
Knowledge
TOP: Relational Algebra
33. __ , also known as RESTRICT, yields values for all
rows found in a table that satisfy a given condition.
a.
INTERSECT UNION
b.
DIFFERENCE d. SELECT
ANSWER: d
PTS:
1
DIF: Difficulty:
Easy
REF: p.83
NAT: BUSPROG: Technology
STATE: DISC: Information Technology
KEY: Bloom’s:
Knowledge
TOP: Relational Algebra
34. __ returns only the attributes requested, in the order
in which they are requested.
a.
PROJECT SELECT
b.
UNION d. DIFFERENCE
ANSWER: a
PTS: 1
DIF: Difficulty:
Easy
REF: p.83
NAT: BUSPROG: Technology
STATE: DISC: Information Technology
KEY: Bloom’s:
Knowledge
TOP: Relational Algebra
35. When two or more tables share the same number of columns, and when their
corresponding columns share the sameor compatible domains, they are said to be .
a.
intersect-compatible union-compatible
b.
difference-compatible d. select-compatible
ANSWER: b
PTS:
1
DIF: Difficulty:
Easy
REF: p.84
NAT: BUSPROG: Technology
STATE: DISC: Information Technology
KEY: Bloom’s: Knowledge
TOP: Relational Algebra
Comments
Post a Comment