adplus-dvertising
frame-decoration

Question

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

a.

n/2

b.

(n+1)/2

c.

(n-1)/2

d.

None of these

Answer: (b).(n+1)/2

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

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

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

Q. Which of the following sorting method is stable ?

Q. Which of the following best describes sorting ?

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

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

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

Q. The data for which you are searching is called

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?

Q. Which of the following is false ?

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

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

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

Q. Sorting is useful for

Q. Choose the correct statements

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

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

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?

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

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