Branch Wise MCQComputer Science McqsData Structure Data Structure MCQ Page-08 January 26, 2025 DSN MARATHI 71. Which of the following is an external sorting? A. Insertion Sort B. Bubble Sort C. Merge Sort D. Tree Sort Answer Option : C 72. Very slow way of sorting is………. A. Insertion sort B. Heap sort C. Bubble sort D. Quick sort Answer Option : A 73. Which of the following is an internal sorting? A. Tape Sort B. 2-way Merge Sort C. Merge Sort D. Tree Sort Answer Option : D 74. Sorting a file F usually refers to sorting F with respect to a particular key called….. A. Basic key B. Primary key C. Starting key D. Index key Answer Option : B 75. The time complexity of quick sort is…….. A. O(n) B. O(logn) C. O(n2) D. O(n logn) Answer Option : D 76. Selection sort first finds them ………. element in the list and put it in the first position A. Middle element B. Largest element C. Last element D. Smallest element Answer Option : D 77. Quick sort is also known as…….. A. merge sort B. tree sort C. shell sort D. partition and exchange sort Answer Option : D 78. The operation that combines the element is of A and B in a single sorted list C with n=r+s element is called… A. Inserting B. Mixing C. Merging D. Sharing Answer Option : C 79. A tree sort is also known as ……… sort. A. quick B. shell C. heap D. selection Answer Option : C 80. … sorting is good to use when alphabetizing large list of names A. Merge B. Heap C. Radix D. Bubble Answer Option : C
71. Which of the following is an external sorting? A. Insertion Sort B. Bubble Sort C. Merge Sort D. Tree Sort Answer Option : C
72. Very slow way of sorting is………. A. Insertion sort B. Heap sort C. Bubble sort D. Quick sort Answer Option : A
73. Which of the following is an internal sorting? A. Tape Sort B. 2-way Merge Sort C. Merge Sort D. Tree Sort Answer Option : D
74. Sorting a file F usually refers to sorting F with respect to a particular key called….. A. Basic key B. Primary key C. Starting key D. Index key Answer Option : B
75. The time complexity of quick sort is…….. A. O(n) B. O(logn) C. O(n2) D. O(n logn) Answer Option : D
76. Selection sort first finds them ………. element in the list and put it in the first position A. Middle element B. Largest element C. Last element D. Smallest element Answer Option : D
77. Quick sort is also known as…….. A. merge sort B. tree sort C. shell sort D. partition and exchange sort Answer Option : D
78. The operation that combines the element is of A and B in a single sorted list C with n=r+s element is called… A. Inserting B. Mixing C. Merging D. Sharing Answer Option : C
80. … sorting is good to use when alphabetizing large list of names A. Merge B. Heap C. Radix D. Bubble Answer Option : C
