Dashboard / My courses / g CS 3303-01 - AY2022-T5 / 21 July - 27 July / Self-Quiz Unit 6
Started on Saturday, 23 July 2022, 11:46 AM State Finished Completed on Saturday, 23 July 2022, 11:49 AM Time taken 2 mins 59 secs Grade 10.00 out of 10.00 (100%)
Question 1 Correct
Mark 1.00 out of 1.00
The best asymptotic analysis for the selection sort is represented by (select the best option): Option 1. O(n log n)
Option 2. Q(n2)
Option 3. O(n2)
Option 4. O(n2)
Select one: O a. Option 1 O b. Option 2 O c. Option 3 O d. Option 4
The correct answer is: Option 4
Question 2
Correct
Mark 1.00 out of 1.00
A sort algorithm that uses two nested loops with the inner loop moving through the array from bottom to top is called the:
Select one: O a. Insertion sort O b. Bubble sort O c. Inversion sort O d. Selection sort
The correct answer is: Bubble sort
Question 3 Correct Mark 1.00 out of 1.00
A sort that features a limit of n-1 of record swaps is called:
Select one: O a. Insertion sort O b. Bubble sort O c. Inversion sort O d. Selection sort
The correct answer is: Selection sort
Question 4 Correct Mark 1.00 out of 1.00
An exchange sort is one where: (select the best answer)
Select one: O a. Records in an unsorted list are moved to a sorted list
O b. Adjacent records in the list and compared and exchanged O c. An inversion is executed O d. The sorting algorithm is said to be stable
The correct answer is: Adjacent records in the list and compared and exchanged
Question 5 Correct Mark 1.00 out of 1.00
A sort where the list is divided into halves, the halves sorted and these two halves are merged is called:
Select one: O a. Mergesort O b. Binary sort O c. Quicksort O d. Heapsort
The correct answer is: Mergesort
Question 6 Correct Mark 1.00 out of 1.00
The benefit of a quicksort is that it provides excellent performance in both the average and worst case:
Select one: O True
O False v
The correct answer is'False'.
Question 7 Correct Mark 1.00 out of 1.00
What is the role of the pivot in a quicksort algorithm?
Select one: O a. It identifies the maxkey value O b. It specifies the point where the array will be subdivided into partitions and each partition then sorted O c. It defines the sequence for merging in the sort O d. It indicates the index of the current record being compared
The correct answer is: It specifies the point where the array will be subdivided into partitions and each partition then sorted
Question 8 Correct Mark 1.00 out of 1.00
A sorting algorithm that assigns records to bins and then relies on some other sorting technigue to sort the records within each bin called:
Select one: O a. Radix Sor