Related Articles

Related Articles

GATE | GATE CS 2013 | Question 44
  • Difficulty Level : Medium
  • Last Updated : 18 Oct, 2013

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: See

Quiz of this Question


My Personal Notes arrow_drop_up
Recommended Articles
Page :