GATE | GATE CS 2013 | Question 44

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

MultiDequeue(Q){
   m = k
   while (Q is not empty and m  > 0) {
      Dequeue(Q)
      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: See http://quiz.geeksforgeeks.org/data-structures-queue-question-10-2/

Quiz of this Question



My Personal Notes arrow_drop_up


Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.