文档介绍：《DataStructureandAlgorithms》A试卷诚信应考,考试作弊将带来严重后果!华南理工大学期末考试《DataStructureandAlgorithms》试卷A注意事项:;;:闭卷;,满分100分,考试时间120分钟。.(20scores,each2scores)(1)Ifadataelementrequires8bytesandapointerrequires2bytes,thenalinkedlistrepresentationwillbemorespaceefficientthanastandardarrayrepresentationwhenthefractionofnon-nullelementsislessthanabout:(A)(A)4/5(B)1/4(C)4/7(D)3/4(2)Pickthegrowthratethatcorrespondstothemostinefficientalgorithmasngetslarge:(D)(A)2n3(B)2n(C)10n2logn(D)n!(3)AnalgorithmmustbeordoallofthefollowingEXCEPT:(B)(A)Partiallycorrect(B)Ambiguous(C)Terminate(D)Concretesteps(4)Whichstatementisnotcorrectamongthefollowingfour:(C)(A)TheQuick-sortisanunstablesortingalgorithm.(B)Thenumberofemptysub-treesinanon-emptyfullbinarytreeisonemorethanthenumberofnodesinthetree.(C)inglargerandlargerbecausethatistheslowest.(D)Aclusteristhesmallestunitofallocationforafile,upyamultipleoftheclustersize.(5)Whichalgorithmisusedtogeneraterunsinclassicexternalsorting?(A)(A)Replacementselection(B)Bubblesort(C)Insertionsort(D)Quick-sort(6)Whichofthefollowingisatruestatement:(C)(A)Ageneraltreecanbetransferredtoabinarytreewiththeroothavingbothleftchildandrightchild.(B)InaBST,thenodecanbeenumeratedsortedbyapreordertraversaltotheBST.(C)InaBST,theleftchildofanynodeislessthantherightchild,butinaheap,_____________________…姓名