retagged by
1,167 views
1 votes
1 votes

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)?

  1. Both operations can be performed in $O(1)$ time.
  2. At most one operation can be performed in $O(1)$ time but the worst case time for the other operation will be $\Omega(n)$.
  3. The worst case time complexity for both operations will be $\Omega(n)$.
  4. Worst case time complexity for both operations will be $\Omega(\log n)$.
retagged by

3 Answers

Answer:

Related questions

4 votes
4 votes
3 answers
4