1. In an array-based implementation of a queue, inserting and deleting entries is accomplished using this arithmetic operation, ________, in order to maximize the capacity of the queue.

2. What is the relationship between time vs. space complexity? Whats more important, time or space complexity? Explain.

3. While studing ADTs, describe a situation where you potentially could access a reference that is null? What would happen if you actually reference it?

4.What concerns might you have, if you have an O(log n) routine running and your data is about to double in size? Explain.