Test Bank for Modern Database Management, 13th Edition, Jeff Hoffer, Ramesh Venkataraman, Heikki Topi ,ISBN: 9780134877006, Chapter 1-14 Complete Guide A+

TEST BANK nn




MODERN DATABASE MANAGEMENT, 13TH EDITION
nn nn nn nn




Jeff Hoffer, Ramesh Venkataraman, Heikki Topi
nn nn nn nn nn

,Modern nnDatabase nnManagement, nn13e nn(Hoffer)
Chapter nn1 n n n n The nnDatabase nnEnvironment nnand nnDevelopment nnProcess

1) According nnto nna nnMcKinsey nnGlobal nnInstitute nnReport, nnin nn2010 nnalone, nnglobal
nnenterprises nnstored nnmore nnthan:

A) 1 nnterabyte nnof nndata.
B) 3 nngigabytes nnof nndata.
C) at nnleast nn 100 nnpetabytes nnof nndata.
D) more nnthan nn7 nnbillion nnexabytes nnof
nndata. nnAnswer: n n D

LO: n n 1.1: nnDefine nnkey
nnterms. nnDifficulty: n n Easy

nnClassification: n n Concept

AACSB: n n Information nnTechnology

2) Database nnmanagement nn involves nnall nnof nnthe nnfollowing nnEXCEPT:
A) collecting nndata.
B) organizing nndata.
C) design nnweb nnpages.
D) managing
nndata. nnAnswer:

n n C

LO: n n 1.1: nnDefine nnkey
nnterms. nnDifficulty: n n Easy

nnClassification: n n Concept

AACSB: n n Information nnTechnology

3) A nndatabase nnis nnan nnorganized nncollection nnof nn related nndata.
A) logically
B) physically
C) loosely
D) badly
nnAnswer:

nnA

LO: n n 1.1: nnDefine nnkey
nnterms. nnDifficulty: n n Easy

nnClassification: n n Concept

AACSB: n n Information nnTechnology

4) Legacy nnsystems nnoften nncontain nndata nnof nn quality nnand nnare nngenerally nnhosted nnon nn .
A) poor; nnpersonal nncomputers
B) excellent; nnmainframes
C) poor; nnmainframes
D) excellent; nnworkgroup
nncomputers nnAnswer: n n C

LO: n n 3.1: nnDefine nnkey
nnterms. nnDifficulty:



1
Copyright nn© nn2019 nnPearson nnEducation,
nnInc.

,n n Moderate nnClassification:
n n Concept

AACSB: n n Information nnTechnology




2
Copyright nn© nn2019 nnPearson nnEducation,
nnInc.

, 5) Program-data nndependence nnis nncaused nnby:
A) file nndescriptions nnbeing nnstored nnin nneach nndatabase nnapplication.
B) data nndescriptions nnbeing nnstored nnon nna nnserver.
C) data nndescriptions nnbeing nnwritten nninto nnprogramming nncode.
D) data nncohabiting nnwith
nnprograms. nnAnswer: n n A

LO: n n 1.2: nnName nnseveral nnlimitations nnof nnconventional nnfile nnprocessing
nnsystems. nnDifficulty: n n Moderate

Classification: n n Concept
AACSB: n n Information nnTechnology

6) Because nnapplications nnare nnoften nndeveloped nnindependently nnin nnfile nnprocessing nnsystems:
A) the nndata nnis nnalways nnnon-redundant.
B) unplanned nnduplicate nndata nnfiles nnare nnthe nnrule nnrather nnthan nnthe nnexception.
C) data nncan nnalways nnbe nnshared nnwith nnothers.
D) there nnis nna nnlarge nnvolume nnof nnfile
nnI/O. nnAnswer: n n B

LO: n n 1.2: nnName nnseveral nnlimitations nnof nnconventional nnfile nnprocessing
nnsystems. nnDifficulty: n n Moderate

Classification: n n Concept
AACSB: n n Information nnTechnology

7) Relational nndatabases nnestablish nnthe nnrelationships nnbetween nnentities nnby nnmeans nnof
nncommon nnfields nnincluded nnin nna nnfile nncalled nna(n):

A) entity.
B) relationship.
C) relation.
D) association.
nnAnswer: n n C

LO: n n 1.3: nnExplain nnat nnleast nn10 nnadvantages nnof nnthe nndatabase nnapproach, nncompared nnto
nntraditional nnfile nnprocessing.

Difficulty: n n Moderate
nnClassification: n n Concept

AACSB: n n Information nnTechnology

8) A(n) nn is nnoften nndeveloped nnby nnidentifying nna nnform nnor nnreport nnthat nna nnuser
nnneeds nnon nna nnregular nnbasis.

A) enterprise nnview
B) reporting nndocument
C) user nnview
D) user
nnsnapshot

nnAnswer: n n C

LO: n n 1.3: nnExplain nnat nnleast nn10 nnadvantages nnof nnthe nndatabase nnapproach, nncompared nnto
nntraditional nnfile nnprocessing.

Difficulty: n n Moderate
nnClassification: n n Concept



3
Copyright nn© nn2019 nnPearson nnEducation,
nnInc.