University:
California State University, Northridge
Course:
COMP 182 | Data Structures and Program Design and Lab
Academic year:

2022
Views:

15

Pages:

8
Author:

NyiH

Question 1 How many passes does an insertion sort algorithm consist of? ON N-1 N+1 N^2 Question 2 What is the average case running time of an insertion sort algorithm OINI OIN log N) Clkie N OIN 21 Question 3 Wat is the ruming time of an insertion sort algorithm if the input is pre-corte ON 2) OIN tog NI DOM log N Question 4 1 What will be the amber of potses to sort the elements using inertion sort? 14.12.16. 6. 2. 10 5 Question 5 For the following questiom. how will the array elements look like after secand pars 14. 8. 64,51.32.21 821.32.34,51.64 8.32.345164.21 6345164,32.21 34.64.51.32:21 Question 6 Which of the following mal time exingtes is based on insertion sort database scmacies and distributes scenacios arranging books analbrary shelf mal-time system Question 7 Which of the follthwing exampling represent the worst cave input for an insertion sort array serted in inverse onder normal unsorted aray large array Question 8 in the following scmarim, when will you une selection mrt? The input is really vertal Alirge file has to be surted Large values need to be sorted with small heys Small values need to be sorted with keys Question 9 What is the advantage of selection sort over other sorting lethniques? It requires no additional storage space It works best for inputs which are already sorted It is faster than any uther sorting technique Question 10 What is the disadvantage of selection sort? It requires auxiliary memory It is not scalable It can be used for small keys It takes linear time to sort the elements Question 11 What is the best case complexity of selection sort? O(nlogn) O(logn) On O(n^2) Question 12 What is an external sorting algorithm? Algorithm that uses tape or disk during the sort Algorithm that uses main memory during the sort Algorithm that involves swapping Algorithm that are considered in place Question 13 The given array is arr = [1, 2, 4, 3). Bubble sort is used to sort the array elements. How many iterations will be done to sort the array? 4 2 01 00 Question 14 Which of the following is good for sorting arrays having less than 100 elements? Quick Sort Selection Sort Merge Sort Insertion Sort Question 15 Which of the following is not an exchange sort? Bubble Sort Quick Sort Partition-exchange Sort Insertion Sort