Which of the following is a dynamically updateable disk based index structure, which implements a hashing scheme and grows or shrink one bucket at a time?

Which of the following is a special case of tree, where no node of a tree can have a degree more than two?

Which of the following sorts solves the problem of card sorting counterintuitively by sorting on the least significant digit first?

Which of the following expresses the lower bound of the running time of an algorithm?

If information like cost is associated to the traversal of an edge, then what is the graph called?

Which of the following hashings achieves its goal by merging the concepts of a radix search tree and hashing?

Which of the following sorts runs linear time, when input is drawn from a uniform distribution?

Which of the following asymptotic notations represents the upper bound and the lower bound of the running time of an algorithm?

In which of the following, we start searching the hash table sequentially from the beginning of the original hash location, and if a location is occupied, we check the next location?

Which of the following is the method of expressing the loose lower bounds of the running time of an algorithm?

Which of the following graphs has more than one edge between the same two vertices?

If the number of edges are far less than square of modulus of vertex, then what is the graph called?

Which of the following functions is used for expressing the upper bound of the running time of an algorithm?

By which of the following schemes, primary clustering problem can be almost eliminated?

In which of the following sorts, division into sublist is done through the choice and use of a pivot value, which is a value in the given list so that all values in the list less than the pivot and the rest in the other list?