Q. A sort which compares adjacent elements in a list and switches where necessary is

View solution

Q. 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

View solution

Q. Which of the following statements is used in the binary search algorithm to halve the array ?

View solution

Q. The data for which you are searching is called

View solution

Q. 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?

View solution

Q. Which of the following is false ?

View solution

Q. The number of swappings needed to sort the numbers 8, 22, 7, 9, 31, 19, 5, 13 in ascending order, using bubble sort is

View solution

Q. The average successful search time taken by binary search on a sorted array of 10 items is

View solution

Q. The average successful search time for sequential search on 'n' items is

View solution

Q. Sorting is useful for

View solution

Q. Choose the correct statements

View solution

Q. A sorting technique that guarantees that records with the same primary key occurs in the same order in the sorted list as in the original unsorted list is said to be

View solution

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

View solution

Q. 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?

View solution

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

View solution

Q. Which of the following sorting methods will be the best if number of swappings done, is the only measure of efficienty?

View solution

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

View solution

Q. 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

View solution

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

View solution

Q. Where is linear searching used?

View solution