Branch Wise MCQComputer Science McqsData Structure Data Structure MCQ Page-09 January 26, 2025 DSN MARATHI 81. The easiest sorting is…….. A. quick sort B. shell sort C. heap sort D. selection sort Answer Option : D 82. Which of the following sorting algorithm is of divide and conquer type? A. Bubble sort B. Insertion sort C. Quick sort D. Merge sort Answer Option : C 83. Merging k sorted tables into a single sorted table is called…… A. k way merging B. k th merge C. k+1 merge D. k-1 merge Answer Option : A 84. The function used to modify the way of sorting the keys of records is called…….. A. Indexing function B. Hash function C. Addressing function D. All of the above Answer Option : B 85. If the number of record to be sorted large and the key is short, then …… sorting can be efficient. A. Merge B. Heap C. Radix D. Bubble Answer Option : C 86. The worst case occurs in linear search algorithm when……. A. Item is somewhere in the middle of the array B. Item is not in the array at all C. Item is the last element in the array D. Item is the last element in the array or item is not there at all Answer Option : D 87. The complexity of sorting algorithm measures the …… as a function of the number n of items to be sorter. A. average time B. running time C. average-case complexity D. case-complexity Answer Option : B 88. Which of the following is not a limitation of binary search algorithm? A. must use a sorted array B. requirement of sorted array is expensive when a lot of insertion and deletions are needed C. there must be a mechanism to access middle element directly D. binary search algorithm is not efficient when the data elements more than 1500 Answer Option : D 89. The Average case occurs in linear search algorithm………. A. when item is somewhere in the middle of the array B. when item is not the array at all C. when item is the last element in the array D. Item is the last element in the array or item is not there at all Answer Option : A 90. Binary search algorithm cannot be applied to… A. sorted linked list B. sorted binary trees C. sorted linear array D. pointer array Answer Option : D
81. The easiest sorting is…….. A. quick sort B. shell sort C. heap sort D. selection sort Answer Option : D
82. Which of the following sorting algorithm is of divide and conquer type? A. Bubble sort B. Insertion sort C. Quick sort D. Merge sort Answer Option : C
83. Merging k sorted tables into a single sorted table is called…… A. k way merging B. k th merge C. k+1 merge D. k-1 merge Answer Option : A
84. The function used to modify the way of sorting the keys of records is called…….. A. Indexing function B. Hash function C. Addressing function D. All of the above Answer Option : B
85. If the number of record to be sorted large and the key is short, then …… sorting can be efficient. A. Merge B. Heap C. Radix D. Bubble Answer Option : C
86. The worst case occurs in linear search algorithm when……. A. Item is somewhere in the middle of the array B. Item is not in the array at all C. Item is the last element in the array D. Item is the last element in the array or item is not there at all Answer Option : D
87. The complexity of sorting algorithm measures the …… as a function of the number n of items to be sorter. A. average time B. running time C. average-case complexity D. case-complexity Answer Option : B
88. Which of the following is not a limitation of binary search algorithm? A. must use a sorted array B. requirement of sorted array is expensive when a lot of insertion and deletions are needed C. there must be a mechanism to access middle element directly D. binary search algorithm is not efficient when the data elements more than 1500 Answer Option : D
89. The Average case occurs in linear search algorithm………. A. when item is somewhere in the middle of the array B. when item is not the array at all C. when item is the last element in the array D. Item is the last element in the array or item is not there at all Answer Option : A
90. Binary search algorithm cannot be applied to… A. sorted linked list B. sorted binary trees C. sorted linear array D. pointer array Answer Option : D
