Correct Answers

1. The Program Counter

Your Answer
C. Both A and B
Correct Answer
C. Both A and B
2. Example of 32 bt mcroprocessor are
Your Answer
B. !"3!#$!"%!#
Correct Answer
B. !"3!#$!"%!#
3. &hch of the followng regsters s used to 'eep trac' of address of the
memor( locaton where the next nstructon s located )
Your Answer
*. Program +egster
Correct Answer
B. ,emor( *ata +egster
%. A CP- generall( handles an nterrupt b( executng an nterrupt ser.ce
routne
Your Answer
C. b( chec'ng the nterrupt regster after /nshng the executng
Correct Answer
C. b( chec'ng the nterrupt regster after /nshng the executng
0. 1n mmedate addressng the operand s placed
Your Answer
B. after 2P code n the nstructon
Correct Answer
B. after 2P code n the nstructon
#. 1dentf( the addressng modes of below nstructons and match them 3
Your Answer
B. a 4 35 b 4 25 c 4 15 d 4 %
Correct Answer
C. a 4 15 b 4 25 c 4 35 d 4 %
6. A*C
Your Answer
C. Add 1mmedate data to Accumulator
Correct Answer
A. Add to Accumulator usng carr( 7lag
!. The storage de.ce whch s used to compensate for the d8erence n rates
of 9ow of data from one de.ce to another s called
Your Answer
C. Bu8er
Correct Answer
C. Bu8er
:. To put the mcroprocessor n the wat state
Your Answer
C. +ase the ;2<* 1nput
Correct Answer
B. <ower the +EA*Y 1nput
1". 1nterrupts whch are ntated b( an nstructon are
Your Answer
*. =oftware
Correct Answer
*. =oftware
11. &hat s meant b( a dedcated computer )
Your Answer
B. &hch s assgned to one and onl( one tas'
Correct Answer
B. &hch s assgned to one and onl( one tas'
12. 1dentf( the de.ces g.en below wth ther 1C numbers 3
Your Answer
C. >c? >d? >a? >b?
Correct Answer
A. >c? >b? >a? >d?
13. The addressng mode used n the nstructon P-=; B s
Your Answer
C. +egster ndrect
Correct Answer
C. +egster ndrect
1%. =peed of mcroprocessor depends on
Your Answer
A. *ata Bus wdth
Correct Answer
A. *ata Bus wdth
10. 1nterrupts whch are ntated b( an 1$2 dr.e are
Your Answer
B. External
Correct Answer
B. External
1#. An nstructon ppelne can be mplemented b( means of
Your Answer
You ha.e not selected an( opton.
Correct Answer
B. 7172 bu8er
16. &hch of the followng s a se@uental access de.ce
Your Answer
C. Tape
Correct Answer
C. Tape
1!. &hch of the followng s not n.ol.ed n a memor( wrte operaton )
Your Answer
B. PC
Correct Answer
B. PC
1:. The word length of a CP- s de/ned as
Your Answer
You ha.e not selected an( opton.
Correct Answer
B. The wdth of a CP- +egster
2". Ppelnng mpro.es CP- performance due to
Your Answer
You ha.e not selected an( opton.
Correct Answer
C. The 1ntroducton of Parallelsm
Correct Answers
1. The pre4order and post order tra.ersal of a Bnar( Tree generates the same
output. The tree can ha.e maxmum
Your Answer
C. 2ne node
Correct Answer
C. 2ne node
2. The searchng techn@ue n whch there are no unnecessar( comparsons s
called
Your Answer
B. =e@uental searchng
Correct Answer
C. ;ashng
3. &hch of the followng sortng procedures s the slowest)
Your Answer
*. Bubble sort
Correct Answer
*. Bubble sort
%. 1f e.er( node u n A s adBacent to e.er( other node . n A5 A graph s sad
to be
Your Answer
*. =trongl( Connected
Correct Answer
B. Complete
0. 1n order to get the nformaton stored n a Bnar( =earch Tree n the
descendng order5 one should tra.erse t n whch of the followng order)
Your Answer
*. +ght5 <eft5 +oot
Correct Answer
C. +ght5 +oot5 <eft
#. 1n a ;eap tree
Your Answer
B. Calues n a node s Areater than e.er( .alue n chldren of t
Correct Answer
B. Calues n a node s Areater than e.er( .alue n chldren of t
6. 1f an( undrected graph 5the sum of degrees of all the nodes
Your Answer
*. ,ust be e.en
Correct Answer
C. 1s twce the number of edges
!. A Araph n whch all nodes are of e@ual degree s called
Your Answer
C. +egular Araph
Correct Answer
C. +egular Araph
:. &hat s the post/x form of the followng pre/x DEab cd
Your Answer
You ha.e not selected an( opton.
Correct Answer
A. abEcd D
1". The most common ;ash functons use theFFFFFFFFFFto compute hash
address.
Your Answer
C. *.son method
Correct Answer
C. *.son method
11. The *ata =tructure re@ured for Breadth 7rst Tra.ersal on a Araph s
Your Answer
A. Gueue
Correct Answer
A. Gueue
12. The balance factor for an AC< tree s ether
Your Answer
B. "51 or 41
Correct Answer
B. "51 or 41
13. The Tme 7actor when determnng the eHcenc( of algorthm s
measured b(
Your Answer
B. Countng the number of 'e( operatons
Correct Answer
B. Countng the number of 'e( operatons
1%. The 1norder tra.ersal of the tree wll (eld a sorted lstng of elements of
tree n
Your Answer
C. Bnar( =earch Tree
Correct Answer
C. Bnar( =earch Tree
10. =parse matrces ha.e
Your Answer
B. ,an( non Iero entres
Correct Answer
A. ,an( Iero entres
1#. &hch of the followng algorthms sol.es the All Par =hortest Path
problem)
Your Answer
B. 7lo(d algorthm
Correct Answer
B. 7lo(d algorthm
16. A =ortng techn@ue that guarantees5that records wth the same prmar(
'e( occurs n the same order n the sorted lst as n the orgnal unsorted lst
s sad to be
Your Answer
A. =table
Correct Answer
A. =table
1!. ;ashng Collson +esoluton Techn@ues are
Your Answer
*. Channg5 Buc'et Addressng
Correct Answer
*. Channg5 Buc'et Addressng
1:. A.en a bnar( tree whose norder and preorder tra.ersal are g.en b(
1norder 3 E1C7BA*J;K
Preorder 3 BCE17*A;JK
The post order tra.ersal of the abo.e bnar( tree s
Your Answer
You ha.e not selected an( opton.
Correct Answer
A. 1E7CAJK;*B
2". Consder a <n'ed <st of n elements. &hat s the tme ta'en to nsert an
element after an element ponted b( some ponter)
Your Answer
A. 2 >1?
Correct Answer
A. 2 >1?
1. 1f a node ha.ng two chldren s deleted from a bnar( tree ts replaced b(
ts
Your Answer
You ha.e not selected an( opton.
Correct Answer
C. 1norder successor
2. The post/x expresson AB E C* 4 D can be e.aluated usng a
Your Answer
A. =tac'
Correct Answer
A. =tac'
3. &hat s the most approprate data structure to mplement a prort(
@ueue )
Your Answer
A. ;eap
Correct Answer
A. ;eap
%. 1n a Bnar( Tree5 certan null entres are replaced b( specal ponters whch
pont to nodes hgher n the tree for eHcenc(. These specal ponters are
called
Your Answer
*. Thread
Correct Answer
*. Thread
0. 1n <n'ed <st data s stored n
Your Answer
B. *8erent <ocaton n ,emor(
Correct Answer
B. *8erent <ocaton n ,emor(
#. A B=T s tra.ersed n the followng order recurs.el(3 +ght5 +oot5 <eft. The
output se@uence wll be n
Your Answer
B. *escendng order
Correct Answer
B. *escendng order
6. The number of nodes n a Complete Bnar( Tree of le.el 0 s
Your Answer
C. #3
Correct Answer
C. #3
!. 1dentf( the data structure whch allows deletons at both ends of the lst
but nserton at onl( one end.
Your Answer
A. 1nput4restrcted de@ue
Correct Answer
A. 1nput4restrcted de@ue
:. The process of accessng data stored n a tape s smlar to manpulatng
data on a
Your Answer
C. <st
Correct Answer
B. Gueue
1". The post order tra.ersal of a bnar( tree s *EB7CA. 7nd out the preorder
tra.ersal.
Your Answer
You ha.e not selected an( opton.
Correct Answer
C. AB*EC7
11. &hch of the followng can be the se@uence of nodes examned n bnar(
search tree whle searchng for 'e( !! )
Your Answer
You ha.e not selected an( opton.
Correct Answer
*. 1:"5 #"5 :"5 !05 !!
12. Bnar( =earch Tree s an example of
Your Answer
A. *.de and con@uer
Correct Answer
*. *(namc programmng
13. The =earchng techn@ue that ta'es 2>1? tme to /nd a data s
Your Answer
C. ;ashng
Correct Answer
C. ;ashng
1%. &th regard to ln'ed lst5 whch of the followng statement s false )
Your Answer
B. An algorthm for deletng the /rst element n a sngl( ln'ed lst re@ures
2>n? operatons n the worst case.
Correct Answer
B. An algorthm for deletng the /rst element n a sngl( ln'ed lst re@ures
2>n? operatons n the worst case.
10. =elect the true statement
Your Answer
B. E.er( Complete Bnar( Tree s also a full Bnar( Tree
Correct Answer
B. E.er( Complete Bnar( Tree s also a full Bnar( Tree