Suppose we have a circular array implementation of a queue, with ten items in the queue stored at data[2] through data[11]. The CAPACITY is 42. Where does the push member function place the new entry in the array?

Which of the following sorting algorithms yield approximately the same worst-case and average-case running time behavior in O(n*log(n))?

The operation for adding an entry to a stack is traditionally called ________.

For a complete binary tree with depth d, the total number of nodes is:

Which of the following is false?

Which of the following applications may use a stack?

A three-dimensional array can be thought of as ________ of two-dimensional arrays.

Data can be organized and processed sequentially using an array, called a(n) ____ list.

Selection sort requires ________ passes to put n data items in order.

To describe a queuing system, we use the term ____ for the object that provides the service.

The priming read is an example of a(n) ____ task.