Consider a hashing function that resolves collision by quadratic probing. Assume that the address space is indexed from 1 to 8. If a collision occurs at position 4, the location which will never be probed is:

In which data structure is the concept of rotation used?

You have implemented a queue with a circular array keeping track of the first, the last, and the count (the number of items in the array). Suppose the first is zero, and the last is CAPACITY-1, what can you say about the count?

A procedure that calls itself in a program is called _______.

State whether True or False. For all possible inputs, a linear algorithm to solve a problem must perform faster than a quadratic algorithm to solve the same problem.

If a max heap is implemented using a partially filled array called data, and the array contains n elements (n > 0), where is the entry with the greatest value?

A ____ connection is one in which both sender and receiver may transmit at the same time.

________ is a data structure to store data in sequential order.

________ allows for very recent file changes to be restored.

________ algorithms are used to arrange random data into some order.

____ methods are methods that exist to be used with an object created from a class.