Consider a linked list implementation of a queue with two pointers: front and rear. The time needed to insert element in a queue of length n is:

What is the worst-case scenario for mergesort to sort an array of n elements?

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 _______.

A _____ language feature allows users to type commands or requests in normal text phrases.

A _____ key can be described as a minimal superkey, a superkey without any unnecessary attributes.

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.