COS1521 Assignment 3 (COMPLETE ANSWERS) 2024 (532267) - DUE 22 July 2024

BEST COS1521
COS1521
Assignment 3
(COMPLETE
ANSWERS) 2024
(532267) - DUE 22
July 2024 ; 100%
TRUSTED Complete,
trusted solutions and
explanations

,COS1521 Assignment 3 (COMPLETE ANSWERS) 2024 (532267)
- DUE 22 July 2024 ; 100% TRUSTED Complete, trusted
solutions and explanations.
Question 1 Complete Marked out of 1.00

Suppose a list contains the following elements: 27, 37, 7. What is the order of
the elements in the list after three passes when selection sort is used?

In selection sort, we repeatedly find the minimum element from the unsorted part
and move it to the beginning. Here’s the step-by-step process:

1. First pass: Find the smallest element in the list (7) and swap it with the first
element (27).
o List after first pass: 7, 37, 27
2. Second pass: Find the smallest element in the remaining unsorted part (27
and 37). The smallest is 27, so we swap it with the second element (37).
o List after second pass: 7, 27, 37
3. Third pass: The remaining part has only one element (37), which is already
in its correct position.
o List after third pass: 7, 27, 37


So, the order of the elements after three passes is: 7, 27, 37

Answer: None of the provided options are correct.




Question 2 Complete Marked out of 1.00 QUIZ Suppose a list contains the
following elements: 27 37 7 What is the order of the elements in the list
after three passes when selection sort is used? a. 27 37 71 b. 73 77 37 c.
73 37 71 d. 73 47 71 Which of the following statements regarding sorting
algorithms is TRUE? a. Insertion sort is the most effi cient sorting algorithm.
b. Selection sort is more effi cient than bucket sort. c. Heap sort is less suffi
cient than bubblesort. d. Merge sort is more effi cient that selection sort.

Which of the following statements regarding sorting algorithms is TRUE?

, a. Insertion sort is the most efficient sorting algorithm.
b. Selection sort is more efficient than bucket sort.
c. Heap sort is less efficient than bubble sort.
d. Merge sort is more efficient than selection sort.

Explanation:

 a. This statement is false. Insertion sort is not the most efficient sorting
algorithm, especially for large datasets.
 b. This statement is false. Bucket sort is generally more efficient than
selection sort for large datasets with a uniform distribution.
 c. This statement is false. Heap sort is generally more efficient than bubble
sort.
 d. This statement is true. Merge sort has a time complexity of O(n log n),
which is generally more efficient than selection sort’s O(n^2) for large
datasets.

Answer: d. Merge sort is more efficient than selection sort.




Question 3 Complete Marked out of 1.00

Which one of the following statements is NOT true regarding selection sort?

a. The list to be sorted is divided into two sublists – sorted and unsorted.
b. A sort pass is defined as moving an element from the unsorted sublist to the sorted sublist.
c. If we have a list of 20 elements to be sorted, it will take 19 passes to get the list sorted.
d. Selection sort is faster than merge sort and bucket sort.

Explanation:

 a. True. Selection sort divides the list into a sorted sublist and an unsorted sublist.
 b. True. Each pass in selection sort involves moving an element from the unsorted sublist
to the sorted sublist.
 c. True. It takes n−1n-1n−1 passes to sort a list of nnn elements.
 d. False. Selection sort is not faster than merge sort and bucket sort for large datasets.
Merge sort has a time complexity of O(nlog⁡n)O(n \log n)O(nlogn), which is better than
the O(n2)O(n^2)O(n2) time complexity of selection sort.

Answer: d. Selection sort is faster than merge sort and bucket sort.