GATE | CS | 2013 | Algorithms | Complexity Analysis | Question 44

Last Updated :
Discuss
Comments

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?

[Tex]\Theta{(n)}[/Tex]

[Tex]\Theta{(n+k)}[/Tex]

[Tex]\Theta{(nk)}[/Tex]

[Tex]\Theta{(n^{2})}[/Tex]

This question is part of this quiz :

GATE CS 2013,Algorithms GATE CS PYQ Quiz,Complexity Analysis GATE CS PYQ Quiz
Tags:
GATE
Algorithms
GATE CS
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy