算法题库及答案 英文版.docVIP

算法题库及答案英文版

MultipleChoiceQuestions(10questions,2pointseach)

1.Whatisthetimecomplexityofalinearsearchintheworstcase?

-A.O(1)

-B.O(n)

-C.O(n^2)

-D.O(logn)

-Answer:B.Inalinearsearch,intheworstcase,weneedtocheckeveryelementinthelist,sothetimecomplexityisproportionaltothenumberofelementsn,whichisO(n).

2.WhichsortingalgorithmhasanaveragetimecomplexityofO(nlogn)?

-A.Bubblesort

-B.Insertionsort

-C.Quicksort

-D.Selectionsort

-Answer:C.QuicksorttypicallyhasanaveragetimecomplexityofO(nlogn)asitdividesthearrayintotwosub-arraysandrecursivelysortsthem.

3.Whatdatastructureisbestforimplementingapriorityqueue?

-A.Array

-B.Linkedlist

-C.Stack

-D.Heap

-Answer:D.Aheapcanefficientlyimplementapriorityqueueasitallowsforquickaccesstotheelementwiththehighest(orlowest)priority.

4.Whichofthefollowingisastablesortingalgorithm?

-A.Mergesort

-B.Quicksort

-C.Heapsort

-D.Selectionsort

-Answer:A.Mergesortisstablebecauseitpreservestherelativeorderofequalelementsduringthesortingprocess.

5.Whatisthespacecomplexityofarecursivefunctionthatcallsitselfntimeswithoutanyadditionaldatastructures?

-A.O(1)

-B.O(n)

-C.O(n^2)

-D.O(logn)

-Answer:B.Eachrecursivecalladdsanewstackframe,andsinceitcallsitselfntimes,thespacecomplexityisO(n).

6.Inabinarysearchtree,whatistheworst-casetimecomplexityforsearchinganelement?

-A.O(1)

-B.O(n)

-C.O(n^2)

-D.O(logn)

-Answer:B.Intheworst-casescenario,abinarysearchtreecandegenerateintoalinkedlist,andthensearchingtakesO(n)time.

7.Whichalgorithmisusedtofindtheshortestpathinaweightedgraph?

-A.Dijkstrasalgorithm

-B.Depth-firstsearch

-C.Breadth-firstsearch

-D.Krus