Qui

z1
Dat
aStr
uctureandAlgor
it
hms
MCS2ndMorning/
Eveni
ng-B
MujtabaHusnain
21June2020

Submi
tt
edby:Haf
izAhmedmaaz
FA19m2mb073
fp=5i
1.I sanint
egerv
ari
abl
eandi
tsaddr
essi
ssav
edi
npoi
nterv
ari eq.I
abl nhowmanyway
swecan
di
splayv ueofp?
al
A.cout<<*p;
B.cout<<q;
C.cout<<*q;
D.Noneofabov e
Answer :C

2.Considert
hefoll
owi
ngcode.Whatwi
llbet
heout
put
?
i
nt*ptr;
i
ntx[2]={67,69}
;
ptr=x;

cout
<<*
(pt
r)+1<<*
(pt
r+1)
;

A.68,
68
B.69,
69
C.68,
69
D.69,
68
Answer:C

3.Whatwi l
lbet
heout
putoff
oll
owi
ngcode?
inti=5,j=10;
int*p=&i;
j=* p+4;
cout<<*
p+j ;

A.15
B.9
C.14
D.Noneofabov
e
Answer:C

4.Whatwi
llbet
hecostoff
oll
owi
nggr
oupofst
atement
s?
a=a+b–9
s=a/6–4
PRINTs+a-9

A.6
B.3
C.4
D.Al
lofabov
e
Answer
:C

5.Howdoy ouinit
ial
izeanarr
ayi
nC?
A.i
ntar
r[
5]=(5, 4,3,
2, 1)
;
B.i
ntar
r(5)={1,2,3,4,5}
;
C.i
ntar
r[
5]={1, 2,3,
4, 5}
;
D.i
ntar
r(5)=(1,2,3,4,5);
Answer
:C

6.Whichoft hefoll
owingoperat
ionscanbeappl
iedonsi
ngl
eli
nkl
ist
?
A.Sorti
ngt hel i
st
B.Searchingi ntheli
st
C.Copy ingthelistt
ootherl
ist
D.Allofabov e
Answer :D

7.Howmanyt
imest
hel
oopwi
llr
un?Al
soi
ncl
udewhenl
oopt
ermi
nat
es.
for(
j=22t
o56)
j=j+2

A.18ti
mes
B.17ti
mes
C.56ti
mes
D.36ti
mes
Answer:B

8.Ift
heelements‘
5’
,‘7’
,‘1’
and‘9’ar
einser
tedi
naqueueandar
eremov
edonebyone,
whatwi
llbet
he
orderoft
heelementsthatwer
er emoved?

A.9175
B.9751
C.5719
D.5917
Answer
:C

9.I
ngr aphs,
simplepathisdefi
nedas
A.Sequencesofvert
icesfr
om onevert
extoothervert
exwit
hnor epeati
ngvertex.
B.Sequencesofvert
icesfr
om onevert
extoothervert
exwit
hrepeati
ngv er
tex.
C.Sequencesofedgesfrom onever
textoot
herv er
texwi
thnorepeatingvert
ex.
D.Noneofabov e

Answer
:C

10.Whati
sthedi
ff
erencebet
weenBi
nar
yTr
eeandBi
nar
ySear
chTr
ee(
BST)
?

A.BSThasnumbersl
essthant
herootonthelef
tofrootandgreat
ernumber
sont
her
ightofr
oot
.
B.Bi
narytr
eehast
worootnodesbutBSThasonlyonerootnode.
C.BSTmusthavet
wochil
dnodesateverynode.
D.Bot
hAandC.
Answer:A

11.Whi
choft
hef
oll
owi
ngi
sthecor
rectr
epr
esent
ati
onofA+B*
C/(
E-F)i
ntopost
fi
x?

A.ABC*EF-/
+
B.AB+C*EF-
C.EF-
C*AB+
D.Noneofabov
e
Answer:B

12.Whati
sthecostoff
oll
owi
ngcode?Al
soi
ncl
udet
hecostwhenf
orl
oopt
ermi
nat
es.
for(
j=1to10)
{
PRINTj
j=j+2
}
A.10
B.11
C.12
D.13
Answer
:B

13.I
fintegert
akes2by
tesofmemor
y,whatwi
llbet
hemaxi
mum posi
ti
vev
aluest
oredi
n
i
nteger?

A.65535
B.12345
C.54321
D.-9876
Answer:A

14.Whi
cht
rav
ersalofBSTgi
vest
heel
ement
sinascendi
ngor
der
?

A.Postorder
B.Pre-
Order
C.DepthFir
st
D.I
norder
I
norderD

15.I
nhowmanyway
s,t
hegr
aphcanber
epr
esent
edi
ncomput
ersy
stem?

A.Adjacencyl
ist
.
B.AdjacencyMatri
x.
C.Stack.
D.BothAandB.
Answer :D

16.Whati
sthepr
ocedur
eofDept
hFi
rstSear
ch(
DFS)oft
reeorgr
aph?

A.Thealgor
it
hm st
art
satt
her
ootnodeandexpl
oresasfaraspossibl
ealongeachbr anch.
B.Thealgor
it
hm st
art
satt
her
ootnodeandexpl
orestheneighbor
ingnodesfi
rstbeforegoi
ngasf
arast
he
branchgoeson.
C.Thealgor
it
hm st
art
satt
her
ootnodeandtr
averset
heleftsubtr
eeandthensubtree.
D.BothAandC
Answer:A

17.Whataretheproper
tiesofpseudogr aphs?
A.Thegraphshavi
ngmul ti
pleedgesonly.
B.Thegraphshavi
ngdisconnectedver
tices.
C.Thegraphshavi
ngloopsont hevert
ices.
D.Noneofabove
Answer:A

18.HowBr
eadt
hFi
rstSear
ch(
BFS)wor
ks?

A.Itstart
satthet r
eer oot
,andexploresalloftheneighbornodesatt hepresentdept
hpriortomovingon
tothenodesatt henextdept hlev
el.
B.Itstart
satthet r
eer oot
,andexplor
esal l
ofnodesbygoi ngasf araspossibl
etheneighbornodesatthe
presentdept
hpr iortomov ingontothenodesatt henextdepthlevel
C.Itstart
sfr
om t herightsubtr
eeandt henv i
sitt
her ootaf
tervi
siti
ngleftsubtr
ee.
D.Noneofabov e
Answer :A
19.Whi
choft
hef
oll
owi
ngar
edi
sadv
ant
agesofusi
ngar
ray
s?

A.Slowinser
tionanddel
eti
on.
B.Memor ywastage.
C.Quickaccess.
D.BothAandB
Answer:D

20.I
fweaddandi
ntegerandaf
loatdat
a,andst
oret
hesum i
nani
ntegerv
ari
abl
e,whatwi
ll
happen?

A.Overf
low
B.Underfl
ow
C.Memor ywastage
D.Synt
axer r
or
Answer:A