Data structures and Algorithms MCQ with Answers

Data structures and Algorithms MCQ with Answers

151) The way a card game player arranges his cards as he picks them up one by one, is an example of

Answer is:

insertion sort

152) You want to check whether a given set of items is sorted. Which of the following sorting methods will be most efficient if it is already in sorted order

Answer is:

Insertion sort

153) The average number of comparisons performed by the merge sort algorithm, in merging two sorted liss of length 2 is

Answer is:

43898

154) Which of the following sorting methods will be the best if number of swappings done, is the only measure of efficiency

Answer is:

Selection sort

155) You are asked to sort 15 randomly generated numbers. You should prefer

Answer is:

bubble sort