My Courc ReurccLinksIrotructors Conloct unglish n
CS 3303-01 Data Structures -AY2022-T5 L-UtS3/anc/pue 2072-TS/21aty27 uly/alf-ui Unir 6
Started on Wednesday.27 Juy 2022,5 AM
Completed onWednesday.27 Juy 2022.19 AM Time taken 19 mins 47sec Grade 7.00 cut af 10.0070%
The best asymptotic analysis for the selection sort is represented by (select the best option:
Opion 1On logn Oprion 2. (n2 Opson3.On Option 4. 0(n
Marc.0out of
Flag qusfion
Select one Option1 O b.Option2 C uondo d.Option4
er iOption4
Jeon2 Corres
A sort algorithm thatuses tvo nested ioops with the inner loopmoving through the atray.from bottom to top is called the:
Select one: insertion sort b. Bubblesort
Pfig queston
d.Selection son
en 3 nconect
Select one: Insertian sort b. Bubble sort cInversion sort d. Selection sort
Flag question
Corre: M1.0 n af 1.00 Fig quetor
Select one
b Adjacent records in the list and compared and erchanged An irversion is executed The sorting algorithm is aid to be stable
Dueiton5 Corse:t Ma1.00 ain of 1.0 Flag question
two halves are merged is called
Select one a. Mergesort
Quicksort sdH P
The benelit of a quicisort is that it provides cxcellent performance in both the average and worst case
Corre 1.00ouof 1,00
ct one: True
Flag question
gfalse
cn7 Correct Mr 1.00 0 ct 1.03 rig question
What is the role of the pivot in a quicksort algorithm
Select one t identifies the makey value It epacifies the paint where the array will ha eubdivicled into partit it defines the sequence for merging in the sort d. Iitindicates the index of the.curent record being compared
partition then tort
A sorting algorithm that a
incorrect 0.00ou of 1.00 :Flig question
Select one Fadix Sort b.Quicksort
d.Bucket sort
conect answer isBucket sor
Corret 1.00 ocf 1.00 Plag quesficn
On logn Opion2. n2 Opion 3. 0(n2 (n2
Select oner
0b.Option2
dOption4
The correct answer isOption
Carrer
Priag queston
True
False
Finish r