数据结构（全英文）智慧树知到课后章节答案2023年下山东科技大学

数据结构（全英文）智慧树知到课后章节答案2023年下山东科技大学山东科技大学

第一章测试

Thealgorithmandflowchartcanhelpusto

A:Toknowthememorycapacity

B:Tostorethedata

C:Specifytheproblemcompletelyandclearly

D:Identifythedatatypeofavariable

答案:Specifytheproblemcompletelyandclearly

Therhombusordiamondshapeinflowchartingdenotes

A:Initialization

B:Input

C:Decision

D:Output

答案:Decision

Whichofthefollowingisnotanadvantageofaflowchart?

A:Efficientcoding

B:Improperdocumentation

C:Systematictesting

D:Bettercommunication

答案:Improperdocumentation

Theflowchartsymbolsusedforstartandstopoperationsarecalledas_______.

A:decision

B:terminals

C:connectorsD:processing

答案:terminals

TheformulaFn=Fn-1+Fn-2

willproduce

A:FibonacciNumber

B:RamanujanNumber

C:EulerNumber

D:PrimeNumber

答案:FibonacciNumber

Themainmeasuresfortheefficiencyofanalgorithmare

A:Processorandmemory

B:Dataandspace

C:Complexityandcapacity

D:Timeandspace

答案:Timeandspace

WhichoneofthefollowingistheconstanttimecomplexityintermsofBig-Ohnotation

A:O(n2)

B:O(n3)

C:O(n)

D:O(1)

答案:O(1)

Whatisthetimecomplexityofthefollowingcode?

inta=0;

for(i=0;i<n;i++){

for(j=n;j>i;j--){

a=a+i+j;}}

A:O(nlogn)

B:O(n2)

C:O(1)

D:O(n)

答案:O(n2)

Whichoneofthefollowingisanexampleforexponentialtimecomplexity?

A:O(1)

B:O(n)

C:O(n2)

D:O(2n)

答案:O(2n)

Forlargervaluesofn,whichonerepresentstheslowesttime?

A:O(n2)

B:O(n!)

C:O(n)

D:O(2n)

答案:O(n!)

第二章测试

Deletionofanelementfromthearrayreducesthesizeofarrayby___________.

A:one

B:three

C:zero

D:two

答案:one

Assumingthatintisof4bytes,whatisthesizeofintarr[10];?

A:20B:30C:40D:10

答案:40

Twodimensionalarraysareusefulwhentheelementsbeingprocessedaretobearrangedintheformof___________.

A:Both(a)and(b)

B:columns

C:Noneoftheabove

D:rows

答案:Both(a)and(b)

Inthepolynomial,

A(x)=3x2+2x+4,thedegreeofthispolynomialis

A:3B:0

C:2D:1

答案:2

Inthepolynomial,

A(x)=3x2+2x+4,coefficientoffirsttermis

A:3B:1C:2D:0

答案:3

Amatrixhavingalargernumberofelementswithzerovaluesthanthenumberofnon-zeroelementsissaidtobea_____________.

A:

triangularmatrix

B:

sparsematrix

C:

diagonalmatrix

D:

zeromatrix

答案:

sparsematrix

WhilerepresentingthesparsematrixA(m×n)withtnon-zerotermsin3-tuplesform,thesizeofthematrixbecomes

A:t×n

B:3×t

C:m×n

D:(t+1)×3

答案:(t+1)×3

Consideringasparseofm×nmatrixwithtnon-zeroterms,inFAST_TRANSPOSEalgorithm,thesizeofone-dimensionalarray(SorT)isequalto:

A:n

B:tC:mD:n+t

答案:n

Consideringasparseofm×nmatrixwithtnon-zeroterms,thetimecomplexityofTRANSPOSEalgorithmis:

A:O(nt)

B:O(n*t)

C:O(n-t)

D:O(n+t)

答案:O(n*t)

WhichofthefollowingstatementistrueregardingTRANSPOSEandFAST_TRANSPOSEalgorithms.

A:Noneoftheabove

B:TheTRANSPOSEalgorithmisslowerthanFAST_TRANSPOSE

C:TheTRANSPOSEalgorithmisfasterthanFAST_TRANSPOSED:TimecomplexitiesofTRANSPOSEandFAST_TRANSPOSEaresame

答案:TheTRANSPOSEalgorithmisslowerthanFAST_TRANSPOSE

第三章测试

Theelementisinsertedfirstandwillberemovedlastin

_____________.

A:

linkedlist

B:

queue

C:

stack

D:

noneoftheabove

答案:

stack

Theexpression1*2^3*4^5*6isevaluatedas(^isforpower,asina^b=ab):

A:

49152

B:

173458

C:

162^30

D:

32^30

答案:

49152

Thedatastructurerequiredtocheckwhetheranexpressioncontainsbalancedparenthesisis?

A:

Array

B:

Stack

C:

Queue

D:

Tree

答案:

Stack

ThepostfixformofA*B+C/Dis?

A:

A*BC+/D

B:

*AB/CD+

C:

ABCD+/*

D:

AB*CD/+

答案:

AB*CD/+

Whichdatastructureisneededtoconvertinfixnotationtopostfixnotation?

A:

Branch

B:

Queue

C:

Tree

D:

Stack

答案:

Stack

Transformthefollowinginfixexpressiontoprefixform.

((C*2)+1)/(A+B)

A:

/+*C21+AB

B:

AB+12C*+/

C:

/*+12CAB+

D:

Noneoftheabove

答案:

/+*C21+AB

Transformthefollowinginfixexpressiontopostfixform.

(A+B)*(C-D)/E

A:

AB+CD*-/E

B:

ABC*CD/-+

C:

AB+CD-*E/

D:

AB*C+D/-

答案:

AB+CD-*E/

Astackisadatastructureinwhichallinsertionsanddeletionsaremaderespectivelyat:

A:

inthemiddle

B:

oneend

C:

boththeends

D:

atanyposition

答案:

oneend

Whichofthefollowingapplicationsmayuseastack?:

A:

Alloftheabove

B:

Aparenthesisbalancingprogram

C:

Syntaxanalyzerforacompiler

D:

Keepingtrackoflocalvariablesatruntime

答案:

Alloftheabove

Whichofthefollowingstatementiscorrect.

A:Apostfixexpressionismerelythereverseoftheprefixexpression

B:

Postfixandprefixexpressionsuseparenthesis

C:

Apostfixexpressionisnotthereverseoftheprefixexpression

D:

Noneoftheabove

答案:

Apostfixexpressionisnotthereverseoftheprefixexpression

第四章测试

Aqueueisadatastructureinwhichallinsertionsanddeletionsaremaderespectivelyat:

A:

rearandrear

B:

frontandrear

C:

rearandfront

D:

frontandfront

答案:

rearandfront

Thefollowingdatastructureisusedforschedulingofjobsduringbatchprocessingincomputers.

A:

linkedlist

B:

stack

C:

queue

D:

tree

答案:

queue

Inaqueuethedeletionsaretakeplaceat_________.

A:Noneoftheabove

B:front

C:rearD:top

答案:front

Inaqueuetheinsertionsaretakeplaceat_________.

A:rear

B:top

C:front

D:Noneoftheabove

答案:rear

Incircularqueue,thefrontwillalwayspointtooneposition__________fromthefirstelementinthequeue.

A:clockwise

B:right

C:left

D:counterclockwise

答案:counterclockwise

Whichofthefollowingisnotthetypeofqueue.

A:doubleendedqueue

B:circularqueue

C:priorityqueue

D:singleendedqueue

答案:singleendedqueue

Oneoftheadvantageofcircularqueueis_____________.

A:easiercomputations

B:

effectiveuseofmemory

C:

deletingelementsbasedonpriority

D:

Noneoftheabove

答案:

effectiveuseofmemory

Whatisthetimecomplexityofalinearqueuehavingnelements?

A:

O(logn)

B:

O(1)

C:

O(nlogn)

D:

O(n)

答案:

O(n)

Whatisadequeue?

A:Aqueuewithinsert/deletedefinedforfrontendofthequeue

B:Aqueueimplementedwithadoublylinkedlist

C:Aqueuewithinsert/deletedefinedforbothfrontandrearendsofthequeue

D:Aqueueimplementedwithbothsinglyanddoublylinkedlist

答案:Aqueuewithinsert/deletedefinedforbothfrontandrearendsofthequeue

Onedifferencebetweenaqueueandastackis:

A:Stacksusetwoendsforaddinganddeleting,butqueuesuseone.

B:Queuesusetwoendsforaddinganddeleting,butstacksuseone.

C:Queuesrequiredynamicmemory,butstacksdonot.

D:Stacksrequiredynamicmemory,butqueuesdonot.

答案:Queuesusetwoendsforaddinganddeleting,butstacksuseone.

第五章测试

A

linearlistofdataelementswhereeachelementcallednodeisgivenbymeansofpointeriscalled

A:

nodelist

B:

linkedlist

C:

queue

D:

stack

答案:

linkedlist

Consideranimplementationofunsortedsinglylinkedlist.Supposeithasrepresentationwhichaheadpointeronly.Giventherepresentation,whichofthefollowingoperationcanbeimplementedinO(1)time?(I).Insertionatthefrontofthelinkedlist.(II).Insertionattheendofthelinkedlist.(III).Deletionofthefrontnodeofthelinkedlist.(IV).Deletionofthelastnodeofthelinkedlist.

A:I,II,andIV

B:IandIII

C:I,II,andIII

D:IandII

答案:IandIII

Whatisthetimecomplexitytocountthenumberofelementsinthelinkedlist?

A:O(n)

B:O(logn)

C:O(n2)

D:O(1)

答案:O(n)

InwhichofthefollowinglinkedliststherearenoNULLlinks?

A:

Circularlinkedlist

B:

Doublylinkedlist

C:

Noneoftheabove

D:

Singlylinkedlist

答案:

Circularlinkedlist

Indoublylinkedlists,traversalcanbeperformed?

A:

Inbothdirections

B:

Onlyinreversedirection

C:

None

D:

Onlyinforwarddirection

答案:

Inbothdirections

Whatkindoflistisbesttoanswerquestionssuchas:“Whatistheitematpositionn?”

A:

Singly-linkedlists

B:

Doubly-linkedlists

C:

Noneoftheabove

D:

Listimplementedwithanarray

答案:

Listimplementedwithanarray

Inasinglylinkedlistwhichoperationdependsonthelengthofthelist.

A:

Deletethelastelementofthelist

B:

Interchangethefirsttwoelementsofthelist

C:

Deletethefirstelementofthelist

D:

Addanelementbeforethefirstelementofthelist

答案:

Deletethelastelementofthelist

Thelinkfieldinanodecontains:

A:

dataofcurrentnode

B:

dataofpreviousnode

C:

addressofthenextnode

D:

dataofnextnode

答案:

addressofthenextnode

Linkedlistdatastructureoffersconsiderablesavingin:

A:

Spaceutilization

B:

Spaceutilizationandcomputationaltime

C:

Noneoftheabove

D:

Computationaltime

答案:

Spaceutilizationandcomputationaltime

Alinearlistinwhicheachnodehaspointerstopointtothepredecessorandsuccessorsnodesiscalledas:

A:Linearlinkedlist

B:

Circularlinkedlist

C:

Doubly-linkedlists

D:

Singly-linkedlists

答案:

Doubly-linkedlists

第六章测试

Torepresenthierarchicalrelationshipbetweenelements,whichdatastructureissuitable?

A:

array

B:tree

C:

queue

D:

stack

答案:tree

Whatisthemaximumnumberchildrenthatabinarytreenodecanhave?

A:3B:0

C:2D:1

答案:2

Theinordertraversaloftreewillyieldasortedlistingofelementsoftreein

A:

Noneoftheabove

B:

Heaps

C:

Binarytrees

D:

Binarysearchtrees

答案:

Binarysearchtrees

Ifwestorethenodesofabinarytreeinanarraywithindexstartingfromzero,therightchildofanodehavingindexncanbeobtainedat:

A:2n+1

B:n+1C:2n+2

D:(n-1)/2

答案:2n+2

WhichofthefollowingtraversaloutputsthedatainsortedorderinaBST?

A:

Inorder

B:

Preorder

C:

Levelorder

D:

Postorder

答案:

Inorder

Toobtainaprefixexpression,whichofthefollowingtraversalsisused?

A:

Postorder

B:

Levelorder

C:

Preorder