Queues
Question 1 |
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)?
Both operations can be performed in O(1) time | |
At most one operation can be performed in O(1) time but the worst case time for the other operation will be Ω(n) | |
The worst case time complexity for both operations will be Ω(n) | |
Worst case time complexity for both operations will be Ω(logn) |
Question 1 Explanation:
Since it is mentioned in the question that both of the operations are performed efficiently.
Hence even the worst case time complexity will be O(1) by the use of the Circular queue there won't be any need of shifting in the array.
Hence even the worst case time complexity will be O(1) by the use of the Circular queue there won't be any need of shifting in the array.
There is 1 question to complete.