Java Foundations

Using Big-O notation, give the running time of the circular array implementations of each of the following queue operations. Assume an optimal implementation.

(A) enqueue(item)

(B) dequeue()

(C) peek()

(D) size()

(E) isEmpty()

(F) clear() (Assume the array elements are nulled out by this operation.)

Multiple Choice options:

a. O(1)

b. O(log n)

c. O(n)

d. O(n log n)

e. O(n^2)

f. O(n^3)

g. O(n!)