is putting an element in the appropriate place
in a sorted list yields a larger sorted order list.
Answer:
Insertion
Extraction
O
Insertion
Selection
Extraction
Distribution
Distribution
Selection
Answers
Insertion - putting an element in the appropriate place in a sorted list yields a larger sorted list. Exchange or Bubble - rearrange pairs of elements which are out of order, until no such pairs remain.
Insertion sort runs much more efficiently if the array is already sorted or "close to sorted." Selection sort always performs O(n) swaps, while insertion sort performs O(n2) swaps in the average and worst case. Selection sort is preferable if writing to memory is significantly more expensive than reading
A sorting algorithm will put items in a list into an order, such as alphabetical or numerical order. ... Sorting a list of items can take a long time, especially if it is a large list. A computer program can be created to do this, making sorting a list of data much easier.
Quicksort. Quicksort is one of the most efficient sorting algorithms, and this makes of it one of the most used as well. The first thing to do is to select a pivot number, this number will separate the data, on its left are the numbers smaller than it and the greater numbers on the right.
Skip to Main Content
FacebookTwitterGoogle PlusInstagramPinterestBlogLovinRSSLinkedIn
InfoTechSite
CS/IT MCQS
SOLVED MCQ ON SEARCHING AND SORTING ALGORITHMS IN DATA STRUCTURE SET-2
APRIL 28, 2017
Solved MCQ on Searching and Sorting Algorithms
In this set of Solved MCQ on Searching and Sorting Algorithms in Data Structure, you can find MCQs of the binary search algorithm, linear search algorithm, sorting algorithm, Complexity of linear search, merge sort and bubble sort and partition and exchange sort.
1) The worst-case occur 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
2) If the number of records to be sorted is small, then …… sorting can be efficient.
A. Merge
B. Heap
C. Selection
D. Bubble
3) The complexity of the 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
4) 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.
5) The Average case occurs in the linear search algorithm ……….
A. when the item is somewhere in the middle of the array
B. when the item is not the array at all
C. when the item is the last element in the array
D. Item is the last element in the array or item is not there at all
6) Binary search algorithm cannot be applied to …
A. sorted linked list
B. sorted binary trees
C. sorted linear array
D. pointer array
7) Complexity of linear search algorithm is ………
A. O(n)
B. O(logn)
C. O(n2)
D. O(n logn)
8) Sorting algorithm can be characterized as ……
A. Simple algorithm which require the order of n2 comparisons to sort n items.
B. Sophisticated algorithms that require the O(nlog2n) comparisons to sort items.
C. Both of the above
D. None of the above
9) The complexity of bubble sort algorithm is …..
A. O(n)
B. O(logn)
C. O(n2)
D. O(n logn)
10) State True or False for internal sorting algorithms.
i) Internal sorting are applied when the entire collection if data to be sorted is small enough n sort
C. Merge sort
D. Selection sort
17) …….. sorting algorithm is frequently used when n is small where n is total number of