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)? 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 $\Omega(n)$. The worst case time complexity for both operations will be $\Omega(n)$. Worst case time complexity for both operations will be $\Omega(\log n)$. DS nielit2017july-scientistb-cs data-structures queue + – admin asked Mar 30, 2020 retagged Oct 28, 2020 by Krithiga2101 admin 1.2k views answer comment Share Follow See 1 comment See all 1 1 comment reply haralk10 commented Apr 2, 2020 reply Follow Share https://gateoverflow.in/39667/gate2016-1-10 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes i think A is the answer Himanshu Kumar Gupta answered Aug 24, 2020 Himanshu Kumar Gupta comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes a is answer both takes O(1) Pintusaini answered Jul 27, 2021 Pintusaini comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes 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 RajKamal answered Oct 18, 2021 RajKamal comment Share Follow See all 0 reply Please log in or register to add a comment.