Data structures and Algorithms MCQ with Answers

Data structures and Algorithms MCQ with Answers

156) As part of the maintenance work, you are entrusted with the work of rearranging the library books in a shelf in proper order, at the end of each day. The ideal choice will be

Answer is:

insertion sort

157) The maximum number of comparisons needed to sort 7 items using radix sort is (assume each item is 4 digit decimal number)

Answer is:

280

158) Which of the following algorithms exhibits the unnatural behavior that, minimum number of comparisons are needed if the list to be sorted is in the reverse sorted order and maximum number of comparisons are needed if they are already in sorted order

Answer is:

Binary insertion sort

159) Which of the following sorting algorithm has the worst time complexity of nlog(n)

Answer is:

Heap sort

160) Which of the following sorting methods sorts a given set of items that is already in sorted order or in reverse sorted order with equal speed

Answer is:

Quick sort