NIELIT 2017 July Scientist B (CS) - Section B: 10

Question

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 $\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)$.

Comments

https://gateoverflow.in/39667/gate2016-1-10

Answer 1

i think A is the answer

Answer 2

a is answer both takes O(1)

Answer 3

A is the answer.

 

Refer following Links:

https://www.sqa.org.uk/e-learning/ArrayDS02CD/page_14.htm

GATE CSE 2016 Set 1 | Question: 10 - GATE Overflow