GATE Computer Science (CS) 2013 Solved Paper
© examsiri.com
Question : 54 of 65
Marks:
+1,
-0
Consider the following operation along with Enqueue and Dequeue operations on queues, where k is a global parameter.
What is the worst case time complexity of a sequence of n queue operations on an initially empty queue?
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?
Go to Question: