Data Structures | Queue | Question 10

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) (B) (C) (D) 

(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 .

Hence Option (A) is the correct answer.

Quiz of this Question
Please comment below if you find anything wrong in the above post