第一章測(cè)試1【單選題】(10分)ThealgorithmandflowchartcanhelpustoA.TostorethedataB.ToknowthememorycapacityC.IdentifythedatatypeofavariableD.Specifytheproblemcompletelyandclearly2【單選題】(10分)TherhombusordiamondshapeinflowchartingdenotesA.DecisionB.InputC.InitializationD.Output3【單選題】(10分)Whichofthefollowingisnotanadvantageofaflowchart?A.EfficientcodingB.BettercommunicationC.SystematictestingD.Improperdocumentation4【單選題】(10分)Theflowchartsymbolsusedforstartandstopoperationsarecalledas_______.

A.decisionB.processingC.terminalsD.connectors5【單選題】(10分)TheformulaFn=Fn-1+Fn-2willproduceA.FibonacciNumberB.RamanujanNumberC.PrimeNumberD.EulerNumber6【單選題】(10分)ThemainmeasuresfortheefficiencyofanalgorithmareA.ComplexityandcapacityB.ProcessorandmemoryC.TimeandspaceD.Dataandspace7【單選題】(10分)WhichoneofthefollowingistheconstanttimecomplexityintermsofBig-OhnotationA.O(1)B.O(n2)C.O(n3)D.O(n)8【單選題】(10分)Whatisthetimecomplexityofthefollowingcode?inta=0;for(i=0;i<n;i++){for(j=n;j>i;j--){a=a+i+j;}}A.O(nlogn)B.O(n)C.O(n2)D.O(1)9【單選題】(10分)Whichoneofthefollowingisanexampleforexponentialtimecomplexity?A.O(n2)B.O(2n)C.O(n)D.O(1)10【單選題】(10分)Forlargervaluesofn,whichonerepresentstheslowesttime?A.O(n2)B.O(2n)C.O(n)D.O(n!)第二章測(cè)試1【單選題】(10分)Deletionofanelementfromthearrayreducesthesizeofarrayby___________.A.threeB.twoC.zeroD.one2【單選題】(10分)Assumingthatintisof4bytes,whatisthesizeofintarr[10];?A.30B.10C.40D.203【單選題】(10分)Twodimensionalarraysareusefulwhentheelementsbeingprocessedaretobearrangedintheformof___________.A.NoneoftheaboveB.Both(a)and(b)C.rowsD.columns4【單選題】(10分)Inthepolynomial,A(x)=3x2+2x+4,thedegreeofthispolynomialisA.3B.1C.0D.25【單選題】(10分)Inthepolynomial,A(x)=3x2+2x+4,coefficientoffirsttermisA.2B.1C.0D.36【單選題】(10分)Amatrixhavingalargernumberofelementswithzerovaluesthanthenumberofnon-zeroelementsissaidtobea_____________.A.triangularmatrixB.zeromatrixC.diagonalmatrixD.sparsematrix7【單選題】(10分)WhilerepresentingthesparsematrixA(m×n)withtnon-zerotermsin3-tuplesform,thesizeofthematrixbecomesA.t×nB.m×nC.3×tD.(t+1)×38【單選題】(10分)Consideringasparseofm×nmatrixwithtnon-zeroterms,inFAST_TRANSPOSEalgorithm,thesizeofone-dimensionalarray(SorT)isequalto:A.n+tB.mC.nD.t9【單選題】(10分)Consideringasparseofm×nmatrixwithtnon-zeroterms,thetimecomplexityofTRANSPOSEalgorithmis:A.O(n*t)B.O(n+t)C.O(nt)D.O(n-t)10【單選題】(10分)WhichofthefollowingstatementistrueregardingTRANSPOSEandFAST_TRANSPOSEalgorithms.A.NoneoftheaboveB.TheTRANSPOSEalgorithmisslowerthanFAST_TRANSPOSEC.TheTRANSPOSEalgorithmisfasterthanFAST_TRANSPOSED.TimecomplexitiesofTRANSPOSEandFAST_TRANSPOSEaresame第三章測(cè)試1【單選題】(10分)Theelementisinsertedfirstandwillberemovedlastin_____________.A.queueB.stackC.noneoftheaboveD.linkedlist2【單選題】(10分)Theexpression1*2^3*4^5*6isevaluatedas(^isforpower,asina^b=ab):A.49152B.173458C.162^30D.32^303【單選題】(10分)Thedatastructurerequiredtocheckwhetheranexpressioncontainsbalancedparenthesisis?A.TreeB.ArrayC.QueueD.Stack4【單選題】(10分)ThepostfixformofA*B+C/Dis?A.AB*CD/+B.ABCD+/*C.A*BC+/DD.*AB/CD+5【單選題】(10分)Whichdatastructureisneededtoconvertinfixnotationtopostfixnotation?A.StackB.BranchC.QueueD.Tree6【單選題】(10分)Transformthefollowinginfixexpressiontoprefixform.((C*2)+1)/(A+B)A./+*C21+ABB.AB+12C*+/C.NoneoftheaboveD./*+12CAB+7【單選題】(10分)Transformthefollowinginfixexpressiontopostfixform.(A+B)*(C-D)/EA.AB+CD-*E/B.AB*C+D/-C.AB+CD*-/ED.ABC*CD/-+8【單選題】(10分)Astackisadatastructureinwhichallinsertionsanddeletionsaremaderespectivelyat:A.atanypositionB.boththeendsC.inthemiddleD.oneend9【單選題】(10分)Whichofthefollowingapplicationsmayuseastack?:A.AlloftheaboveB.SyntaxanalyzerforacompilerC.AparenthesisbalancingprogramD.Keepingtrackoflocalvariablesatruntime10【單選題】(10分)Whichofthefollowingstatementiscorrect.A.NoneoftheaboveB.ApostfixexpressionismerelythereverseoftheprefixexpressionC.PostfixandprefixexpressionsuseparenthesisD.Apostfixexpressionisnotthereverseoftheprefixexpression第四章測(cè)試1【單選題】(10分)Aqueueisadatastructureinwhichallinsertionsanddeletionsaremaderespectivelyat:A.rearandfrontB.frontandrearC.rearandrearD.frontandfront2【單選題】(10分)Thefollowingdatastructureisusedforschedulingofjobsduringbatchprocessingincomputers.A.stackB.queueC.linkedlistD.tree3【單選題】(10分)Inaqueuethedeletionsaretakeplaceat_________.A.NoneoftheaboveB.topC.frontD.rear4【單選題】(10分)Inaqueuetheinsertionsaretakeplaceat_________.A.rearB.topC.NoneoftheaboveD.front5【單選題】(10分)Incircularqueue,thefrontwillalwayspointtooneposition__________fromthefirstelementinthequeue.A.leftB.clockwiseC.counterclockwiseD.right6【單選題】(10分)Whichofthefollowingisnotthetypeofqueue.A.priorityqueueB.doubleendedqueueC.circularqueueD.singleendedqueue7【單選題】(10分)Oneoftheadvantageofcircularqueueis_____________.A.NoneoftheaboveB.effectiveuseofmemoryC.easiercomputationsD.deletingelementsbasedonpriority8【單選題】(10分)Whatisthetimecomplexityofalinearqueuehavingnelements?A.O(nlogn)B.O(logn)C.O(1)D.O(n)9【單選題】(10分)Whatisadequeue?A.AqueueimplementedwithadoublylinkedlistB.Aqueuewithinsert/deletedefinedforfrontendofthequeueC.Aqueuewithinsert/deletedefinedforbothfrontandrearendsofthequeueD.Aqueueimplementedwithbothsinglyanddoublylinkedlist10【單選題】(10分)Onedifferencebetweenaqueueandastackis:A.Queuesrequiredynamicmemory,butstacksdonot.B.Stacksrequiredynamicmemory,butqueuesdonot.C.Stacksusetwoendsforaddinganddeleting,butqueuesuseone.D.Queuesusetwoendsforaddinganddeleting,butstacksuseone.第五章測(cè)試1【單選題】(10分)AlinearlistofdataelementswhereeachelementcallednodeisgivenbymeansofpointeriscalledA.nodelistB.linkedlistC.queueD.stack2【單選題】(10分)Consideranimplementationofunsortedsinglylinkedlist.Supposeithasrepresentationwhichaheadpointeronly.Giventherepresentation,whichofthefollowingoperationcanbeimplementedinO(1)time?(I).Insertionatthefrontofthelinkedlist.(II).Insertionattheendofthelinkedlist.(III).Deletionofthefrontnodeofthelinkedlist.(IV).Deletionofthelastnodeofthelinkedlist.A.IandIIIB.I,II,andIIIC.I,II,andIVD.IandII3【單選題】(10分)Whatisthetimecomplexitytocountthenumberofelementsinthelinkedlist?A.O(1)B.O(n2)C.O(logn)D.O(n)4【單選題】(10分)InwhichofthefollowinglinkedliststherearenoNULLlinks?A.DoublylinkedlistB.NoneoftheaboveC.SinglylinkedlistD.Circularlinkedlist5【單選題】(10分)Indoublylinkedlists,traversalcanbeperformed?A.OnlyinforwarddirectionB.InbothdirectionsC.NoneD.Onlyinreversedirection6【單選題】(10分)Whatkindoflistisbesttoanswerquestionssuchas:“Whatistheitematpositionn?”A.Singly-linkedlistsB.NoneoftheaboveC.Doubly-linkedlistsD.Listimplementedwithanarray7【單選題】(10分)Inasinglylinkedlistwhichoperationdependsonthelengthofthelist.A.DeletethelastelementofthelistB.AddanelementbeforethefirstelementofthelistC.DeletethefirstelementofthelistD.Interchangethefirsttwoelementsofthelist8【單選題】(10分)Thelinkfieldinanodecontains:A.dataofcurrentnodeB.addressofthenextnodeC.dataofnextnodeD.dataofpreviousnode9【單選題】(10分)Linkedlistdatastructureoffersconsiderablesavingin:A.SpaceutilizationB.ComputationaltimeC.SpaceutilizationandcomputationaltimeD.Noneoftheabove10【單選題】(10分)Alinearlistinwhicheachnodehaspointerstopointtothepredecessorandsuccessorsnodesiscalledas:A.CircularlinkedlistB.Singly-linkedlistsC.Doubly-linkedlistsD.Linearlinkedlist第六章測(cè)試1【單選題】(10分)Torepresenthierarchicalrelationshipbetweenelements,whichdatastructureissuitable?A.treeB.arrayC.stackD.queue2【單選題】(10分)Whatisthemaximumnumberchildrenthatabinarytreenodecanhave?A.1B.0C.2D.33【單選題】(10分)TheinordertraversaloftreewillyieldasortedlistingofelementsoftreeinA.NoneoftheaboveB.BinarysearchtreesC.BinarytreesD.Heaps4【單選題】(10分)Ifwestorethenodesofabinarytreeinanarraywithindexstartingfromzero,therightchildofanodehavingindexncanbeobtainedat:A.2n+2B.n+1C.(n-1)/2D.2n+15【單選題】(10分)WhichofthefollowingtraversaloutputsthedatainsortedorderinaBST?A.InorderB.PostorderC.PreorderD.Levelorder6【單選題】(10分)Toobtainaprefixexpression,whichofthefollowingt