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?

(A) \Theta(n) (B) \Theta(n + k) (C) \Theta(nk) (D) \Theta(n^2)

×

Problem Loading...

Note Loading...

Set Loading...