Test Bank For Concepts of Database Management - 11th - 2021 All Chapters - 9780357422083.pdf

dbms
bypshilp_dp



AC14/AT11

DatabasepManagementpSystems

TYPICALpQUESTIONSp&pANSWERS
PARTp-I

OBJECTIVEpTYPEpQUESTIONS
EachpQuestionpcarriesp2pmarks.
Choosethepcorrectporpthepbestpalternativepinpthepfollowing:
Q.1

Whichpofpthepfollowingprelationalpalgebrapoperationspdopnotprequirepthepparticipatingptablesptopbepu
nion-compatible?
(A)pUnion
(B)pIntersection
(C)pDifference
(D)pJoin
Ans:p(D)

Q.2

Whichpofpthepfollowingpispnotpappropertypofptransactions?
(A)pAtomicity
(B)pConcurrency
(C)pIsolation
(D)pDurability
Ans:p(B)

Q.3

RelationalpAlgebrapdoespnotphave
(A)pSelectionpoperator.
(C)pAggregationpoperators.

,(B)pProjectionpoperator.
(D)pDivisionpoperator.

Ans:p(Cp)
Q.4

Checkpointsparepappartpof
(A)pRecoverypmeasures.
(Cp)pConcurrencypmeasures.

(B)pSecuritypmeasures.
(D)pAuthorizationpmeasures.

Ans:p(A)
Q.5

Treepstructuresparepusedptopstorepdatapin
(A)pNetworkpmodel.
(B)pRelationalpmodel.
(C)pHierarchicalpmodel.
(D)pFilepbasedpsystem.
Ans:p(Cp)

Q.6

Theplanguagepthatprequirespapuserptopspecifypthepdataptopbepretrievedpwithoutpspecifyingpexactlyph
owptopgetpitpis
(A)pProceduralpDML.
(B)pNon-ProceduralpDML.
(C)pProceduralpDDL.
(D)pNon-ProceduralpDDL.
Ans:p(B)

Q.7

Precedencepgraphsphelpptopfindpa
1

,AC14/AT11

DatabasepManagementpSystems

(A)pSerializablepschedule.
(C)pDeadlockpfreepschedule.

(B)pRecoverablepschedule.
(D)pCascadelesspschedule.

Ans:p(A)
Q.8

Theprulepthatpapvaluepofpapforeignpkeypmustpappearpaspapvaluepofpsomepspecificptablepispcalledpa
(A)pReferentialpconstraint.
(B)pIndex.
(C)pIntegritypconstraint.
(D)pFunctionalpdependency.
Ans:p(A)pTheprulepthatpapvaluepofpapforeignpkeypmustpappearpaspapvaluepofpsomepspecificptablepispca
lledpapreferentialpconstraint.p(Referentialpintegritypconstraintpispconcernedpwithpforeignpkey)

Q.9

ThepclausepinpSQLpthatpspecifiespthatpthepquerypresultpshouldpbepsortedpinpascendingporpdescendi
ngporderpbasedponpthepvaluespofponeporpmorepcolumnspisp(A)pView
(B)pOrderpby
(C)pGrouppby
(D)pHaving
Ans:p(B)pThepclausepinpSQLpthatpspecifiespthatpthepquerypresultpshouldpbepsortedpinpascendingporpd
escendingporderpbasedponpthepvaluespofponeporpmorepcolumnspispORDERpBY.p(ORDERpBYpclaus
epispusedptoparrangepthepresultpofpthepSELECTpstatement)

Q.10

Whatpispapdisjointplesspconstraint?
(A)pItprequirespthatpanpentitypbelongsptopnopmorepthanponeplevelpentitypset.p(B)pThepsamepentitypma
ypbelongptopmorepthanponeplevel.
(C)pThepdatabasepmustpcontainpanpunmatchedpforeignpkeypvalue.p(D)pAnpentitypcanpbepjoinedpwithp
anotherpentitypinpthepsameplevelpentitypset.pAns:p(A)pDisjointplesspconstraintprequirespthatpanpentityp
belongsptopnopmorepthanponeplevelpentitypset.p(Disjointplesspconstraintpmeanspthatpanpentitypcanpbe

, apmemberpofpatpmostponepofpthepsubclassespofpthepspecialization.)
p




Q.11

Accordingptoptheplevelspofpabstraction,pthepschemapatpthepintermediateplevelpispcalledp(A)pLogicalps
chema.
(B)
Physicalpschema.
(C)pSubschema.
(D)
Superpschema.
Ans:pAccordingptoptheplevelspofpabstraction,pthepschemapatpthepintermediateplevelpispcalledpconcept
ualpschema.
(Note:pAllpthepoptionspgivenpinpthepquestionparepwrong.)

Q.12

Itpispanpabstractionpthroughpwhichprelationshipspareptreatedpasphigherplevelpentitiesp(A)pGeneralizat
ion.
(B)pSpecialization.
(C)pAggregation.
(D)pInheritance.
Ans:p(Cp)pItpispanpabstractionpthroughpwhichprelationshipspareptreatedpasphigherplevelpentitiespAggr
egation.p(InpERpdiagram,paggregationpispusedptoprepresentpaprelationshippaspanpentitypset.)
2