Data structures and Algorithms MCQ with Answers

Data structures and Algorithms MCQ with Answers

136) A sort which compares adjacent elements in a list and switches where necessary is

Answer is:

bubble sort

137) A sort which iteratively passes through a list to exchange the first element with any element less than it and then repeats with a new first element is called

Answer is:

selection sort

138) Which of the following statements is used in the binary search algorithm to halve the array ?

Answer is:

middle Sub = (start Sub + stop Sub)/2;

139) The data for which you are searching is called

Answer is:

search argument

140) If the binary search algorithm determines that the search argument is in the lower half of the array, which of the following statements will, set the appropriate variable to the appropriate value

Answer is:

start Sub = middle Sub + 1;

25
26
27
28
29
30
31