Which of the following algorithms calls itself with smaller inputs, and obtains the outputs for the current input by applying simple operations to the returned value of the smaller input?

Which of the following sorts assumes that each of the n elements is an integer in the range 0 to k, for some integer k?

In which of the following schemes, the interval between probes is increased by adding the successive outputs of a polynomial to the starting value given by the original hash computation?

Which of the following is defined as a graph with no path and starts and ends at the same vertex?

Which of the following is defined as the amount of memory that an algorithm needs?

In which of the following hashing schemes, the storage space allocated to the file can be increased or decreased without recognizing the whole file?

In which of the following sorts, we recursively chop the list into two sublist of almost equal sizes and when we get lists of size one, then start sorted combining of list in the reverse order?

In which of the following data structures, every level, except possibly the last, is totally filled, and all nodes are as far left as possible?

Which of the following lists is implemented as an array of lists with one list of destination nodes for each source node?

In which of the following matrices, the rows represent the vertices and columns represent the edges?

Which of the following algorithms simply tries all possibilities until a satisfactory solution is found?

Which of the following is a function that describes the time of execution of an algorithm based on its input parameters?

In which of the following hashings, the hash functions are describe as h2(key) is not equal to zero and h2 is not equal to h1 where h1 and h2 are first and second hash functions?

Which of the following sorts can be viewed abstractly in terms of decision trees?

Which of the following stores the previous results and uses them to find new ones?