Professional Documents
Culture Documents
(index.html#)
(INDEX.HTML)
01:57:29
Section1
Q.1:
Convertthefollowinginfixexpressionintopostfixexpressionusingstacks:A^B
SECTION
1
*CD+E/F/(G+H)
1
SECTION 2
SECTION 3
Instruction/Guide
End Test
SaveAnswer
ClearAnswer
Q.2:
Writeanalgorithmforinsertinganelementintolinkedlist.
SaveAnswer
ClearAnswer
http://exam.amityonline.com/exam/june2016/index.php
1/22
6/4/2016
Q.3:
Expalinbreadthfirstalgorithmfortraversalofgraphs.
SaveAnswer
ClearAnswer
Q.4:
Giveanalgorithmforbinarysearching.
SaveAnswer
ClearAnswer
Section2
2/22
6/4/2016
Q.5:
Followingtheresultobtainedin(1),ywolettersaredeleted.
FRONT=2,REAR=3
FRONT=4,REAR=5
FRONT=4,REAR=5
FRONT=0,REAR=5
Q.6:
Followingtheresultobtainedin(2)K,L,andMareaddedtothequeue.
FRONT=4,REAR=2
FRONT=4,REAR=3
FRONT=2,REAR=3
FRONT=2,REAR=4
Q.7:
Followingthis,twolettersDandFaredeleted
FRONT=6,REAR=0
FRONT=4,REAR=2
FRONT=2,REAR=2
FRONT=6,REAR=2
http://exam.amityonline.com/exam/june2016/index.php
3/22
6/4/2016
Q.8:
Fisaddedtothequeue.
FRONT=2,REAR=5
FRONT=3,REAR=5
FRONT=3,REAR=5
FRONT=2,REAR=3
Q.9:
Followingthis,Risaddedtothequeue
FRONT=4,REAR=2
FRONT=6,REAR=3
FRONT=4,REAR=3
FRONT=3,REAR=2
Section3
Q.10:
Whichofthefollowingstatementisfalse?
Arraysaredenselistsandstaticdatastructure
dataelementsinlinkedlistneednotbestoredinadjecentspaceinmemory
pointersstorethenextdataelementofalist
http://exam.amityonline.com/exam/june2016/index.php
4/22
6/4/2016
linkedlistsarecollectionofthenodesthatcontaininformationpartandnext
pointer
Q.11:
Twodimensionalarraysarealsocalled
tablesarrays
matrixarrays
sparsearrays
tabulararrays
Q.12:
Whichofthefollowingisatwowaylist?
groundedheaderlist
circularheaderlist
linkedlistwithheaderandtrailernodes
circularlist
Q.13:
Thememoryaddressofthefirstelementofanarrayiscalled
flooraddress
foundationaddress
http://exam.amityonline.com/exam/june2016/index.php
5/22
6/4/2016
firstaddress
baseaddress
Q.14:
Eachdataiteminarecordmaybeagroupitemcomposedofsubitems;those
itemswhichareindecomposablearecalled
elementaryitems
atoms
scalars
alloftheabove
Q.15:
AgraphGismultigraphifitdoesnothaveanyrestrictionon
thenumberofedges
thenumberofvertices
numberofedgesandvertices
selfloops
Q.16:
ThedatastructurerequiredfordepthFirstTraversalonagraphis
queue
stack
http://exam.amityonline.com/exam/june2016/index.php
6/22
6/4/2016
stack
array
tree
Q.17:
Inlinkedlist,anodecontains
node,addressfieldanddatafield
nodenumber,datafield
nextaddressfield,informationfield
node,addressfield
Q.18:
Preordertraversalisnothingbut
depthfirstorder
breadthfirstorder
topologicalorder
linearorder
Q.19:
Whileconsideringdatastructureimplementation,thefactorsunder
considerationis/are
time
http://exam.amityonline.com/exam/june2016/index.php
7/22
6/4/2016
spaceandtime
time,spaceandprocessor
space
Q.20:
Inanadjacencymatrixparalleledgesaregivenby
similarcolumns
similarrows
notrepresentable
diagonalelements
Q.21:
Intopdownapproach
aproblemissubdividedintosubproblems
aproblemistackledfrombeginningtoendinonego
subproblemsaresolvedfirst,thenallsolutionstosubproblemsareputtogether
tosolvethemainproblem
startsfrombasiccomponents
Q.22:
Breadthfirstsearchisusedin
http://exam.amityonline.com/exam/june2016/index.php
8/22
6/4/2016
Binarytrees
Stacks
Graphs
both1and3
Q.23:
Whichofthefollowingstatementsholdtrueforbinarytrees.
Theleftsubtreeofanodecontainsonlynodeswithkeyslessthanthenode's
key
Therightsubtreeofanodecontainsonlynodeswithkeysgreaterthanthe
node'skey.
Both1and2
Bothleftandrightsubtreenodescontainsonlynodeswithkeyslessthanthe
node'skey
Q.24:
Adatastructureinwhichelementsareaddedandremovedonlyatoneendis
knownas
queue
stack
array
linkedlist
http://exam.amityonline.com/exam/june2016/index.php
9/22
6/4/2016
linkedlist
Q.25:
Onwhichprincipledoesstackwork
FILO
FIFO
LILO
LIFOorFILO
Q.26:
Anisolatedvertexhasdegree
0
1
2
4
Q.27:
Whichofthefollowinglinkedlisthavelastnodeofthelistpointingtothefirst
node
Circulardoublylinkedlist
Circularlinkedlist
Circularsinglylinkedlist
http://exam.amityonline.com/exam/june2016/index.php
10/22
6/4/2016
doublylinkedlist
Q.28:
Underflowisaconditionwhereyou
insertanewnodewhenthereisnofreespaceforit
deleteanonexixtentnodeinthelist
deleteanodeinemptylist
listisfull
Q.29:
AdirectedgraphG=(V,E)issaidtobefiniteifits
setVofverticesisfinite
SetVofverticesandsetEofedgesarefinite
setEofedgesisfinite
noneofthese
Q.30:
Whichofthefollowingisnottherequiredconditionforbinarysearchalgorithm?
Thelistmustbesorted
thereshouldbethedirectaccesstothemiddleelementinanysublist
Theremustbemechanismtodeleteand/orinsertelementsinlist
http://exam.amityonline.com/exam/june2016/index.php
11/22
6/4/2016
noneoftheabove
Q.31:
Thememoryaddressoffifthelementofanarraycanbecalculatedbythe
formula
LOC(Array[5]=Base(Array)+w(5lowerbound),wherewisthenumberofwords
permemorycellforthearray
LOC(Array[5])=Base(Array[5])+(5lowerbound),wherewisthenumberofwords
permemorycellforthearray
LOC(Array[5])=Base(Array[4])+(5Upperbound),wherewisthenumberof
wordspermemorycellforthearray
noneoftheabove
Q.32:
Inapreordertraversal,theprocessedfirst.
leftsubtree
rightsubtree
root
aorb
Q.33:
Twoadjacentvertices
haveacommonedge
http://exam.amityonline.com/exam/june2016/index.php
12/22
6/4/2016
haveacommonpath
haveacommonwalk
havealoop
Q.34:
Thedifferencebetweenlineararrayandarecordis
Anarrayissuitableforhomogeneousdatabuthtedataitemsinarecordmay
havedifferentdatatype
Inarecord,theremaynotbeanaturalorderinginopposedtolineararray.
Arecordformahierarchicalstructurebutalieneararraydoesnot
alloftheabove
Q.35:
Avertexwithdegreeoneinagraphiscalled
aleaf
pendantvertex
adjacencylist
isolatedvertex
Q.36:
Whichofthefollowingdatastructurecan'tstorethenonhomogeneousdata
elements?
http://exam.amityonline.com/exam/june2016/index.php
13/22
6/4/2016
arrays
records
pointers
tables
Q.37:
Agraphwithnverticeswilldefinitelyhaveaparalleledgeorselfloopifthetotal
numberofedgesare
morethann
morethann+1
morethan(n+1)/2
morethann(n1)/2
Q.38:
Keyvaluepairisusuallyseenin
Hashtables
Heaps
Both1and2
skiplist
Q.39:
http://exam.amityonline.com/exam/june2016/index.php
14/22
6/4/2016
Q.39:
Whichofthefollowingisapreordertranersal
Root>leftsubtree>rightsubtree
Root>rightsubtree>leftsubtree
rightsubtree>leftsubtree>Root
leftsubtree>rightsubtree>Root
Q.40:
Asparsematrixisonewheremostofitselementsare
even
prime
zero
odd
Q.41:
Whichofthefollowingdatastructuresareindexedstructures?
lineararrays
linkedlists
tress
graphs
http://exam.amityonline.com/exam/june2016/index.php
15/22
6/4/2016
Q.42:
Whatisinordertraversal
Root>leftsubtree>rightsubtree
Root>rightsubtree>leftsubtree
rightsubtree>leftsubtree>Root
leftsubtree>root>rightsubtree
Q.43:
Whichofthefollowingdatastructurestorethehomogeneousdataelements?
arrays
records
pointers
tables
Q.44:
Arrayis
lineardatastructure
nonlineardatastructure
complexdatastructure
realdatastructure
http://exam.amityonline.com/exam/june2016/index.php
16/22
6/4/2016
Q.45:
Atreeiaatreewhereforeachparentnode,thereisonlyoneassociated
childnode.
balancedbinarytree
rootedcompletebinarytree
completebinarytree
Degeneratetree
Q.46:
Abinarytreewiththepropertythatthekeystoredateachnodeisgreaterthan
thoseofitschildrenisa/an
AVLtree
heap
binarysearchtree
threadedtree
Q.47:
Whichofthefollowingdatastructurecan'tstorethenonhomogeneousdata
elements?
Arrays
records
pointers
http://exam.amityonline.com/exam/june2016/index.php
17/22
6/4/2016
pointers
none
Q.48:
Nullpointerisusedtotell
endoflinkedlist
emptypointerfieldofastructure
thelinkedlistisempty
startoflinkedlist
Q.49:
Inaheap,elementwiththegreatestkeyisalwaysinthe.node.
leaf
root
firstnodeofleftsubtree
firstnodeofrightsubtree
Q.50:
Intree,theheightsoftwochildsubtreesofanynodedifferbyatmostone.
binarytree
redblacktree
http://exam.amityonline.com/exam/june2016/index.php
18/22
6/4/2016
splaytree
AVLtree
Q.51:
Anemptylististheonewhichhasno
nodes
data
both1and2
address
Q.52:
Itemsinapriorityqueueareenteredinaorder.
random
orderofpriority
asandwhentheycome
noneofthese
Q.53:
Whichofthefollowingisnotalimitationofbinarysearchalgorithm?
mustuseasortedarray
requirementofsortedarrayisexpensivewhenalotofinsertionanddeletions
http://exam.amityonline.com/exam/june2016/index.php
areneeded
19/22
6/4/2016
areneeded
theremustbeamechanismtoaccessmiddleelementdirectly
binarysearchalgorithmisnotefficientwhenthedataelementsaremorethan
1000.
Q.54:
Binarysearchalgorithmcannotbeappliedto
sortedlinkedlist
sortedbinarytrees
sortedlineararray
pointerarray
Q.55:
Thedepthofcompletebinarytreewithnnodesis
Log2(n+1)1
log2n
log2(n1)+1
log2n+1
Q.56:
FRONT=REARpointerreferstoempty
stack
http://exam.amityonline.com/exam/june2016/index.php
20/22
6/4/2016
stack
queue
array
linkedlist
Q.57:
Onwhichprincipledoesqueuework?
FILO
FIFO
LILO
Both1and2
Q.58:
WheninordertraversingatreeresultedEACKFHDBG;thepreordertraversal
wouldreturn
FAEKCDBHG
FAEKCDHGB
EAFKHDCBG
FEAKDCHBG
Q.59:
AvariablePiscalledpointerif
http://exam.amityonline.com/exam/june2016/index.php
21/22
6/4/2016
PcontainstheaddressofanelementinDATA.
PpointstotheaddressoffirstelementinDATA
Pcanstoreonlymemoryaddresses
PcontaintheDATAandtheaddressofDATA
http://exam.amityonline.com/exam/june2016/index.php
22/22