bygshilp_dg
AC14/AT11
DatabasegManagementgSystems
TYPICALgQUESTIONSg&gANSWERS
PARTg-I
OBJECTIVEgTYPEgQUESTIONS
EachgQuestiongcarriesg2gmarks.
Choosethegcorrectgorgthegbestgalternativegingthegfollowing:
Q.1
Whichgofgthegfollowinggrelationalgalgebragoperationsgdognotgrequiregthegparticipatinggtablesgtogbegu
nion-compatible?
(A)gUnion
(B)gIntersection
(C)gDifference
(D)gJoin
Ans:g(D)
Q.2
Whichgofgthegfollowinggisgnotgagpropertygofgtransactions?
(A)gAtomicity
(B)gConcurrency
(C)gIsolation
(D)gDurability
Ans:g(B)
Q.3
RelationalgAlgebragdoesgnotghave
(A)gSelectiongoperator.
(C)gAggregationgoperators.
,(B)gProjectiongoperator.
(D)gDivisiongoperator.
Ans:g(Cg)
Q.4
Checkpointsgaregagpartgof
(A)gRecoverygmeasures.
(Cg)gConcurrencygmeasures.
(B)gSecuritygmeasures.
(D)gAuthorizationgmeasures.
Ans:g(A)
Q.5
Treegstructuresgaregusedgtogstoregdatagin
(A)gNetworkgmodel.
(B)gRelationalgmodel.
(C)gHierarchicalgmodel.
(D)gFilegbasedgsystem.
Ans:g(Cg)
Q.6
Theglanguagegthatgrequiresgagusergtogspecifygthegdatagtogbegretrievedgwithoutgspecifyinggexactlygh
owgtoggetgitgis
(A)gProceduralgDML.
(B)gNon-ProceduralgDML.
(C)gProceduralgDDL.
(D)gNon-ProceduralgDDL.
Ans:g(B)
Q.7
Precedenceggraphsghelpgtogfindga
1
,AC14/AT11
DatabasegManagementgSystems
(A)gSerializablegschedule.
(C)gDeadlockgfreegschedule.
(B)gRecoverablegschedule.
(D)gCascadelessgschedule.
Ans:g(A)
Q.8
Thegrulegthatgagvaluegofgagforeigngkeygmustgappeargasgagvaluegofgsomegspecificgtablegisgcalledga
(A)gReferentialgconstraint.
(B)gIndex.
(C)gIntegritygconstraint.
(D)gFunctionalgdependency.
Ans:g(A)gThegrulegthatgagvaluegofgagforeigngkeygmustgappeargasgagvaluegofgsomegspecificgtablegisgca
lledgagreferentialgconstraint.g(Referentialgintegritygconstraintgisgconcernedgwithgforeigngkey)
Q.9
ThegclausegingSQLgthatgspecifiesgthatgthegquerygresultgshouldgbegsortedgingascendinggorgdescendi
nggordergbasedgongthegvaluesgofgonegorgmoregcolumnsgisg(A)gView
(B)gOrdergby
(C)gGroupgby
(D)gHaving
Ans:g(B)gThegclausegingSQLgthatgspecifiesgthatgthegquerygresultgshouldgbegsortedgingascendinggorgd
escendinggordergbasedgongthegvaluesgofgonegorgmoregcolumnsgisgORDERgBY.g(ORDERgBYgclaus
egisgusedgtogarrangegthegresultgofgthegSELECTgstatement)
Q.10
Whatgisgagdisjointglessgconstraint?
(A)gItgrequiresgthatgangentitygbelongsgtognogmoregthangoneglevelgentitygset.g(B)gThegsamegentitygma
ygbelonggtogmoregthangoneglevel.
(C)gThegdatabasegmustgcontaingangunmatchedgforeigngkeygvalue.g(D)gAngentitygcangbegjoinedgwithg
anothergentitygingthegsameglevelgentitygset.gAns:g(A)gDisjointglessgconstraintgrequiresgthatgangentityg
belongsgtognogmoregthangoneglevelgentitygset.g(Disjointglessgconstraintgmeansgthatgangentitygcangbe
, agmembergofgatgmostgonegofgthegsubclassesgofgthegspecialization.)
g
Q.11
Accordinggtogtheglevelsgofgabstraction,gthegschemagatgthegintermediateglevelgisgcalledg(A)gLogicalgs
chema.
(B)
Physicalgschema.
(C)gSubschema.
(D)
Supergschema.
Ans:gAccordinggtogtheglevelsgofgabstraction,gthegschemagatgthegintermediateglevelgisgcalledgconcept
ualgschema.
(Note:gAllgthegoptionsggivengingthegquestiongaregwrong.)
Q.12
Itgisgangabstractiongthroughgwhichgrelationshipsgaregtreatedgasghigherglevelgentitiesg(A)gGeneralizat
ion.
(B)gSpecialization.
(C)gAggregation.
(D)gInheritance.
Ans:g(Cg)gItgisgangabstractiongthroughgwhichgrelationshipsgaregtreatedgasghigherglevelgentitiesgAggr
egation.g(IngERgdiagram,gaggregationgisgusedgtogrepresentgagrelationshipgasgangentitygset.)
2