Open In App

GATE | GATE-CS-2016 (Set 1) | Question 20

Like Article
Like
Save
Share
Report

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 other operation will be Ω(n)

(C)

The worst case time complexity for both operations will be Ω(n)

(D)

Worst case time complexity for both operations will be Ω(log n)



Answer: (A)

Explanation:

We can use circular array to implement both in O(1) time. See below article for details.  

Hence Option (D) is the correct answer.


Quiz of this Question
Please comment below if you find anything wrong in the above post


Last Updated : 12 Aug, 2021
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads