Question

Inal Examination 17. Which of the sorting algorithms listed below has the time fastest best case run (a) Heap sort (b) Merge sort (c) Quick sort (d) Insertion sort 18. Which statement below is false: (a) Quick uick sort and merge sort are divide and conquer algorithte (b) Counting sort is a linear time sorting algorithm. (e) Insertion sort and quicksort have similar best case (d) Generic minimum spanning tree algorithm is 19. Counting sort and radix sort are linked together since not greedy (a) counting sort is a stable sort. (b) counting sort is a linear sort (c) counting sort is a comparison sort. (d) None of the above 20. The array A [17,3,4,5,2, 13, 12 represents a nearly com completed binary tree. Build maximum heap produces which of the following arrays: (a) A-[17,5, 13,3, 2,12,4 (b) A [17,5, 13,3, 2,4, 12 (c) A-[17,5, 12,3, 2,13,4 (d) A [17,3,13,5, 2, 12,4] 21. The worst case asymptotic time to heap sort an array of length n is: (a) O(lg n) (b) O(n) (c) O(n Ig n) (d) None of the above. 22. Which statement below is true: (a) Counting sort is an in place sorting algorithm. (b) Heapify runs in Θ(n). (c) Heapsort is a divide and conquer algorithm (d) Insertion sort's best case run time always runs in fewer steps than Heap Sort

Answer 1

17 d) Insertion sort

insertion sort O(n) in best case where rest of them have O(nlogn )

18 c) insertion sort and quick sort have similar best case asymptotic time complexity .

because insertion sort has O(n) while quick sort has O(nlogn) in best case time complexity

19.b) counting sort is a linear sort

20 b) 17,5,13,3,2,4,12

21 c) O(n logn)

22.d) insertion sort best case run time always runs in fewer step than heap sort