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

TESTBANK g




MODERN gDATABASE gMANAGEMENT, g13TH gEDITION
Jeff gHoffer, gRamesh gVenkataraman, gHeikki gTopi

,Modern gDatabase gManagement, g13e g(Hoffer)
Chapter g1 g g The gDatabase gEnvironment gand gDevelopment gProcess

1) According gto ga gMcKinsey gGlobal gInstitute gReport, gin g2010 galone, gglobal genterprises
gstored gmore gthan:

A) 1 gterabyte gof gdata.
B) 3 ggigabytes gof gdata.
C) at gleast g100 gpetabytes gof gdata.
D) more gthan g7 gbillion gexabytes gof
gdata. gAnswer: g D

LO: g 1.1: gDefine gkey gterms.
gDifficulty: g Easy

gClassification: g Concept

AACSB: g Information gTechnology

2) Database gmanagement g involves gall gof gthe gfollowing gEXCEPT:
A) collecting gdata.
B) organizing gdata.
C) design gweb gpages.
D) managing
gdata. gAnswer: g C

LO: g 1.1: gDefine gkey gterms.
gDifficulty: g Easy

gClassification: g Concept

AACSB: g Information gTechnology

3) A gdatabase gis gan gorganized gcollection gof g related gdata.
A) logically
B) physically
C) loosely
D) badly
gAnswer:

gA

LO: g 1.1: gDefine gkey gterms.
gDifficulty: g Easy

gClassification: g Concept

AACSB: g Information gTechnology

4) Legacy gsystems goften gcontain gdata gof g quality gand gare ggenerally ghosted gon g .
A) poor; gpersonal gcomputers
B) excellent; gmainframes
C) poor; gmainframes
D) excellent; gworkgroup
gcomputers gAnswer: g C

LO: g 3.1: gDefine gkey gterms.
gDifficulty: g Moderate

gClassification: g Concept


1
Copyright g© g2019 gPearson gEducation,
gInc.

,AACSB: g Information gTechnology




2
Copyright g© g2019 gPearson gEducation,
gInc.

, 5) Program-data gdependence gis gcaused gby:
A) file gdescriptions gbeing gstored gin geach gdatabase gapplication.
B) data gdescriptions gbeing gstored gon ga gserver.
C) data gdescriptions gbeing gwritten ginto gprogramming gcode.
D) data gcohabiting gwith
gprograms. gAnswer: g A

LO: g 1.2: gName gseveral glimitations gof gconventional gfile gprocessing
gsystems. gDifficulty: g Moderate

Classification: g Concept
AACSB: g Information gTechnology

6) Because gapplications gare goften gdeveloped gindependently gin gfile gprocessing gsystems:
A) the gdata gis galways gnon-redundant.
B) unplanned gduplicate gdata gfiles gare gthe grule grather gthan gthe gexception.
C) data gcan galways gbe gshared gwith gothers.
D) there gis ga glarge gvolume gof gfile
gI/O. gAnswer: g B

LO: g 1.2: gName gseveral glimitations gof gconventional gfile gprocessing
gsystems. gDifficulty: g Moderate

Classification: g Concept
AACSB: g Information gTechnology

7) Relational gdatabases gestablish gthe grelationships gbetween gentities gby gmeans gof gcommon
gfields gincluded gin ga gfile gcalled ga(n):

A) entity.
B) relationship.
C) relation.
D) association.
gAnswer: g C

LO: g 1.3: gExplain gat gleast g10 gadvantages gof gthe gdatabase gapproach, gcompared gto gtraditional gfile
gprocessing.

Difficulty: g Moderate
gClassification: g Concept

AACSB: g Information gTechnology

8) A(n) g is goften gdeveloped gby gidentifying ga gform gor greport gthat ga guser gneeds
gon ga gregular gbasis.

A) enterprise gview
B) reporting gdocument
C) user gview
D) user
gsnapshot

gAnswer: g C

LO: g 1.3: gExplain gat gleast g10 gadvantages gof gthe gdatabase gapproach, gcompared gto gtraditional gfile
gprocessing.

Difficulty: g Moderate
gClassification: g Concept


3
Copyright g© g2019 gPearson gEducation,
gInc.