MODERN DATABASE MANAGEMENT, 13TH EDITION
i i i i
Jeff Hoffer, Ramesh Venkataraman, Heikki Topi
i i i i i
,Modern iDatabase iManagement, i13e i(Hoffer)
Chapter i1 i i The iDatabase iEnvironment iand iDevelopment iProcess
1) According ito ia iMcKinsey iGlobal iInstitute iReport, iin i2010 ialone, iglobal ienterprises
istored imore ithan:
A) 1 iterabyte iof idata.
B) 3 igigabytes iof idata.
C) at ileast i100 ipetabytes iof idata.
D) more ithan i7 ibillion iexabytes iof idata.
iAnswer: i D
LO: i 1.1: iDefine ikey iterms.
iDifficulty: i Easy
iClassification: i Concept
AACSB: i Information iTechnology
2) Database imanagement iinvolves iall iof ithe ifollowing iEXCEPT:
A) collecting idata.
B) organizing idata.
C) design iweb ipages.
D) managing idata.
iAnswer: i C
LO: i 1.1: iDefine ikey iterms.
iDifficulty: i Easy
iClassification: i Concept
AACSB: i Information iTechnology
3) A idatabase iis ian iorganized icollection iof i related idata.
A) logically
B) physically
C) loosely
D) badly
iAnswer:
iA
LO: i 1.1: iDefine ikey iterms.
iDifficulty: i Easy
iClassification: i Concept
AACSB: i Information iTechnology
4) Legacy isystems ioften icontain idata iof i quality iand iare igenerally ihosted ion i .
A) poor; ipersonal icomputers
B) excellent; imainframes
C) poor; imainframes
D) excellent; iworkgroup icomputers
iAnswer: i C
LO: i 3.1: iDefine ikey iterms.
iDifficulty: i Moderate
iClassification: i Concept
1
Copyright i© i2019 iPearson iEducation, iInc.
,AACSB: i Information iTechnology
2
Copyright i© i2019 iPearson iEducation, iInc.
, 5) Program-data idependence iis icaused iby:
A) file idescriptions ibeing istored iin ieach idatabase iapplication.
B) data idescriptions ibeing istored ion ia iserver.
C) data idescriptions ibeing iwritten iinto iprogramming icode.
D) data icohabiting iwith iprograms.
iAnswer: i A
LO: i 1.2: iName iseveral ilimitations iof iconventional ifile iprocessing
isystems. iDifficulty: i Moderate
Classification: i Concept
AACSB: i Information iTechnology
6) Because iapplications iare ioften ideveloped iindependently iin ifile iprocessing isystems:
A) the idata iis ialways inon-redundant.
B) unplanned iduplicate idata ifiles iare ithe irule irather ithan ithe iexception.
C) data ican ialways ibe ishared iwith iothers.
D) there iis ia ilarge ivolume iof ifile iI/O.
iAnswer: i B
LO: i 1.2: iName iseveral ilimitations iof iconventional ifile iprocessing isystems.
iDifficulty: i Moderate
Classification: i Concept
AACSB: i Information iTechnology
7) Relational idatabases iestablish ithe irelationships ibetween ientities iby imeans iof icommon
ifields iincluded iin ia ifile icalled ia(n):
A) entity.
B) relationship.
C) relation.
D) association.
iAnswer: i C
LO: i 1.3: iExplain iat ileast i10 iadvantages iof ithe idatabase iapproach, icompared ito itraditional ifile
iprocessing.
Difficulty: i Moderate
iClassification: i Concept
AACSB: i Information iTechnology
8) A(n) i is ioften ideveloped iby iidentifying ia iform ior ireport ithat ia iuser ineeds ion
ia iregular ibasis.
A) enterprise iview
B) reporting idocument
C) user iview
D) user isnapshot
iAnswer: i C
LO: i 1.3: iExplain iat ileast i10 iadvantages iof ithe idatabase iapproach, icompared ito itraditional ifile
iprocessing.
Difficulty: i Moderate
iClassification: i Concept
AACSB: i Information iTechnology
3
Copyright i© i2019 iPearson iEducation, iInc.