129) A matrix "a" is called lower triangular if and only if for all j > i, aij= 0. If such a matrix is to be sorted in a one dimensional array, A, then aij could be mapped to which of the following index of A ?

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

131) The average search time of hashing, with linear probing will be less if the load factor

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

133) Which of the following sorting procedure is the slowest