Consider the following operation along with Enqueue and Dequeue operations on…

GATE · 2013 · CS · Computer Science & IT

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 queue operations on an initially empty queue?

  1. A.

    \(Θ(n)\)

  2. B.

    \( Θ(n + k)\)

  3. C.

    \(Θ(nk) \)

  4. D.

    \(Θ(n^2) \)

Attempted by 646 students.

Show answer

Correct answer: A

The worked solution is available to enrolled students.

Video solution available to enrolled students.

Explore the full course: Iocl Engineers Officers Grade A Paper 2

Loading lesson…