Q. The average time required to perform a successful sequential search for an element in an array A(1 : n) is given by

View solution

Q. Which of the following is false ?

View solution

Q. A search begins the search with the element that is located in the middle of the array

View solution

Q. To sort many large object or structures, it would be most efficient to

View solution

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

View solution

Q. Suppose DATA array contains 1000000 elements. Using the binary search algorithm, one requires only about n comparisons to find the location of an item in the DATA array, then n is

View solution

Q. Which of the following sorting procedure is the slowest ?

View solution

Q. Which of the following sorting method is stable ?

View solution

Q. Which of the following best describes sorting ?

View solution

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