Q10

MCQ1 mark, −0.33

A queue is implemented using an array such that ENQUEUE and DEQUEUE operations are performed efficiently. Which one of the following statements is CORRECT ( $n$ refers to the number of items in the queue) ?

(A)

Both operations can be performed in $O(1)$ time.

(B)

At most one operation can be performed in $O(1)$ time but the worst case time for the operation will be $\Omega (n)$ .

(C)

The worst case time complexity for both operations will be $\Omega (n)$ .

(D)

Worst case time complexity for both operations will be $\Omega (\log n)$

Loading…