[Solved]L Multiple Choices Circle Correct Answer 5 Points 1 Following Sorting Algorithms Typical I Q37077167

L. Multiple Choices (circle the correct answer, 5 points each) 1. Which of the following sorting algorithms in its typical implementation gives performance when applied on an array which is sorted or almost sorted (maximum 1 or two elements are misplaced) (A) Quick Sort (B)Heap Sort (C) Merge Sort (D) Insertion Sort 2. Suppose we are sorting an array of eight integers using quicksort, and we have just finishesd the first partitioning with the array looking like this: 2, 5, 1,7,9, 12, 11. 10. Which statement is correct? (A) The pivot could be either 7 or 9. (B) The pivot is 7 (C) The pivot is 9 (D) The pivot is neither 7 nor 9 algorithms is most efficient to sort string consisting of ASCII characters? (B) Heap sort (C) Merge sort (D) Counting sort 3. Which sorting (A) Quick sort 4. In quick sort, for sorting n elements, the (n (n) time algorithm. What is the worst case time complexity of the quick sort? (A) e(n) (D) (n log n) (B) e (n logn) (C) (n2) 5. Which of the following is NOT true about comparison based sorting algorithms? le time complexity of a comparison based sorting algorithm is On logn) for a random input array (B) Any comparison based sorting algorithm can be made stable by using position as a criteria when two elements are compared (C) Counting Sort is not a comparison based sorting algortihm (D) Heap Sort is not a comparison based sorting algorith 6. Which of the following sorting algorithms in its typical implementation gives best performance when applied on an array which is sorted or almost sorted (maximum 1 or two elements are misplaced) (A) Quick Sort (B) Heap Sort (C) Merge Sort (D) Insertion Sort 7. Which sorting algorithm will take least time when all elements of input array are identical? Consider typical implementations of sorting algorithms (A) Insertion Sort (B) Heap Sort (C) Merge Sort (D) Quick Sort 8. Which sorting algorithms is most efficient to sort string consisting of ASCII characters? (A) Quick Sort (C) Merge Sort (D) Counting Sort (B) Heap Sort Show transcribed image text L. Multiple Choices (circle the correct answer, 5 points each) 1. Which of the following sorting algorithms in its typical implementation gives performance when applied on an array which is sorted or almost sorted (maximum 1 or two elements are misplaced) (A) Quick Sort (B)Heap Sort (C) Merge Sort (D) Insertion Sort 2. Suppose we are sorting an array of eight integers using quicksort, and we have just finishesd the first partitioning with the array looking like this: 2, 5, 1,7,9, 12, 11. 10. Which statement is correct? (A) The pivot could be either 7 or 9. (B) The pivot is 7 (C) The pivot is 9 (D) The pivot is neither 7 nor 9 algorithms is most efficient to sort string consisting of ASCII characters? (B) Heap sort (C) Merge sort (D) Counting sort 3. Which sorting (A) Quick sort 4. In quick sort, for sorting n elements, the (n (n) time algorithm. What is the worst case time complexity of the quick sort? (A) e(n) (D) (n log n) (B) e (n logn) (C) (n2) 5. Which of the following is NOT true about comparison based sorting algorithms? le time complexity of a comparison based sorting algorithm is On logn) for a random input array (B) Any comparison based sorting algorithm can be made stable by using position as a criteria when two elements are compared (C) Counting Sort is not a comparison based sorting algortihm (D) Heap Sort is not a comparison based sorting algorith 6. Which of the following sorting algorithms in its typical implementation gives best performance when applied on an array which is sorted or almost sorted (maximum 1 or two elements are misplaced) (A) Quick Sort (B) Heap Sort (C) Merge Sort (D) Insertion Sort 7. Which sorting algorithm will take least time when all elements of input array are identical? Consider typical implementations of sorting algorithms (A) Insertion Sort (B) Heap Sort (C) Merge Sort (D) Quick Sort 8. Which sorting algorithms is most efficient to sort string consisting of ASCII characters? (A) Quick Sort (C) Merge Sort (D) Counting Sort (B) Heap Sort

Expert Answer

---

Answer to L. Multiple Choices (circle the correct answer, 5 points each) 1. Which of the following sorting algorithms in its typic… . . .