Skip to content
Related Articles

Related Articles

Data Structures | Queue | Question 10

Improve Article
Save Article
  • Difficulty Level : Medium
  • Last Updated : 28 Jun, 2021
Improve Article
Save Article

Consider the following operation along with Enqueue and Dequeue operations on
queues, where k is a global parameter.

   m = k
   while (Q is not empty and m  > 0) {
      m = m - 1

What is the worst case time complexity of a sequence of n MultiDequeue() operations on an initially empty queue? (GATE CS 2013)
(A) \Theta(n)
(B) \Theta(n + k)
(C) \Theta(nk)
(D) \Theta(n^2)

(A) A
(B) B
(C) C
(D) D

Answer: (A)

Explanation: Since the queue is empty initially, the condition of while loop never becomes true. So the time complexity is \Theta(n).

Quiz of this Question

My Personal Notes arrow_drop_up
Related Articles

Start Your Coding Journey Now!