Select all the options below that are true about ArrayQueues. $($Ignore amortization.$)$

Note:

just means $"$

but not smaller than

$".$ E$.$g$.$

is an upper bound so technically something that is constant time is still O$($n$).$ That's not usually how I $($or computer scientists in general$)$ use it$,$ but I'll try to be precise.

If you're uncomfortable with

you can probably just think of it as

and you'll probably be using it the way I intend it :-) If you have questions or concerns about big$-$Theta vs$.$ big$-$Oh$,$ you might consider looking at the Week $0$ algorithms analysis primer slides or video.

Question $2$ options:

a$)$

You cannot insert at the "front" of an ArrayQueue.

b$)$

ArrayQueues have

$($i$.$e$.$ bad$)$ removes from the front.

c$)$

You cannot access arbitrary indices of an ArrayQueue.

d$)$

You can add to the back of an ArrayQueue.

e$)$

You cannot remove from the back of an ArrayQueue.

f$)$

ArrayQueue's backing storage is a single array of fixed size, so repeated insertions will sooner or later require a resize of that array.